Sciweavers

601 search results - page 79 / 121
» Model Checking CTL Properties of Pushdown Systems
Sort
View
JSC
2010
100views more  JSC 2010»
13 years 3 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
SPIN
2000
Springer
14 years 2 days ago
Modeling the ASCB-D Synchronization Algorithm with SPIN: A Case Study
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
Nicholas Weininger, Darren D. Cofer
TRUSTBUS
2007
Springer
14 years 2 months ago
The Meaning of Logs
While logging events is becoming increasingly common in computing, in communication and in collaborative environments, log systems need to satisfy increasingly challenging (if not ...
Sandro Etalle, Fabio Massacci, Artsiom Yautsiukhin
CAV
2004
Springer
96views Hardware» more  CAV 2004»
14 years 1 months ago
Widening Arithmetic Automata
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
Constantinos Bartzis, Tevfik Bultan
CBSE
2006
Springer
14 years 7 days ago
Verification of Component-Based Software Application Families
We present a novel approach which facilitates formal verification of component-based software application families using model checking. This approach enables effective composition...
Fei Xie, James C. Browne