Modular Compiler Verification [electronic resource] :A Refinement-Algebraic Approach Advocating Stepwise Abstraction /
Contributor(s): SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 1283Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1997.Description: XVI, 260 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540695394.Subject(s): Computer science | Special purpose computers | Architecture, Computer | Software engineering | Programming languages (Electronic computers) | Computer logic | Computer Science | Programming Languages, Compilers, Interpreters | Computer System Implementation | Software Engineering | Logics and Meanings of Programs | Special Purpose and Application-Based SystemsOnline resources: Click here to access online
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.