Author of the publication

Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis.

, , , , and . LPAR, volume 4246 of Lecture Notes in Computer Science, page 527-541. Springer, (2006)

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.

No persons found for author name Bruttomesso, Roberto
add a person with the name Bruttomesso, Roberto
 

Other publications of authors with the same name

MathSAT: Tight Integration of SAT and Mathematical Decision Procedures., , , , , , and . J. Autom. Reasoning, 35 (1-3): 265-293 (2005)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 fuer Informatik, (2011)An extension of lazy abstraction with interpolation for programs with arrays., , , , and . Formal Methods in System Design, 45 (1): 63-109 (2014)Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis., , , , and . Ann. Math. Artif. Intell., 55 (1-2): 63-99 (2009)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 in System Design, 45 (1): 1-41 (2014)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)Reachability Modulo Theory Library., , , , and . SMT@IJCAR, volume 20 of EPiC Series in Computing, page 67-76. EasyChair, (2012)Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis., , , , and . LPAR, volume 4246 of Lecture Notes in Computer Science, page 527-541. Springer, (2006)