Sciweavers

282 search results - page 26 / 57
» Verifying Commit-Atomicity Using Model-Checking
Sort
View
CAV
2010
Springer
282views Hardware» more  CAV 2010»
15 years 3 months ago
A NuSMV Extension for Graded-CTL Model Checking
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
Alessandro Ferrante, Maurizio Memoli, Margherita N...
ICSE
2009
IEEE-ACM
15 years 6 months ago
Verifying networked programs using a model checker extension
Model checking finds failures in software by exploring every possible execution schedule. Until recently it has been mainly applied to stand-alone applications. This paper presen...
Watcharin Leungwattanakit, Cyrille Artho, Masami H...
ISSTA
1998
ACM
15 years 4 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
LPAR
2005
Springer
15 years 5 months ago
Pushdown Module Checking
Model checking is a useful method to verify automatically the correctness of a system with respect to a desired behavior, by checking whether a mathematical model of the system sat...
Laura Bozzelli, Aniello Murano, Adriano Peron
JSC
2010
100views more  JSC 2010»
14 years 6 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