Underapproximating Predicate Transformers

DOI10.1007/11823230_9MaRDI QIDQ3613382zbMATH OpenOpenAlexFDO

Authors David A. Schmidt

Publication date 12 March 2009

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11823230_9

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Predicate transformers as power operations
• Predicate Abstraction with Under-approximation Refinement
• Predicate transformers for extended probability and non-determinism
• A calculus of logical relations for over- and underapproximating static analyses
• Closed and logical relations for over- and under-approximation of powersets

Cited in

(8)

• Abstract Interpretation from a Topological Perspective
• Inverse-limit and topological aspects of abstract interpretation
• Extracting program logics from abstract interpretations defined by logical relations
• Competent predicate abstraction in model checking
• Better Under-Approximation of Programs by Hiding Variables
• Internal and External Logics of Abstract Interpretations
• Closed and logical relations for over- and under-approximation of powersets
• Limits and difficulties in the design of under-approximation abstract domains

This page was built for publication: Underapproximating Predicate Transformers

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