Остановите войну!
for scientists:
default search action
Massimo Narizzano
- > Home > Persons > Massimo Narizzano
Publications
- 2023
- [c30]Massimo Narizzano, Armando Tacchella:
Verification Of Data-Intensive Embedded Systems. ECMS 2023: 521-527 - 2020
- [c29]Massimo Narizzano, Luca Pulina, Armando Tacchella, Simone Vuotto:
Automated Requirements-Based Testing of Black-Box Reactive Systems. NFM 2020: 153-169 - [i3]Massimo Narizzano, Luca Pulina, Armando Tacchella, Simone Vuotto:
Automated Requirements-Based Testing of Black-Box Reactive Systems. CoRR abs/2005.06750 (2020) - 2019
- [j15]Massimo Narizzano, Luca Pulina, Armando Tacchella, Simone Vuotto:
Property specification patterns at work: verification and inconsistency explanation. Innov. Syst. Softw. Eng. 15(3-4): 307-323 (2019) - [c28]Simone Vuotto, Massimo Narizzano, Luca Pulina, Armando Tacchella:
Automata based test generation with SpecPro. RET@ICSE 2019: 13-16 - [c27]Simone Vuotto, Massimo Narizzano, Luca Pulina, Armando Tacchella:
Poster: Automatic Consistency Checking of Requirements with ReqV. ICST 2019: 363-366 - 2018
- [c26]Massimo Narizzano, Luca Pulina, Armando Tacchella, Simone Vuotto:
Consistency of Property Specification Patterns with Boolean and Constrained Numerical Signals. NFM 2018: 383-398 - 2017
- [j12]Ali Khalili, Massimo Narizzano, Lorenzo Natale, Armando Tacchella:
Learning middleware models for verification of distributed control programs. Robotics Auton. Syst. 92: 139-151 (2017) - [i2]Massimo Narizzano, Luca Pulina, Armando Tacchella, Simone Vuotto:
Consistency of Property Specification Patterns with Boolean and Constrained Numerical Signals. CoRR abs/1712.04162 (2017) - 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) - [c25]Ali Khalili, Massimo Narizzano, Armando Tacchella:
Learning for Verification in Embedded Systems: A Case Study. AI*IA 2016: 525-538 - 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
- [i1]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas. CoRR abs/1111.0860 (2011) - 2009
- [j6]Massimo Narizzano, Claudia Peschiera, Luca Pulina, Armando Tacchella:
Evaluating and certifying QBFs: A comparison of state-of-the-art tools. AI Commun. 22(4): 191-210 (2009) - 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) - [c13]Massimo Narizzano, Luca Pulina, Armando Tacchella:
Ranking and Reputation Systems in the QBF Competition. AI*IA 2007: 97-108 - 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) - [j3]Massimo Narizzano, Luca Pulina, Armando Tacchella:
Report of the Third QBF Solvers Evaluation. J. Satisf. Boolean Model. Comput. 2(1-4): 145-164 (2006) - [c12]Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
Quantifier structure in search based procedures for QBFs. DATE 2006: 812-817 - [c11]Massimo Narizzano, Luca Pulina, Armando Tacchella:
The QBFEVAL Web Portal. JELIA 2006: 494-497 - 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 - [c6]Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella:
The Second QBF Solvers Comparative Evaluation. SAT (Selected Papers 2004: 376-392 - 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-04-21 17:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint