28 search results - page 2 / 6 » Model-Checking Games for Fixpoint Logics with Partial Order ... |
CIE
2008
Springer
13 years 4 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
CONCUR
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
TACAS
2007
Springer
13 years 10 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
DAC
2004
ACM
14 years 5 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...
ENTCS
2007
13 years 4 months ago
2007
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...