62 search results - page 1 / 13 » Boolean Abstraction for Temporal Logic Satisfiability |
CAV
2007
Springer
13 years 12 months ago
2007
Springer
FORMATS
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
BIRTHDAY
2008
Springer
13 years 7 months ago
2008
Springer
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...
FOSSACS
2007
Springer
13 years 9 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
SAT
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...