265 search results - page 11 / 53 » How to Prove Inductive Theorems |
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
CSL
2001
Springer
14 years 3 days ago
2001
Springer
We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures....
TPHOL
2003
IEEE
14 years 27 days ago
2003
IEEE
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...