Roberto Bruttomesso

According to our database1, Roberto Bruttomesso authored at least 30 papers between 2005 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Intrepid: A Scriptable and Cloud-Ready SMT-Based Model Checker.
Proceedings of the Formal Methods for Industrial Critical Systems, 2021

2014
Quantifier-free interpolation in combinations of equality interpolating theories.
ACM Trans. Comput. Log., 2014

Resolution proof transformation for compression and interpolation.
Formal Methods Syst. Des., 2014

An extension of lazy abstraction with interpolation for programs with arrays.
Formal Methods Syst. Des., 2014

2012
Quantifier-Free Interpolation of a Theory of Arrays
Log. Methods Comput. Sci., 2012

Automated Analysis of Parametric Timing-Based Mutual Exclusion Algorithms.
Proceedings of the NASA Formal Methods, 2012

Lazy Abstraction with Interpolants for Arrays.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

SAFARI: SMT-Based Abstraction for Arrays with Interpolants.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

The 2012 SMT Competition.
Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

From Strong Amalgamability to Modularity of Quantifier-Free Interpolation.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

Broadening the Scope of SMT-COMP: the Application Track.
Proceedings of the 1st International Workshop on Comparative Empirical Evaluation of Reasoning Systems, 2012

Reachability Modulo Theory Library.
Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2011
Rewriting-based Quantifier-free Interpolation for a Theory of Arrays.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints.
Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010
The OpenSMT Solver.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

A flexible schema for generating explanations in lazy theory propagation.
Proceedings of the 8th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), 2010

Flexible interpolation with local proof transformations.
Proceedings of the 2010 International Conference on Computer-Aided Design, 2010

An Efficient and Flexible Approach to Resolution Proof Reduction.
Proceedings of the Hardware and Software: Verification and Testing, 2010

2009
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis.
Ann. Math. Artif. Intell., 2009

A scalable decision procedure for fixed-width bit-vectors.
Proceedings of the 2009 International Conference on Computer-Aided Design, 2009

2008
The MathSAT 4SMT Solver.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007
A Lazy and Layered SMT($\mathcal{BV}$) Solver for Hard Industrial Verification Problems.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

Verifying Heap-Manipulating Programs in an SMT Framework.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2006
Efficient theory combination via boolean search.
Inf. Comput., 2006

To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in <i>SMT</i>(<i>EUF</i> È<i>T</i>).
Proceedings of the Logic for Programming, 2006

2005
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures.
J. Autom. Reason., 2005

Encoding RTL Constructs for MathSAT: a Preliminary Report.
Proceedings of the Third Workshop on Pragmatics of Decision Procedures in Automated Reasoning, 2005

An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

Efficient Satisfiability Modulo Theories via Delayed Theory Combination.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005



  Loading...