Sciweavers

718 search results - page 1 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
WADT
1999
Springer
13 years 10 months ago
Extraction of Structured Programs from Specification Proofs
John N. Crossley, Iman Poernomo, Martin Wirsing
TLCA
1993
Springer
13 years 9 months ago
Program Extraction from Normalization Proofs
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
Ulrich Berger
ICSE
2004
IEEE-ACM
14 years 5 months ago
Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
Wee Kheng Leow, Siau-Cheng Khoo, Yi Sun
KBSE
1999
IEEE
13 years 10 months ago
An ML Editor Based on Proofs-As-Programs
CYNTHIA is a novel editor for the functional programming language ML in which each function definition is represented as the proof of a simple specification. Users of CYNTHIA edit...
Jon Whittle, Alan Bundy, Richard J. Boulton, Helen...
ENTCS
2006
171views more  ENTCS 2006»
13 years 5 months ago
Program Extraction From Proofs of Weak Head Normalization
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
Malgorzata Biernacka, Olivier Danvy, Kristian St&o...