481 search results - page 29 / 97 » Model Checking Abstract State Machines and Beyond |
109
click to vote
ICSOC
2003
Springer
15 years 7 months ago
2003
Springer
Converting a conventional contract into an electronic equivalent is not trivial. The difficulties are caused by the ambiguities that the original human-oriented text is likely to c...
126
click to vote
CAV
2012
Springer
13 years 4 months ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
129
click to vote
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
115
click to vote
CAV
2000
Springer
15 years 5 months ago
2000
Springer
xample-Guided Abstraction Refinement for Symbolic Model Checking EDMUND CLARKE YUAN LU Carnegie Mellon University, Pittsburgh, Pennsylvania Broadcom Co., San Jose, California ORNA ...
129
Voted
CADE
2002
Springer
16 years 2 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...