A demonstrably correct compiler

DOI10.1007/BF01211435zbMath0712.68025OpenAlexW1973254452WikidataQ122860301 ScholiaQ122860301MaRDI QIDQ749202

D. Kharzeev

Publication date: 1991

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01211435

zbMATH Keywords

formal specificationdenotational semanticsPrologcorrect compilerDCTG

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (3)

Specification, verification and prototyping of an optimized compiler ⋮ Correct hardware synthesis ⋮ Deriving correctness properties of compiled code

Cites Work

• Compiler specification and verification
• Grammar Analysis and Parsing by Abstract Interpretation
• Logic programming and compiler writing
• Information-flow and data-flow analysis of while-programs
• Semantics of context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A demonstrably correct compiler