Internal and External Logics of Abstract Interpretations
From MaRDI portal
Recommendations
Cites work
- Boolean and Cartesian abstraction for model checking C programs
- Comparing Completeness Properties of Static Analyses and Their Logics
- Continuous Lattices and Domains
- Counterexample-guided abstraction refinement
- scientific article; zbMATH DE number 3938547 (Why is no real title available?)
- scientific article; zbMATH DE number 3735091 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3557754 (Why is no real title available?)
- scientific article; zbMATH DE number 3592938 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- Incompleteness, counterexamples, and refinements in abstract model-checking
- Making abstract interpretations complete
- Model checking guided abstraction and analysis
- Programming Languages and Systems
- Proving correctness of compiler optimizations by temporal logic
- Sometime = always + recursion always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- Systematic design of program transformation frameworks by abstract interpretation
- Temporal abstract interpretation
- Underapproximating Predicate Transformers
Cited in
(5)
This page was built for publication: Internal and External Logics of Abstract Interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452722)