275 search results - page 10 / 55 » The Complexity of Generalized Satisfiability for Linear Temp... |
HASE
2005
IEEE
14 years 1 months ago
2005
IEEE
Checking various temporal requirements is a key dependability concern in safety-critical systems. As modelchecking approaches do not scale well to systems of high complexity the r...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
CAV
2009
Springer
14 years 2 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...