44651 search results - page 435 / 8931 » Generalized |
212
click to vote
FOSSACS
2007
Springer
15 years 10 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...
188
click to vote
FMCAD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
183
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
183
click to vote
ARCS
2004
Springer
15 years 10 months ago
2004
Springer
: In order to investigate the impact of dynamic hardware reconfiguration on general-purpose applications, we present a superscalar micro-architecture that includes a variable numbe...
184
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...