220 search results - page 33 / 44 » Coq Modulo Theory |
160
click to vote
TPHOL
2000
IEEE
15 years 10 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
176
click to vote
MPC
1995
Springer
15 years 10 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
207
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
184
click to vote
ENTCS
2007
15 years 6 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
175
click to vote
SAT
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...