Limits and difficulties in the design of under-approximation abstract domains

DOI10.1007/978-3-030-99253-8_2OpenAlexW4226041497MaRDI QIDQ6141757

Roberta Gori, Roberto Bruni, Flavio Ascari

Publication date: 23 January 2024

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

Full work available at URL: https://doi.org/10.1007/978-3-030-99253-8_2

zbMATH Keywords

abstract interpretationabstract domainsimpossibility resultsunder-approximation

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• A calculus of logical relations for over- and underapproximating static analyses
• Local reasoning about the presence of bugs: incorrectness separation logic
• Precondition Inference from Intermittent Assertions and Application to Contracts on Collections
• Continuous Reasoning
• Systematic design of program transformation frameworks by abstract interpretation
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Limits and difficulties in the design of under-approximation abstract domains