Comparison of abstract interpretations

DOI10.1007/3-540-55719-9_101MaRDI QIDQ5204344zbMATH OpenOpenAlexFDO

Authors Agostino Cortesi, Gilberto File, William Winsborough

Publication date 4 December 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55719-9_101

zbMATH Keywords

abstract interpretationcomplete latticepropositional formulasubject domain

Mathematics Subject Classification ID

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

Recommendations

• The quotient of an abstract interpretation
• Abstract interpretation and application to logic programs
• On the power of abstract interpretation
• Making abstract interpretations complete
• scientific article; zbMATH DE number 1538024

Cites work

• A practical framework for theabstract interpretation of logic programs
• Comparison of abstract interpretations
• Systematic design of program transformation frameworks by abstract interpretation

Cited in

(13)

• Completeness of string analysis for dynamic languages
• Verification, Model Checking, and Abstract Interpretation
• Generalizing simulation to abstract domains
• The powerset operator on abstract interpretations
• COMPARISON BETWEEN INTERACTION CONCEPTS
• Comparison of abstract interpretations
• Set-sharing is redundant for pair-sharing
• Refining abstract interpretations
• Computing abstract distances in logic programs
• scientific article; zbMATH DE number 1534584 (Why is no real title available?)
• A lattice for abstract interpretation of dynamic (LISP-like) structures
• Design of abstract domains using first-order logic
• Abstract interpretation as a programming language

This page was built for publication: Comparison of abstract interpretations

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