An algebraic approach to the design of compilers for object-oriented languages

DOI10.1007/s00165-009-0124-9zbMath1214.68126OpenAlexW2084918693WikidataQ121755633 ScholiaQ121755633MaRDI QIDQ607399

Augusto Sampaio, Adolfo Duran, Ana Cavalcanti

Publication date: 22 November 2010

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

Full work available at URL: https://repositorio.ufpe.br/handle/123456789/2092

zbMATH Keywords

refinementalgebraic transformationcompiler correctness

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Related Items

A UTP approach for rTiMo ⋮ UTP Semantics for rTiMo ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ Correct hardware synthesis

Uses Software

• Coq
• Maude

Cites Work

• Modular compiler verification. A refinement-algebraic approach advocating stepwise abstraction
• More on advice on structuring compilers and proving them correct
• Compiler specification and verification
• Normal form approach to compiler design
• A formal model of real-time program compilation
• Algebraic reasoning for object-oriented programming
• An Algebraic Approach to Compiler Design
• Refinement Calculus
• Object-Orientation in the UTP
• A Theory of Pointers for the UTP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item