Modular compiler verification : a refinement-algebraic approach advocating stepwise abstraction
Author(s)
Bibliographic Information
Modular compiler verification : a refinement-algebraic approach advocating stepwise abstraction
（Lecture notes in computer science, 1283）
Springer, c1997
Available at / 43 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||128397034092
-
INTERNATIONAL CHRISTIAN UNIVERSITY LIBRARY図
V.1283007.6/L507/v.128305006138,
007.6/L507/v.128305006138 -
University of Tsukuba Library, Library on Library and Information Science
007.08:L-49:1283971006080
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
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.
by "Nielsen BookData"
