276 search results - page 1 / 56 » From Model-Checking to Temporal Logic Constraint Solving |
CP
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
CADE
2002
Springer
14 years 11 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 ...
CONCUR
2003
Springer
14 years 4 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
DBPL
2001
Springer
14 years 3 months ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...