Princess

swMATH6872MaRDI QIDQ18941FDOQ18941

Author name not available (Why is that?)

Cited In (28)

• ICE-based refinement type discovery for higher-order functional programs
• Reasoning in the theory of heap: satisfiability and interpolation
• Preface: Special issue on interpolation
• Proof tree preserving tree interpolation
• Interpolation systems for ground proofs in automated deduction: a survey
• Title not available (Why is that?)
• Parallelizing SMT solving: lazy decomposition and conciliation
• Quantifier-free interpolation in combinations of equality interpolating theories
• An interpolating sequent calculus for quantifier-free Presburger arithmetic
• An extension of lazy abstraction with interpolation for programs with arrays
• Guiding Craig interpolation with domain-specific abstractions
• An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
• Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
• On recursion-free Horn clauses and Craig interpolation
• Complete instantiation-based interpolation
• Efficient interpolant generation in satisfiability modulo linear integer arithmetic
• Interpolation and Model Checking
• SAT-Based Model Checking
• Craig interpolation with clausal first-order tableaux
• Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic
• Learning inductive invariants by sampling from frequency distributions
• Quantifier-free interpolation of a theory of arrays
• Lazy Abstraction with Interpolants for Arrays
• On Interpolation in Decision Procedures
• Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic
• A Calculus for Modular Loop Acceleration
• A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints
• Rewriting-based Quantifier-free Interpolation for a Theory of Arrays.

This page was built for software: Princess