Interpolation Properties and SAT-Based Model Checking (original) (raw)
Related papers
Craig Interpolation and Proof Manipulation
Extending Proof Tree Preserving Interpolation to Sequences and Trees (Work in Progress)
2013
Leveraging Interpolant Strength in Model Checking
Lecture Notes in Computer Science, 2012
Proof Tree Preserving Interpolation
Cornell University - arXiv, 2017
Extending Proof Tree Preserving Interpolation to Sequences and Trees
2015
Bounded Model Checking with Parametric Data Structures
Electronic Notes in Theoretical Computer Science, 2007
Stepping forward with interpolants in unbounded model checking
International Conference on Computer Aided Design, 2006
On the existence of polynomial time algorithms for interpolation problems in propositional logic
Notre Dame Journal of Formal Logic, 1988
Harmonious logic: Craig's interpolation theorem and its descendants
Partitioning Interpolant-Based Verification for Effective Unbounded Model Checking
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2010
Interpolant Tree Automata and their Application in Horn Clause Verification
Electronic Proceedings in Theoretical Computer Science
On-the-fly model checking from interval logic specifications
Sigplan Notices, 2002
PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification
Lecture Notes in Computer Science, 2013
From Strong Amalgamability to Modularity of Quantifier-Free Interpolation
arXiv (Cornell University), 2012
Flexible interpolation with local proof transformations
2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2010
A Note on the Interpolation Theorem in First Order Logic
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1982
Exploiting partial variable assignment in interpolation-based model checking
Formal Methods in System Design, 2019
Failure of interpolation in relevant logics
Journal of Philosophical Logic, Vol. 22, 449-479, 1993
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
Electronic Colloquium on Computational Complexity, 2008
Information and Computation, 2018
2010
Practical Tractability of CSPS by Higher Level Consistency and Tree Decomposition
2013
Proof Tree Preserving Sequence Interpolation of Quantified Formulas in the Theory of Equality
2021
Ground interpolation for the theory of equality
Logical Methods in Computer Science, 2012
Combination of Uniform Interpolants via Beth Definability
Journal of Automated Reasoning
Uniform approaches to the verification of finite state systems
State University of New York at Albany, Albany, NY, 1997
Refinement of LTL formulas for abstract model checking
Static Analysis, 2002
Symbolic verification with gap-order constraints
Lecture Notes in Computer Science, 1997
Reformulation and Approximation in Model Checking
Lecture Notes in Computer Science, 2000
An abstract decision procedure for satisfiability in the theory of recursive data types
Electronic Notes in Theoretical Computer …, 2007
Theory and Practice of Logic Programming, 2003
The Complexity of Model Checking Higher-Order Fixpoint Logic
Logical Methods in Computer Science, 2007
Boosting interpolation with dynamic localized abstraction and redundancy removal
ACM Transactions on Design Automation of Electronic Systems, 2008
More on Trees and Finite Satisfiability: The Taming of Terms. 11 PUBLICATIONS 12 CITATIONS
Assistance à l'Abstraction de Composants Virtuels pour la Vérification Rapide de Systèmes Numériques