Author:
Griggio Alberto,Le Thi Thieu Hoa,Sebastiani Roberto
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Angelo Brillout, Daniel Kroening, Philipp Rümmer, and Thomas Wahl. An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic. InProc. IJCAR, volume 6173 ofLNCS. Springer, 2010.
2. C. Barrett, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Splitting on Demand in SAT Modulo Theories. InProc. LPAR'06, volume 4246 ofLNCS. Springer, 2006.
3. C. W. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli. Satisfiability Modulo Theories. InHandbook of Satisfiability, chapter 25. IOS Press, 2009.
4. A. Cimatti, A. Griggio, and R. Sebastiani. Efficient Generation of Craig Interpolants in Satisfiability Modulo Theories.ACM Trans. Comput. Logic, 12(1), October 2010.
5. I. Dillig, T. Dillig, and A. Aiken. Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers. InProc. CAV'09, volume 5643 ofLNCS. Springer, 2009.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic;Formal Methods in System Design;2021-05-12
2. Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic;Tools and Algorithms for the Construction and Analysis of Systems;2020
3. The MathSAT5 SMT Solver;Tools and Algorithms for the Construction and Analysis of Systems;2013
4. An Abstract Interpretation of DPLL(T);Lecture Notes in Computer Science;2013
5. Software Model Checking via IC3;Computer Aided Verification;2012