136 search results - page 19 / 28 » Boolean Formulas and Frequent Sets |
TCS
2008
14 years 9 months ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
PG
2007
IEEE
15 years 3 months ago
2007
IEEE
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
100
click to vote
ATVA
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
105
click to vote
FOSSACS
2007
Springer
15 years 1 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...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...