Modular compiler verification. A refinement-algebraic approach advocating stepwise abstraction
From MaRDI portal
Publication:396975
DOI10.1007/BFb0027453zbMath1293.68013MaRDI QIDQ396975
Publication date: 14 August 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Theory of compilers and interpreters (68N20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (6)
A formally verified compiler back-end ⋮ An algebraic approach to the design of compilers for object-oriented languages ⋮ Algebraic translations, correctness and algebraic compiler construction ⋮ A Completely Verified Realistic Bootstrap Compiler ⋮ PLC-automata: A new class of implementable real-time automata ⋮ A formal model of real-time program compilation
This page was built for publication: Modular compiler verification. A refinement-algebraic approach advocating stepwise abstraction
