Moving proofs-as-programs into practice

Caldwell, James L.

doi:10.1109/ase.1997.632819

Cited by 12 publications

(14 citation statements)

References 5 publications

(10 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, we have made modifications to the type theoretic formalization to guarantee the program extracted from the proof is free of the non-computational junk that often clutters programs extracted from constructive proofs. The methodology of using set types in place of existential quantifiers to generate efficient extracts has been described elsewhere [5,6]. The second difference between the formalization presented here and that of ACU is in the proof type used as evidence of validity.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Intuitionisitic Tableau Extracted

Caldwell

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents a formalization of a sequent presentation of intuitionisitic propositional logic and proof of decidability. The proof is implemented in the Nuprl system and the resulting proof object yields a "correct-by-construction" program for deciding intuitionisitc propositional sequents. The extracted program turns out to be an implementation of the tableau algorithm. If the argument to the resulting decision procedure is a valid sequent, a formal proof of that fact is returned, otherwise a counter-example in the form of a Kripke Countermodel is returned. The formalization roughly follows Aitken, Constable and Underwood's presentation in [1] but a number of adjustments and corrections have been made to ensure the extracted program is clean (no non-computational junk) and efficient.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Methods of generating efficient and readable extracts by the use of the set type (as opposed to the existential type) and by efficient general recursion combinators have been presented by the author in [5,4,6]. We reiterate the main points here.…”

Section: Clean and Efficient Extractsmentioning

confidence: 98%

Intuitionisitic Tableau Extracted

Caldwell

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Almost fifty years ago the idea of actually deriving code directly from the specification (such as that advocated in [22]) started a large programme for deductive program synthesis, 1 that is still active now [5,11,25,29]. However, proposed solutions are largely domain-specific, require considerable expertise on the part of their users, and in some cases do not actually guarantee that the synthesized program will meet all requirements stated up front [11].…”

Section: Introductionmentioning

confidence: 99%

Designing Security Requirements Models Through Planning

Bryl

Massacci

Mylopoulos

et al. 2006

Notes on Numerical Fluid Mechanics and Multidisciplinary Design

View full text Add to dashboard Cite

Abstract. The quest for designing secure and trusted software has led to refined Software Engineering methodologies that rely on tools to support the design process. Automated reasoning mechanisms for requirements and software verification are by now a well-accepted part of the design process, and model driven architectures support the automation of the refinement process. We claim that we can further push the envelope towards the automatic exploration and selection among design alternatives and show that this is concretely possible for Secure Tropos, a requirements engineering methodology that addresses security and trust concerns. In Secure Tropos, a design consists of a network of actors (agents, positions or roles) with delegation/permission dependencies among them. Accordingly, the generation of design alternatives can be accomplished by a planner which is given as input a set of actors and goals and generates alternative multiagent plans to fulfill all given goals. We validate our claim with a case study using a state-of-the-art planner.

show abstract

“…It does not really explain how to go about developing a significantly sized piece of software. Caldwell [2] explains how to extract small recursive programs from inductive proofs in Nuprl. The most significant extraction in Coq to date appears to be Théry's synthesis of Buchberger's algorithm [13].…”

Section: Program Extractionmentioning

confidence: 99%

“…In CAP files, instead, tokens are ascribed to the various entities. The idea is that if a method, say, is publicly visible 2 , then it is ascribed a token. If the method is only visible within its package, then it is referred to directly using an offset into the relevant data structure.…”

Section: Java Cardmentioning

confidence: 99%

The synthesis of a Java card tokenisation algorithm

Denney¹

Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001)

View full text Add to dashboard Cite

:We describe the development of a Java bytecode optimisation algorithm by the methodology of program extraction. We develop the algorithm as a collection of proofs and definitions in the Coq proof assistant, and then use Coq's extraction mechanism to automatically generate a program in OCaml. The extraction methodology guarantees that this program is correct. We discuss the feasibility of the methodology and suggest some improvements that could be made. The authors and the University of Edinburgh retain the right to reproduce and publish this paper for non-commercial purposes.Permission is granted for this report to be reproduced by others for non-commercial purposes as long as this copyright notice is reprinted in full in any reproduction. Applications to make other use of the material should be addressed in the first instance to Copyright Permissions, Division of Informatics, The University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, Scotland. The Synthesis of a Java Card Tokenisation Algorithm

show abstract

Moving proofs-as-programs into practice

Abstract: Proofs in the Nuprl system, an implementation of a constructive type theory, yield "correct-by-construction" programs. In

Cited by 12 publications

References 5 publications

Intuitionisitic Tableau Extracted

Intuitionisitic Tableau Extracted

Designing Security Requirements Models Through Planning

The synthesis of a Java card tokenisation algorithm

Contact Info

Product

Resources

About