Sciweavers

640 search results - page 15 / 128
» Discovering State Invariants
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 9 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
14 years 2 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
ISCAS
2005
IEEE
127views Hardware» more  ISCAS 2005»
14 years 4 months ago
A novel property of the second-order modes of discrete-time systems under variable transformation
Abstract— This paper derives a novel property of the secondorder modes of discrete-time systems under variable transformation. This is the generalization of the theory presented ...
Shunsuke Koshita, Masahide Abe, Masayuki Kawamata
KBSE
1999
IEEE
14 years 3 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
JSC
2010
100views more  JSC 2010»
13 years 5 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov