Complexity and Algorithms for Monomial and Clausal Predicate Abstraction

DOI10.1007/978-3-642-02959-2_18zbMath1250.68194OpenAlexW1592240200MaRDI QIDQ5191104

Shuvendu K. Lahiri, Shaz Qadeer

Publication date: 28 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02959-2_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35)

Related Items (3)

Invariant inference with provable complexity from the monotone theory ⋮ SAT-based invariant inference and its relation to concept learning ⋮ ExplainHoudini: Making Houdini Inference Transparent

Uses Software

• SMT-LIB
• Houdini

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Back to the future
• Abstractions from proofs
• Constraint-Based Invariant Inference over Predicate Abstraction
• Lazy abstraction
• Unifying type checking and property checking for low-level code
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Complexity and Algorithms for Monomial and Clausal Predicate Abstraction