1996 search results - page 87 / 400 » A decision procedure for linear |
175
click to vote
CADE
2007
Springer
16 years 6 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...
181
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
251
click to vote
FASE
2004
Springer
15 years 10 months ago
2004
Springer
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
274
click to vote
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
187
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...