1302 search results - page 87 / 261 » Free-Style Theorem Proving |
188
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
136
click to vote
FM
2008
Springer
15 years 6 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
134
click to vote
TOCL
2008
15 years 4 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
138
click to vote
MICS
2010
15 years 2 months ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
148
click to vote
POPL
2012
ACM
13 years 12 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...