More on advice on structuring compilers and proving them correct

DOI10.1016/0304-3975(81)90080-3zbMath0468.68007OpenAlexW1984841973WikidataQ122858403 ScholiaQ122858403MaRDI QIDQ1156472

Eric G. Wagner, James W. Thatcher, Jesse B. Wright

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90080-3

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (11)

Continuation semantics for flowgraph equations ⋮ Two-level semantics and code generation ⋮ Functional programming with combinators ⋮ An algebraic approach to the design of compilers for object-oriented languages ⋮ Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^† ⋮ Classes of finite relations as initial abstract data types. I ⋮ From Grammars and Automata to Algebras and Coalgebras ⋮ Initial semantics of logic specifications with negation ⋮ Semantics of algorithmic languages ⋮ Formalization of universal algebra in Agda ⋮ Algebraic characterization of reducible flowcharts

Cites Work

• Proving a compiler correct: A simple approach
• Parallel realization of systems, using factorizations and quotients in categories
• A semantically meaningful characterization of reducible flowchart schemes
• Initial Algebra Semantics and Continuous Algebras
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• Heterogeneous algebras
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: More on advice on structuring compilers and proving them correct