12 search results - page 2 / 3 » On Using Floating-Point Computations to Help an Exact Linear... |
CONCUR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
CSL
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
VLSID
2002
IEEE
14 years 5 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
SIGSOFT
2006
ACM
13 years 11 months ago
2006
ACM
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...