Internal and External Logics of Abstract Interpretations

DOI10.1007/978-3-540-78163-9_23zbMath1138.68362OpenAlexW1584674264MaRDI QIDQ5452722

David A. Schmidt

Publication date: 4 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-78163-9_23

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Abstract interpretation as automated deduction ⋮ Abstract Interpretation as Automated Deduction ⋮ Complete Abstractions and Subclassical Modal Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
• Underapproximating Predicate Transformers
• Continuous Lattices and Domains
• Temporal abstract interpretation
• Systematic design of program transformation frameworks by abstract interpretation
• Proving correctness of compiler optimizations by temporal logic
• Programming Languages and Systems
• Making abstract interpretations complete
• Comparing Completeness Properties of Static Analyses and Their Logics

This page was built for publication: Internal and External Logics of Abstract Interpretations