Modular Compiler Verification A Refinement-Algebraic Approach Advocating Stepwise Abstraction /

Müller-Olm, Markus.

Modular Compiler Verification A Refinement-Algebraic Approach Advocating Stepwise Abstraction / [electronic resource] : by Markus Müller-Olm. - 1st ed. 1997. - XVI, 260 p. online resource. - Lecture Notes in Computer Science, 1283 1611-3349 ; . - Lecture Notes in Computer Science, 1283 .

Complete Boolean lattices -- Galois connections -- States, valuation functions and predicates -- The algebra of commands -- Communication and time -- Data refinement -- Transputer base model -- A small hard real-time programming language -- A hierarchy of views -- Compiling-correctness relations -- Translation theorems -- A functional implementation -- Conclusion.

This book presents the verified design of a code generator translating a prototypic real-time programming language to an actual microprocessor, the Inmos Transputer. Unlike most other work on compiler verification, and with particular emphasis on modularity, it systematically covers correctness of translation down to actual machine code, a necessity in the area of safety-critical systems. The formal framework provided as well as the novel proof-engineering ideas incorporated in the verified code generator are also of relevance for software design in general.

9783540695394

10.1007/BFb0027453 doi


Compilers (Computer programs).
Computer systems.
Software engineering.
Computer science.
Computers, Special purpose.
Compilers and Interpreters.
Computer System Implementation.
Software Engineering.
Computer Science Logic and Foundations of Programming.
Special Purpose and Application-Based Systems.

QA76.76.C65

005.45
© 2024 IIIT-Delhi, library@iiitd.ac.in