5 search results - page 1 / 1 » Automatic Synthesis of Decision Procedures: A Case Study of ... |
MKM
2007
Springer
13 years 11 months ago
2007
Springer
We address the problem of automatic synthesis of decision procedures. Our synthesis mechanism consists of several stages and submechanisms and is well-suited to the proof-planning ...
AMAI
2007
Springer
13 years 5 months ago
2007
Springer
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
CADE
2004
Springer
14 years 5 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
TACAS
2000
Springer
13 years 8 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...