Procedure Compilation in the Refinement Calculus
Lermer, Karl & Fidge, Colin J. (2006) Procedure Compilation in the Refinement Calculus. Formal Aspects of Computing, 18(2), pp. 152-180.
High-level language program compilation strategies can be proven correct by modelling the process as a series of refinement steps from source code to a machine-level description. We show how this can be done for programs containing recursively-defined procedures in the well-established predicate transformer semantics for refinement. To do so the formalism is extended with an abstraction of the way stack frames are created at run time for procedure parameters and variables.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
|Item Type:||Journal Article|
|Keywords:||Program refinement, Program compilation, Procedures, Predicate transformers|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Copyright Owner:||Copyright 2006 Springer|
|Copyright Statement:||The original publication is available at SpringerLink
|Deposited On:||24 Oct 2006 00:00|
|Last Modified:||29 Feb 2012 13:22|
Repository Staff Only: item control page