713 search results - page 34 / 143 » Model Checking and Transitive-Closure Logic |
168
click to vote
FM
2003
Springer
15 years 11 months ago
2003
Springer
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
163
click to vote
CMSB
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In systems biology, the number of models of cellular processes increases rapidly, but re-using models in different contexts or for different questions remains a challengi...
142
click to vote
CAV
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal µ-calculus capable of defining non-regular properties. Some empiri...
144
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
169
click to vote
DSN
2002
IEEE
15 years 11 months ago
2002
IEEE
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...