Author of the publication

An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic.

, , , , , , and . TACAS, volume 3440 of Lecture Notes in Computer Science, page 317-333. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Quantifier-Free Interpolation of a Theory of Arrays, , and . Logical Methods in Computer Science, (2012)An Efficient and Flexible Approach to Resolution Proof Reduction., , and . Haifa Verification Conference, volume 6504 of Lecture Notes in Computer Science, page 182-196. Springer, (2010)A scalable decision procedure for fixed-width bit-vectors., and . ICCAD, page 13-20. ACM, (2009)Automated Analysis of Parametric Timing-Based Mutual Exclusion Algorithms., , , and . NASA Formal Methods, volume 7226 of Lecture Notes in Computer Science, page 279-294. Springer, (2012)Quantifier-free interpolation in combinations of equality interpolating theories., , and . ACM Trans. Comput. Log., 15 (1): 5:1-5:34 (2014)Resolution proof transformation for compression and interpolation., , , and . Formal Methods Syst. Des., 45 (1): 1-41 (2014)Reachability Modulo Theory Library., , , , and . SMT@IJCAR, volume 20 of EPiC Series in Computing, page 67-76. EasyChair, (2012)An extension of lazy abstraction with interpolation for programs with arrays., , , , and . Formal Methods Syst. Des., 45 (1): 63-109 (2014)Verifying Heap-Manipulating Programs in an SMT Framework., , , and . ATVA, volume 4762 of Lecture Notes in Computer Science, page 237-252. Springer, (2007)Rewriting-based Quantifier-free Interpolation for a Theory of Arrays., , and . RTA, volume 10 of LIPIcs, page 171-186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)