Sciweavers

718 search results - page 3 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
COMPSAC
2002
IEEE
14 years 13 days ago
A Simple Mathematically Based Framework for Rule Extraction from an Arbitrary Programming Language
Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a su...
Frederick V. Ramsey, James J. Alpigini
JLP
2006
81views more  JLP 2006»
13 years 7 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
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...
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
13 years 11 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
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 ...
Catherine Parent