Normal form approach to compiler design

DOI10.1007/BF01191809zbMath0790.68023WikidataQ122442545 ScholiaQ122442545MaRDI QIDQ1323320

Jifeng He, C. A. R. Hoare, Augusto Sampaio

Publication date: 2 June 1994

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

correctnesscompiler designreduction to normal formalgebraic transformationsDijkstra's guarded command language

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (14)

A UTP approach for rTiMo ⋮ Specification, verification and prototyping of an optimized compiler ⋮ An algebraic approach to the design of compilers for object-oriented languages ⋮ Jifeng He at Oxford and beyond: an appreciation ⋮ Theoretical and practical approaches to the denotational semantics for MDESL based on UTP ⋮ Denotational semantics and its algebraic derivation for an event-driven system-level language ⋮ UTP Semantics for rTiMo ⋮ A framework for quantum-classical cryptographic translation ⋮ Unnamed Item ⋮ Compiling quantum programs ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ Correct hardware synthesis ⋮ A formal model of real-time program compilation ⋮ Normal form approach to compiler design

Uses Software

• OBJ3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theoretical basis for stepwise refinement and the programming calculus
• Prespecification in data refinement
• The weakest prespecification
• Reasoning algebraically about recursion
• Normal form approach to compiler design
• Laws of programming
• Guarded commands, nondeterminacy and formal derivation of programs
• An axiomatic basis for computer programming

This page was built for publication: Normal form approach to compiler design