Comparing Completeness Properties of Static Analyses and Their Logics

DOI10.1007/11924661_12MaRDI QIDQ5385595zbMATH OpenOpenAlexFDO

Authors David A. Schmidt

Publication date 6 May 2008

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11924661_12

Mathematics Subject Classification ID

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

Recommendations

• Complete abstractions everywhere
• Analyzing program analyses
• Making abstract interpretations complete
• On the power of abstract interpretation
• scientific article; zbMATH DE number 1222407

Cited in

(17)

• Abstract interpretation from a denotational-semantics perspective
• Analyzing program analyses
• Complete abstractions everywhere
• Complete abstractions and subclassical modal logics
• Modelling declassification policies using abstract domain completeness
• Abstract Interpretation from a Topological Perspective
• Inverse-limit and topological aspects of abstract interpretation
• scientific article; zbMATH DE number 1222407 (Why is no real title available?)
• Summarized dimensions revisited
• What you lose is what you leak: information leakage in declassification policies
• Extracting program logics from abstract interpretations defined by logical relations
• Internal and External Logics of Abstract Interpretations
• Observational Completeness on Abstract Interpretation
• Logics for extensional, locally complete analysis via domain refinements
• Correctness of static flow analysis in continuation semantics
• A calculus of logical relations for over- and underapproximating static analyses
• 3-valued abstraction: More precision at less cost

This page was built for publication: Comparing Completeness Properties of Static Analyses and Their Logics

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