62 search results - page 2 / 13 » Boolean Abstraction for Temporal Logic Satisfiability |
CADE
2002
Springer
15 years 10 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 ...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
FM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
103
click to vote
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the...