default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoberto Bruttomesso
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j7]Simone Fulvio Rollini, Roberto Bruttomesso, Natasha Sharygina
, Aliaksei Tsitovich:
Resolution proof transformation for compression and interpolation. Formal Methods Syst. Des. 45(1): 1-41 (2014)- [j6]Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
An extension of lazy abstraction with interpolation for programs with arrays. Formal Methods Syst. Des. 45(1): 63-109 (2014) - [j5]Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
Quantifier-free interpolation in combinations of equality interpolating theories. ACM Trans. Comput. Log. 15(1): 5:1-5:34 (2014) - 2012
- [j4]Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
Quantifier-Free Interpolation of a Theory of Arrays. Log. Methods Comput. Sci. 8(2) (2012) - 2009
- [j3]Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani:
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis. Ann. Math. Artif. Intell. 55(1-2): 63-99 (2009) - 2006
- [j2]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani:
Efficient theory combination via boolean search. Inf. Comput. 204(10): 1493-1525 (2006) - 2005
- [j1]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani:
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures. J. Autom. Reason. 35(1-3): 265-293 (2005)
Conference and Workshop Papers
- 2021
- [c24]Roberto Bruttomesso:
Intrepid: A Scriptable and Cloud-Ready SMT-Based Model Checker. FMICS 2021: 202-211 - 2012
- [c23]Roberto Bruttomesso, Alberto Griggio:
Broadening the Scope of SMT-COMP: the Application Track. COMPARE 2012: 18-27 - [c22]Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
Reachability Modulo Theory Library. SMT@IJCAR 2012: 67-76 - [c21]Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
From Strong Amalgamability to Modularity of Quantifier-Free Interpolation. IJCAR 2012: 118-133 - [c20]David R. Cok, Alberto Griggio, Roberto Bruttomesso, Morgan Deters:
The 2012 SMT Competition. SMT@IJCAR 2012: 131-142 - [c19]Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
SAFARI: SMT-Based Abstraction for Arrays with Interpolants. CAV 2012: 679-685 - [c18]Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
Lazy Abstraction with Interpolants for Arrays. LPAR 2012: 46-61 - [c17]Roberto Bruttomesso, Alessandro Carioni, Silvio Ghilardi, Silvio Ranise:
Automated Analysis of Parametric Timing-Based Mutual Exclusion Algorithms. NASA Formal Methods 2012: 279-294 - 2011
- [c16]Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints. FroCoS 2011: 103-118 - [c15]Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
Rewriting-based Quantifier-free Interpolation for a Theory of Arrays. RTA 2011: 171-186 - 2010
- [c14]Simone Rollini, Roberto Bruttomesso, Natasha Sharygina:
An Efficient and Flexible Approach to Resolution Proof Reduction. Haifa Verification Conference 2010: 182-196 - [c13]Roberto Bruttomesso, Simone Rollini, Natasha Sharygina, Aliaksei Tsitovich:
Flexible interpolation with local proof transformations. ICCAD 2010: 770-777 - [c12]Roberto Bruttomesso, Edgar Pek, Natasha Sharygina:
A flexible schema for generating explanations in lazy theory propagation. MEMOCODE 2010: 41-48 - [c11]Roberto Bruttomesso, Edgar Pek, Natasha Sharygina, Aliaksei Tsitovich:
The OpenSMT Solver. TACAS 2010: 150-153 - 2009
- [c10]Roberto Bruttomesso, Natasha Sharygina:
A scalable decision procedure for fixed-width bit-vectors. ICCAD 2009: 13-20 - 2008
- [c9]Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani:
The MathSAT 4SMT Solver. CAV 2008: 299-303 - 2007
- [c8]Zvonimir Rakamaric, Roberto Bruttomesso, Alan J. Hu, Alessandro Cimatti:
Verifying Heap-Manipulating Programs in an SMT Framework. ATVA 2007: 237-252 - [c7]Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Ziyad Hanna, Alexander Nadel, Amit Palti, Roberto Sebastiani:
A Lazy and Layered SMT($\mathcal{BV}$) Solver for Hard Industrial Verification Problems. CAV 2007: 547-560 - 2006
- [c6]Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani:
Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis. LPAR 2006: 527-541 - [c5]Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Alessandro Santuari, Roberto Sebastiani:
To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in SMT(EUF ÈT). LPAR 2006: 557-571 - 2005
- [c4]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani:
The MathSAT 3 System. CADE 2005: 315-321 - [c3]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani:
Efficient Satisfiability Modulo Theories via Delayed Theory Combination. CAV 2005: 335-349 - [c2]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani:
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic. TACAS 2005: 317-333 - [c1]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Ziyad Hanna, Zurab Khasidashvili, Amit Palti, Roberto Sebastiani:
Encoding RTL Constructs for MathSAT: a Preliminary Report. PDPAR@CAV 2005: 3-14
Informal and Other Publications
- 2013
- [i2]Simone Fulvio Rollini, Roberto Bruttomesso, Natasha Sharygina, Aliaksei Tsitovich:
Resolution Proof Transformation for Compression and Interpolation. CoRR abs/1307.2028 (2013) - 2012
- [i1]Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
From Strong Amalgamability to Modularity of Quantifier-Free Interpolation. CoRR abs/1203.3730 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
