Procedure compilation in the refinement calculus

DOI10.1007/S00165-006-0091-3MaRDI QIDQ2432239zbMATH OpenOpenAlexFDO

Authors Karl Lermer, Colin Fidge

Publication date 25 October 2006

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://eprints.qut.edu.au/224936/1/5318.pdf

zbMATH Keywords

Predicate transformersProceduresProgram compilationProgram refinement

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 1104382
• A calculus of refinements for program derivations
• scientific article; zbMATH DE number 2090154
• scientific article; zbMATH DE number 1538032
• Refinement of Higher-Order Logic Programs

Cited in

(6)

• Correctness of procedure representations in higher-order assembly language
• Interfaces for refining recursion and procedures
• Compiler Construction
• scientific article; zbMATH DE number 2090154 (Why is no real title available?)
• A theoretical basis for stepwise refinement and the programming calculus
• scientific article; zbMATH DE number 1538032 (Why is no real title available?)

This page was built for publication: Procedure compilation in the refinement calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432239)