Comparing Completeness Properties of Static Analyses and Their Logics
From MaRDI portal
Publication:5385595
DOI10.1007/11924661_12zbMath1168.68364OpenAlexW1527969866MaRDI QIDQ5385595
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
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (10)
Inverse-limit and topological aspects of abstract interpretation ⋮ 3-valued abstraction: More precision at less cost ⋮ Summarized Dimensions Revisited ⋮ Internal and External Logics of Abstract Interpretations ⋮ Abstract Interpretation From a Denotational-semantics Perspective ⋮ Observational Completeness on Abstract Interpretation ⋮ Abstract Interpretation from a Topological Perspective ⋮ Modelling declassification policies using abstract domain completeness ⋮ What You Lose is What You Leak: Information Leakage in Declassification Policies ⋮ Extracting Program Logics From Abstract Interpretations Defined by Logical Relations
This page was built for publication: Comparing Completeness Properties of Static Analyses and Their Logics
