The following pages link to Abstractions from proofs (Q3452263):
Displayed 50 items.
- Proof tree preserving tree interpolation (Q286737) (← links)
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
- LCTD: test-guided proofs for C programs on LLVM (Q338629) (← links)
- SAT-based verification for timed component connectors (Q433331) (← links)
- Resolution proof transformation for compression and interpolation (Q479815) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- Constraint solving for interpolation (Q604394) (← links)
- On recursion-free Horn clauses and Craig interpolation (Q746767) (← links)
- Efficient generation of small interpolants in CNF (Q746773) (← links)
- Refining abstract interpretations (Q765513) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- Common knowledge does not have the Beth property (Q987837) (← links)
- Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations (Q1039847) (← links)
- Experience of improving the BLAST static verification tool (Q1758710) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- Infinite-state invariant checking with IC3 and predicate abstraction (Q2363814) (← links)
- Specifying graph languages with type graphs (Q2423749) (← links)
- An interpolating theorem prover (Q2575736) (← links)
- Predicate diagrams for the verification of real-time systems (Q2642985) (← links)
- View-Augmented Abstractions (Q2814101) (← links)
- Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF (Q2817919) (← links)
- A Configurable CEGAR Framework with Interpolation-Based Refinements (Q2827465) (← links)
- Whale: An Interpolation-Based Algorithm for Inter-procedural Verification (Q2891400) (← links)
- On Interpolation in Decision Procedures (Q3010355) (← links)
- ExplainHoudini: Making Houdini Inference Transparent (Q3075491) (← links)
- Distributed and Predictable Software Model Checking (Q3075493) (← links)
- A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints (Q3172885) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Interpolation and Model Checking (Q3176372) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Abstraction Refinement for Quantified Array Assertions (Q3392917) (← links)
- Refinement of Trace Abstraction (Q3392921) (← links)
- Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction (Q3510827) (← links)
- Probabilistic CEGAR (Q3512491) (← links)
- Towards the Verification of Attributed Graph Transformation Systems (Q3540407) (← links)
- Verifying Reference Counting Implementations (Q3617768) (← links)
- Abstract Counterexamples for Non-disjunctive Abstractions (Q3646262) (← links)
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (Q4913868) (← links)
- Interpolant Generation for UTVPI (Q5191101) (← links)
- Ground Interpolation for Combined Theories (Q5191102) (← links)
- Interpolation and Symbol Elimination (Q5191103) (← links)
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction (Q5191104) (← links)
- Automation of Quantitative Information-Flow Analysis (Q5300883) (← links)
- Quantifier-free interpolation in combinations of equality interpolating theories (Q5410332) (← links)
- Efficient Interpolant Generation in Satisfiability Modulo Theories (Q5458340) (← links)