Sciweavers

90 search results - page 5 / 18
» From Pre-historic to Post-modern Symbolic Model Checking
Sort
View
FMCAD
2000
Springer
15 years 10 months ago
A Theory of Consistency for Modular Synchronous Systems
We propose a model for modular synchronous systems with combinational dependencies and define consistency using this model. We then show how to derive this model from a modular spe...
Randal E. Bryant, Pankaj Chauhan, Edmund M. Clarke...
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
15 years 8 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
CONCUR
1997
Springer
15 years 10 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
LICS
2003
IEEE
15 years 11 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
CAV
2007
Springer
108views Hardware» more  CAV 2007»
16 years 21 days ago
Systematic Acceleration in Regular Model Checking
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
Bengt Jonsson, Mayank Saksena