Interpolant Strength

From MaRDI portal
Publication:3656880

DOI10.1007/978-3-642-11319-2_12zbMath1273.68225OpenAlexW2913808178WikidataQ62040465 ScholiaQ62040465MaRDI QIDQ3656880

Mitra Purandare, Vijay D'Silva, Daniel Kroening, Georg Weissenbacher

Publication date: 14 January 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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




Related Items (24)

Extracting unsatisfiable cores for LTL via temporal resolutionPreface: Special issue on interpolationLabelled interpolation systems for hyper-resolution, clausal, and local proofsProof tree preserving tree interpolationInterpolation systems for ground proofs in automated deduction: a surveyLattice-based refinement in bounded model checkingGuiding Craig interpolation with domain-specific abstractionsInterpolation and Model CheckingInterpolation with guided refinement: revisiting incrementality in SAT-based unbounded model checkingIncremental preprocessing methods for use in BMCResolution proof transformation for compression and interpolationFarkas-based tree interpolationOn Interpolation in Decision ProceduresHow to deal with unbelievable assertionsExploiting partial variable assignment in interpolation-based model checkingUnnamed ItemEfficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable KeysBeyond Quantifier-Free Interpolation in Extensions of Presburger ArithmeticPredicate Generation for Learning-Based Quantifier-Free Loop Invariant InferenceEfficient generation of small interpolants in CNFInterpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUFNIL: learning nonlinear interpolantsInterpolating bit-vector formulas using uninterpreted predicates and Presburger arithmeticOn interpolation in automated theorem proving




This page was built for publication: Interpolant Strength