Proving a compiler correct: A simple approach

DOI10.1016/S0022-0000(75)80007-9zbMath0304.68022WikidataQ123218781 ScholiaQ123218781MaRDI QIDQ1216945

Andrea Maggiolo-Schettini, Giorgio Germano

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items

Computable stack functions for semantics of stack programs ⋮ Unnamed Item ⋮ Sequence recursiveness without cylindrification and limited register machines ⋮ More on advice on structuring compilers and proving them correct ⋮ General iteration and unary functions ⋮ Sequence-to-sequence recursiveness ⋮ Closure functions and general iterates as reflectors

Cites Work

• Sequence-to-sequence recursiveness
• Towards a theory of semantics and compilers for programming languages
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• Semantics of context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item