Modular compiler verification : a refinement-algebraic approach advocating stepwise abstraction
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 t...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
1283 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Modular compiler verification, a refinement-algebraic approach advocating stepwise abstraction, Markus Müller-Olm, 1997, Berlin, Springer, 1 vol. (XII-250 p.), Lecture notes in computer science, 3-540-63406-1 • Modular Compiler Verification, Texte imprimé, 9783662167144 |
Sisällysluettelo:
- 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.