A Case Study in Abstract Interpretation Based Program Transformation

DOI10.1016/S1571-0661(04)80954-XzbMath1260.68089MaRDI QIDQ4917048

Patrick Cousot, Radhia Cousot

Publication date: 26 April 2013

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

A zonotopic framework for functional abstractions

Uses Software

• CVT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Corrigendum: On infinite computations in denotational semantics
• Deforestation: Transforming programs to eliminate trees
• Constructive versions of Tarski's fixed point theorems
• The code validation tool (CVT). Automatic verification of a compilation process
• A lattice-theoretical fixpoint theorem and its applications
• Program Slicing
• Countable nondeterminism and random assignment
• A Transformation System for Developing Recursive Programs
• Abstract Interpretation Frameworks

This page was built for publication: A Case Study in Abstract Interpretation Based Program Transformation