Supporting contexts in program refinement

Nickson, Ray; Hayes, Ian J.

doi:10.1016/s0167-6423(97)00002-6

Cited by 13 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our propagation algorithm can be viewed as a mechanism for managing proof context information. We are investigating more complex proof frameworks, such as program window inference [27] that provide rules for managing this information, making the propagation step of our approach unnecessary. Our architecture also relies on the correctness of E-Setheo.…”

Section: Discussionmentioning

confidence: 99%

Synthesizing Certified Code

Whalen

Schumann

Fischer

2002

FME 2002:Formal Methods—Getting IT Right

View full text Add to dashboard Cite

Abstract. Code certification is a lightweight approach for formally demonstrating software quality. Its basic idea is to require code producers to provide formal proofs that their code satisfies certain quality properties. These proofs serve as certificates that can be checked independently. Since code certification uses the same underlying technology as program verification, it requires detailed annotations (e.g., loop invariants) to make the proofs possible. However, manually adding annotations to the code is time-consuming and error-prone. We address this problem by combining code certification with automatic program synthesis. Given a high-level specification, our approach simultaneously generates code and all annotations required to certify the generated code. We describe a certification extension of AutoBayes, a synthesis tool for automatically generating data analysis programs. Based on built-in domain knowledge, proof annotations are added and used to generate proof obligations that are discharged by the automated theorem prover E-SETHEO. We demonstrate our approach by certifying operator-and memory-safety on a data-classification program. For this program, our approach was faster and more precise than PolySpace, a commercial static analysis tool.

show abstract

Section: Discussionmentioning

confidence: 99%

Synthesizing Certified Code

Whalen

Schumann

Fischer

2002

FME 2002:Formal Methods—Getting IT Right

View full text Add to dashboard Cite

show abstract

“…It consists of extensions to the Ergo theorem prover [MNU97,NU95,UNT96]. In particular, it is based on the Program Window Inference paradigm [NH97], which allows refinement steps and proofs of side conditions to be performed in a similar manner.…”

Section: The Program Refinement Toolmentioning

confidence: 99%

“…Let 'hide(x, H)' be an operator that returns hypothesis list H less any hypotheses that refer to term x. Finally, let 'sp.S.P ' be the strongest postcondition resulting from starting statement S in a state satisfying precondition predicate P [NH97].…”

Section: Real-time Refinement and Opening Rulesmentioning

confidence: 99%

The Variety of Variables in Automated Real-Time Refinement

2003

View full text Add to dashboard Cite

Abstract. The refinement calculus is a well-established theory for deriving program code from specifications. Recent research has extended the theory to handle timing requirements, as well as functional ones, and we have developed an interactive programming tool based on these extensions. Through a number of case studies completed using the tool, this paper explains how the tool helps the programmer by supporting the many forms of variables needed in the theory. These include simple state variables as in the untimed calculus, trace variables that model the evolution of properties over time, auxiliary variables that exist only to support formal reasoning, subroutine parameters, and variables shared between parallel processes.

show abstract

“…PRT supports the goal-directed program window inference [17] style of refinement. It provides a multi-window user interface, programmer-definable tactics, and the ability to record and replay proof scripts.…”

Section: The Real-time Refinement Toolmentioning

confidence: 99%

Computer-aided development of a real-time program

Wildman

Fidge

Carrington

2000

Software - Concepts & Tools

View full text Add to dashboard Cite

The refinement calculus is a well-established theory for formal development of imperative program code and is supported by a number of automated tools. Via a detailed case study, this article shows how refinement theory and tool support can be extended for a program with real-time constraints. The approach adapts a timed variant of the refinement calculus and makes corresponding enhancements to a theorem-prover based refinement tool.

show abstract

Supporting contexts in program refinement

Cited by 13 publications

References 12 publications

Synthesizing Certified Code

Synthesizing Certified Code

The Variety of Variables in Automated Real-Time Refinement

Computer-aided development of a real-time program

Contact Info

Product

Resources

About