Logical Interpretation: Static Program Analysis Using Theorem Proving

DOI10.1007/978-3-540-73595-3_11zbMATH Open1213.68210OpenAlexW1503472559MaRDI QIDQ3608771FDOQ3608771

Authors: Sumit Gulwani, Ashish Tiwari 

Publication date: 6 March 2009

Published in: Automated Deduction – CADE-21 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73595-3_11

Recommendations

• scientific article; zbMATH DE number 1949621
• Computer Aided Verification
• scientific article; zbMATH DE number 1497823
• Static analysis, abstract interpretation and verification in (constraint logic) programming
• Abstract interpretation as automated deduction

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (17)

• Computer Aided Verification
• Title not available (Why is that?)
• Predicate abstraction in a program logic calculus
• Zap: Automated Theorem Proving for Software Analysis
• Title not available (Why is that?)
• Incremental computation of succinct abstractions for hybrid systems
• Automated Reasoning with Analytic Tableaux and Related Methods
• Logical approximation for program analysis
• Invariant Checking for Programs with Procedure Calls
• Title not available (Why is that?)
• Abstract Interpretation as Automated Deduction
• Language-independent generation of logic representations for programs
• Static analysis by abstract interpretation: a mathematical programming approach
• Predicate Abstraction in a Program Logic Calculus
• Rethinking static analysis by combining discrete and continuous reasoning
• Precise reasoning for programs using containers
• Abstract interpretation as automated deduction

Uses Software

• ESC/Java
• Octagon

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)