default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimo Narizzano
- > Home > Persons > Massimo Narizzano
Publications
- 2021
[p2]Enrico Giunchiglia
, Paolo Marin, Massimo Narizzano:
Reasoning with Quantified Boolean Formulas. Handbook of Satisfiability 2021: 1157-1176- 2016
- [j11]Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella, Enrico Giunchiglia:
Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows. Fundam. Informaticae 149(1-2): 133-158 (2016) - 2015
- [c24]Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella, Enrico Giunchiglia:
An Empirical Perspective on Ten Years of QBF Solving. RCRA@AI*IA 2015: 62-75 - [c23]Ali Khalili, Massimo Narizzano, Armando Tacchella, Enrico Giunchiglia:
Automatic Test-Pattern Generation for Grey-Box Programs. AST@ICSE 2015: 33-37 - 2011
- [j9]Matthew Lewis, Tobias Schubert, Bernd Becker, Paolo Marin, Massimo Narizzano, Enrico Giunchiglia:
Parallel QBF Solving with Advanced Knowledge Sharing. Fundam. Informaticae 107(2-3): 139-166 (2011) - [i1]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas. CoRR abs/1111.0860 (2011) - 2010
- [j8]Damiano Angeletti, Enrico Giunchiglia, Massimo Narizzano, Alessandra Puddu, Salvatore Sabina:
Using Bounded Model Checking for Coverage Analysis of Safety-Critical Software in an Industrial Setting. J. Autom. Reason. 45(4): 397-414 (2010) - [j7]Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
QuBE7.0. J. Satisf. Boolean Model. Comput. 7(2-3): 83-88 (2010) - [c22]Emanuele Di Rosa, Enrico Giunchiglia, Massimo Narizzano, Gabriele Palma, Alessandra Puddu:
Automatic generation of high quality test sets via CBMC. VERIFY@IJCAR 2010: 65-78 - [c21]Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning. SAT 2010: 85-98 - 2009
- [c20]Damiano Angeletti, Enrico Giunchiglia, Massimo Narizzano, Gabriele Palma, Alessandra Puddu, Salvatore Sabina:
Improving the Automatic Test Generation process for Coverage Analysis using CBMC. RCRA@AI*IA 2009 - [c19]Paolo Marin, Matthew Lewis, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia:
Evaluation of Knowledge Sharing Strategies in a Parallel QBF Solver. RCRA@AI*IA 2009 - [c18]Damiano Angeletti, Enrico Giunchiglia, Massimo Narizzano, Alessandra Puddu, Salvatore Sabina:
Automatic Test Generation for Coverage Analysis Using CBMC. EUROCAST 2009: 287-294 - [c17]Damiano Angeletti, Enrico Giunchiglia, Massimo Narizzano, Alessandra Puddu, Salvatore Sabina:
Automatic Test Generation for Coverage Analysis of ERTMS Software. ICST 2009: 303-306 - [c16]Paolo Marin, Massimo Narizzano, Enrico Giunchiglia, Matthew Lewis, Tobias Schubert, Bernd Becker:
Comparison of knowledge sharing strategies in a parallel QBF solver. HPCS 2009: 161-167 - [c15]Matthew Lewis, Paolo Marin, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia:
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing. SAT 2009: 509-523 - [p1]Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
Reasoning with Quantified Boolean Formulas. Handbook of Satisfiability 2009: 761-780 - 2008
- [c14]Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
Preprocessing Techniques for QBFs. RCRA 2008 - 2007
- [j5]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Quantifier Structure in Search-Based Procedures for QBFs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(3): 497-507 (2007) - 2006
- [j4]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas. J. Artif. Intell. Res. 26: 371-416 (2006) - [c12]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Quantifier structure in search based procedures for QBFs. DATE 2006: 812-817 - 2004
- [c10]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Monotone Literals and Learning in QBF Reasoning. CP 2004: 260-273 - [c9]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
QuBE++: An Efficient QBF Solver. FMCAD 2004: 201-213 - [c8]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
QBF Reasoning on Real-World Instances. SAT 2004 - [c7]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
QBF Reasoning on Real-World Instances. SAT (Selected Papers 2004: 105-121 - 2003
- [j2]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Backjumping for Quantified Boolean Logic satisfiability. Artif. Intell. 145(1-2): 99-120 (2003) - [c5]Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella:
Watched Data Structures for QBF Solvers. SAT 2003: 25-36 - 2002
- [c4]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Learning for Quantified Boolean Logic Satisfiability. AAAI/IAAI 2002: 649-654 - 2001
- [j1]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella, Moshe Y. Vardi:
Towards an Efficient Library for SAT: a Manifesto. Electron. Notes Discret. Math. 9: 290-310 (2001) - [c3]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability. AI*IA 2001: 111-122 - [c2]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. IJCAR 2001: 364-369 - [c1]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Backjumping for Quantified Boolean Logic Satisfiability. IJCAI 2001: 275-281
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-05-31 18:40 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:
