115 search results - page 6 / 23 » A Compact Linear Translation for Bounded Model Checking |
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
CADE
2007
Springer
15 years 9 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
94
Voted
CADE
2002
Springer
15 years 9 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 ...
97
Voted
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...