Sciweavers

4047 search results - page 257 / 810
» Algebraic Model Checking
Sort
View
FORTE
2008
15 years 8 months ago
Checking Correctness of Transactional Behaviors
Abstract. The Signal Calculus is an asynchronous process calculus featuring multicast communication. It relies on explicit modeling of the communication structure of the network (c...
Vincenzo Ciancia, Gian Luigi Ferrari, Roberto Guan...
CSFW
2003
IEEE
15 years 12 months ago
Automatic Validation of Protocol Narration
We perform a systematic expansion of protocol narrations into terms of a process algebra in order to make precise some of the detailed checks that need to be made in a protocol. W...
Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, ...
IJBC
2007
86views more  IJBC 2007»
15 years 6 months ago
Optimization and the Miranda Approach in Detecting Horseshoe-Type Chaos by Computer
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
Balázs Bánhelyi, Tibor Csendes, Barn...
STACS
1999
Springer
15 years 11 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
FUIN
2007
104views more  FUIN 2007»
15 years 6 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
Andrzej Zbrzezny, Agata Pólrola