1138 search results - page 34 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
ISOLA
2004
Springer
14 years 1 months ago
2004
Springer
We study consistency, satisfiability, and validity problems for collectively model checking a set of views endowed with labelled transitions, hybrid constraints on states, and ato...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
We model the well-known Sum-and-Product problem in a modal logic, and verify its solution in a model checker. The modal logic is public announcement logic. The riddle is then imple...
QEST
2007
IEEE
14 years 2 months ago
2007
IEEE
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...