Comparison of abstract interpretations

DOI10.1007/3-540-55719-9_101zbMath1425.68066OpenAlexW1507069282MaRDI QIDQ5204344

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

complete latticeabstract interpretationpropositional formulasubject domain

Mathematics Subject Classification ID

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

Related Items (6)

Computing Abstract Distances in Logic Programs ⋮ The powerset operator on abstract interpretations ⋮ Design of abstract domains using first-order logic ⋮ Comparison of abstract interpretations ⋮ Completeness of string analysis for dynamic languages ⋮ Set-sharing is redundant for pair-sharing

Cites Work

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

This page was built for publication: Comparison of abstract interpretations