A Tool for Developing Correct Programs by Refinement

Carrington, David; Hayes, Ian J.; Nickson, Ray; Watson, Geoffrey; Welsh, Jim

doi:10.14236/ewic/rw1996.3

Cited by 12 publications

(6 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Systems like Cocktail [17], Refine [22], Refinement Calculator [9] and PRT [10] provide tool support for the refinement based formal program derivation. Cocktail offers a proof-editor for first-order logic which is partially automated by a tableau based theorem prover.…”

Section: Related Workmentioning

confidence: 99%

Building an IDE for the Calculational Derivation of Imperative Programs

Chaudhari¹,

Damani²

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

In this paper, we describe an IDE called CAPS (Calculational Assistant for Programming from Specifications) for the interactive, calculational derivation of imperative programs. In building CAPS, our aim has been to make the IDE accessible to non-experts while retaining the overall flavor of the pen-and-paper calculational style. We discuss the overall architecture of the CAPS system, the main features of the IDE, the GUI design, and the trade-offs involved.

show abstract

Section: Related Workmentioning

confidence: 99%

Building an IDE for the Calculational Derivation of Imperative Programs

Chaudhari¹,

Damani²

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…In the following, we present some selected rules for generation and discharging of proof obligations as rewrite rules 9 . The syntax for expressions and statements in Maude is very similar to the syntax of the Isabelle lemmas; in fact, the communication between the tools can be done by a simple maude export expression and a script that replaces some reserved key symbols, in the remainder of the section we stick to a slightly simplified presentation of the rules; in particular, we omit the environment taking track of details like number of open obligations and similar.…”

Section: Rewriting Rulesmentioning

confidence: 99%

A framework for automated and certified refinement steps

Griesmayer

Liu

Morisset

et al. 2012

Innovations Syst Softw Eng

View full text Add to dashboard Cite

The refinement calculus provides a methodology for transforming an abstract specification into a concrete implementation, by following a succession of refinement rules. These rules have been mechanized in theorem-provers, thus providing a formal and rigorous way to prove that a given program refines another one. In a previous work, we have extended this mechanization for object-oriented programs, where the memory is represented as a graph, and we have integrated our approach within the rCOS tool, a model-driven software development tool providing a refinement language. Hence, for any refinement step, the tool automatically generates the corresponding proof obligations and the user can manually discharge them, using a provided library of refinement lemmas. In this work, we propose an approach to automate the search of possible refinement rules from a program to another, using the rewriting tool Maude. Each refinement rule in Maude is associated with the corresponding lemma in Isabelle, thus allowing the tool to automatically generate the Isabelle proof when a refinement rule can be automatically found. The user can add a new refinement rule by providing the corresponding Maude rule and Isabelle lemma.

show abstract

“…Both are implicit in Morgan's book[20], though he doesn't give the laws explicitly. Both are also consequences of the monotonicity theorem given by Vickers and Morgan[29], where they are proved jointly 4. x u y is the greatest lower bound (i.e.…”

mentioning

confidence: 90%

“…We are considering program refinement in the context of a refinement tool (e.g. [28], [11], [26], [4]). Thus, we view refinement as beginning with a specification and proceeding by the application of refinement rules, which have been shown to be valid.…”

Section: Introductionmentioning

confidence: 99%

Procedures in the Refinement Calculus: A New Approach?

Groves

1996

Electronic Workshops in Computing

View full text Add to dashboard Cite

We examine the use of procedures in the refinement calculus and show that the traditional approach leads to certain problems when programs are not constructed in a strictly top-down manner. These problems arise because a procedure name becomes associated with the implementation when the procedure body is refined, and we examine some ways in which they may be avoided. We argue that, because procedures are not required in order to express procedural abstractions, the primary purpose of using procedures in program refinement is to do with packaging the final program, and that decisions about how a program is packaged into procedures should be made separately from algorithm design decisions. We present an alternative approach based on this rationale which avoids the aforementioned problems, and discuss ways in which it can be supported by a refinement tool. BCS-FACS 7th Refinement Workshop

show abstract

A Tool for Developing Correct Programs by Refinement

Cited by 12 publications

References 27 publications

Building an IDE for the Calculational Derivation of Imperative Programs

Building an IDE for the Calculational Derivation of Imperative Programs

A framework for automated and certified refinement steps

Procedures in the Refinement Calculus: A New Approach?

Contact Info

Product

Resources

About