A tool for developing correct programs by refinement

Authors:
D. Carrington;I. Hayes;R. Nickson;G. Watson;J. Welsh
Affiliations:
Software Verification Research Centre, Department of Computer Science, The University of Queensland, Queensland, Australia;Software Verification Research Centre, Department of Computer Science, The University of Queensland, Queensland, Australia;Software Verification Research Centre, Department of Computer Science, The University of Queensland, Queensland, Australia;Software Verification Research Centre, Department of Computer Science, The University of Queensland, Queensland, Australia;Software Verification Research Centre, Department of Computer Science, The University of Queensland, Queensland, Australia
Venue:
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Year:
1996

Citing 14
Cited 5

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
Natural deduction as higher-order resolution

Journal of Logic Programming
A theoretical basis for stepwise refinement and the programming calculus

Science of Computer Programming
A calculus of refinements for program derivations

Acta Informatica
Types and invariants in the refinement calculus

Science of Computer Programming
The term rewriting approach to automated theorem proving

Journal of Logic Programming
Mechanized support for stepwise refinement

Proceedings of the international conference on Programming languages and system architectures
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
Program development by stepwise refinement

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
Specification Case Studies

Specification Case Studies
Mural: A Formal Development Support System

Mural: A Formal Development Support System
The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs

Proceedings of the 5th Conference on Automated Deduction
Predicate Transformers and Higher Order Logic

Proceedings of the REX Workshop on Sematics: Foundations and Applications

Multi-threading and message communication in Qu-Prolog

Theory and Practice of Logic Programming
A graph-based implementation for mechanized refinement calculus of OO programs

SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Proving Reachability in B using Substitution Refinement

Electronic Notes in Theoretical Computer Science (ENTCS)
A tool for logic program refinement

2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
A framework for automated and certified refinement steps

Innovations in Systems and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The refinement calculus for the development of programs from specifications is well suited to mechanised support. We review the requirements for tool support of refinement as gleaned from our experience with a number of existing refinement tools, and report on the design and implementation of a new tool to support refinement based on these requirements. The main features of the new tool are close integration of refinement and proof in a single tool (the same mechanism is used for both), good management of the refinement context, an extensible theory base that allows the tool to be adapted to new application domains, and a flexible user interface.