A formal model of real-time program compilation

Lermer, K. and Fidge, C. (2002) A formal model of real-time program compilation. Theoretical Computer Science, 282 1: 151-190. doi:10.1016/S0304-3975(01)00047-0

Author Lermer, K.
Fidge, C.
Title A formal model of real-time program compilation
Journal name Theoretical Computer Science   Check publisher's open access policy
ISSN 0304-3975
Publication date 2002
Sub-type Article (original research)
DOI 10.1016/S0304-3975(01)00047-0
Volume 282
Issue 1
Start page 151
End page 190
Total pages 40
Place of publication Netherlands
Publisher Elsevier Science B.V.
Collection year 2002
Language eng
Subject C1
280302 Software Engineering
700199 Computer software and services not elsewhere classified
Abstract Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code, Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword Computer Science, Theory & Methods
Refinement Calculus
Program Compilation
Program Semantics
Real-time Programming
Program Verification
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collections: Excellence in Research Australia (ERA) - Collection
School of Information Technology and Electrical Engineering Publications
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 5 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 8 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 14 Aug 2007, 17:46:28 EST