More on advice on structuring compilers and proving them correct

DOI10.1016/0304-3975(81)90080-3MaRDI QIDQ1156472zbMATH OpenOpenAlexWikidataFDO

Authors James W. Thatcher, Eric G. Wagner, 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

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

Cites work

• scientific article; zbMATH DE number 3683033 (Why is no real title available?)
• scientific article; zbMATH DE number 3485184 (Why is no real title available?)
• scientific article; zbMATH DE number 3512082 (Why is no real title available?)
• scientific article; zbMATH DE number 3562490 (Why is no real title available?)
• scientific article; zbMATH DE number 3598613 (Why is no real title available?)
• scientific article; zbMATH DE number 3614152 (Why is no real title available?)
• scientific article; zbMATH DE number 1142321 (Why is no real title available?)
• scientific article; zbMATH DE number 3291623 (Why is no real title available?)
• scientific article; zbMATH DE number 3342643 (Why is no real title available?)
• scientific article; zbMATH DE number 3410594 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• A semantically meaningful characterization of reducible flowchart schemes
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Heterogeneous algebras
• Initial Algebra Semantics and Continuous Algebras
• Parallel realization of systems, using factorizations and quotients in categories
• Proving a compiler correct: A simple approach

Cited in

(11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156472)