35 search results - page 2 / 7 » Rewriting Induction Linear Arithmetic = Decision Procedure |
CADE
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
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
2006
Springer
14 years 5 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
CHARME
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. As of version 2.7, the ACL2 theorem prover has been extended to automatically verify sets of polynomial inequalities that include nonlinear relationships. In this paper w...
FSTTCS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...