In this paper we extend the conventional framework of program refinement down to the assembler level. We describe an extension to the Refinement Calculus that supports the refinement of programs in the Guarded Command Language to programs in .NET assembler. This is illustrated by a small example
Abstract. Program compilation can be formally defined as a sequence of equivalence-preserving transf...
The refinement calculus for the development of programs from specifications is well suited to mechan...
Discussion of a simple example demonstrates various expressive limitations of the refinement calculu...
We propose a method which integrates program modification to the refinement calculus style of progra...
The refinement calculus is a formal technique for the development of programs which are provably cor...
This paper explores the role for mechanised support for refining specifications to executable progra...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
High-level language program compilation strategies can be proven correct by modelling the process as...
High-level language program compilation strategies can be proven correct by modelling the process as...
Previous work on formally modelling and analysing program compilation has shown the need for a simpl...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...
AbstractThe stepwise refinement technique is studied from a mathematical point of view. A relation o...
Abstract. A refinement calculus provides a method for transforming specifica-tions to executable cod...
A refinement calculus provides a method for transforming specifications to executable code, maintain...
We advocate an automated refinement approach to developing programs and their proofs. The approach i...
Abstract. Program compilation can be formally defined as a sequence of equivalence-preserving transf...
The refinement calculus for the development of programs from specifications is well suited to mechan...
Discussion of a simple example demonstrates various expressive limitations of the refinement calculu...
We propose a method which integrates program modification to the refinement calculus style of progra...
The refinement calculus is a formal technique for the development of programs which are provably cor...
This paper explores the role for mechanised support for refining specifications to executable progra...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
High-level language program compilation strategies can be proven correct by modelling the process as...
High-level language program compilation strategies can be proven correct by modelling the process as...
Previous work on formally modelling and analysing program compilation has shown the need for a simpl...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...
AbstractThe stepwise refinement technique is studied from a mathematical point of view. A relation o...
Abstract. A refinement calculus provides a method for transforming specifica-tions to executable cod...
A refinement calculus provides a method for transforming specifications to executable code, maintain...
We advocate an automated refinement approach to developing programs and their proofs. The approach i...
Abstract. Program compilation can be formally defined as a sequence of equivalence-preserving transf...
The refinement calculus for the development of programs from specifications is well suited to mechan...
Discussion of a simple example demonstrates various expressive limitations of the refinement calculu...
DOI
Add to ORKG