32 search results - page 3 / 7 » Proof Search and Proof Check for Equational and Inductive Th... |
HICSS
1994
IEEE
13 years 9 months ago
1994
IEEE
1 This paper presents a methodology to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use att...
ICFP
2008
ACM
14 years 5 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...
CATS
2007
13 years 6 months ago
2007
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
FMCAD
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
JAR
2008
13 years 5 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...