Logical Interpretation: Static Program Analysis Using Theorem Proving
From MaRDI portal
Publication:3608771
Recommendations
Cited in
(17)- Logical approximation for program analysis
- Abstract interpretation as automated deduction
- Static analysis by abstract interpretation: a mathematical programming approach
- Language-independent generation of logic representations for programs
- Incremental computation of succinct abstractions for hybrid systems
- scientific article; zbMATH DE number 4178742 (Why is no real title available?)
- Invariant Checking for Programs with Procedure Calls
- Abstract Interpretation as Automated Deduction
- Predicate Abstraction in a Program Logic Calculus
- scientific article; zbMATH DE number 1949621 (Why is no real title available?)
- scientific article; zbMATH DE number 1956566 (Why is no real title available?)
- Computer Aided Verification
- Zap: Automated Theorem Proving for Software Analysis
- Precise reasoning for programs using containers
- Automated Reasoning with Analytic Tableaux and Related Methods
- Predicate abstraction in a program logic calculus
- Rethinking static analysis by combining discrete and continuous reasoning
This page was built for publication: Logical Interpretation: Static Program Analysis Using Theorem Proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608771)