A Case Study in Abstract Interpretation Based Program Transformation

DOI10.1016/S1571-0661(04)80954-XMaRDI QIDQ4917048zbMATH OpenFDO

Authors Patrick Cousot, Radhia Cousot

Publication date 26 April 2013

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

Full work available at URL https://doi.org/10.1016/S1571-0661(04)80954-X

Mathematics Subject Classification ID

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

Cites work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• A lattice-theoretical fixpoint theorem and its applications
• A Transformation System for Developing Recursive Programs
• Abstract Interpretation Frameworks
• Constructive versions of Tarski's fixed point theorems
• Corrigendum: On infinite computations in denotational semantics
• Countable nondeterminism and random assignment
• Deforestation: Transforming programs to eliminate trees
• scientific article; zbMATH DE number 3485178 (Why is no real title available?)
• scientific article; zbMATH DE number 1231565 (Why is no real title available?)
• scientific article; zbMATH DE number 783754 (Why is no real title available?)
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• Program Slicing
• The code validation tool (CVT). Automatic verification of a compilation process

Cited in

(1)

• A zonotopic framework for functional abstractions

Describes a project that uses

Uses Software

• CVT

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

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