1996 search results - page 53 / 400 » A decision procedure for linear |
162
click to vote
IJAR
2006
15 years 6 months ago
2006
We describe a new graphical language for specifying asymmetric decision problems. The language is based on a filtered merge of several existing languages including sequential valu...
236
click to vote
TACAS
2000
Springer
15 years 10 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
204
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
174
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
288
click to vote
POPL
2011
ACM
14 years 9 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...