Correctness proofs of syntax-directed processing descriptions by attributes

DOI10.1016/0022-0000(79)90009-6zbMath0416.68075OpenAlexW2069800771WikidataQ111465599 ScholiaQ111465599MaRDI QIDQ754662

M. Amirchahy, C. Pair, David L. Neel

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90009-6

zbMATH Keywords

programming languagestext processingcorrectness proofcompiler optimizationsattributes semanticsfinding non-executed statements in a programsyntax-directed processing descriptions

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (2)

Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming ⋮ Semantic equivalence of covering attribute grammars

Cites Work

• Semantics of context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Correctness proofs of syntax-directed processing descriptions by attributes