Sciweavers

632 search results - page 17 / 127
» Combining programming with theorem proving
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Pattern minimization problems over recursive data types
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...
Alexander Krauss
ENTCS
2006
169views more  ENTCS 2006»
13 years 7 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
CIE
2007
Springer
14 years 1 months ago
Characterizing Programming Systems Allowing Program Self-reference
The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming lan...
John Case, Samuel E. Moelius
CADE
2007
Springer
14 years 8 months ago
Combining Deduction and Algebraic Constraints for Hybrid System Analysis
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
André Platzer
LPNMR
1990
Springer
13 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote