default search action
Sergio Nocco
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j13]Daniela Cardone
, David Perpetuini
Classification of Drivers' Mental Workload Levels: Comparison of Machine Learning Methods Based on ECG and Infrared Thermal Signals. Sensors 22(19): 7300 (2022)
2010 – 2019
- 2013
- [j12]Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Thread-based multi-engine model checking for multicore platforms. ACM Trans. Design Autom. Electr. Syst. 18(3): 36:1-36:28 (2013) - 2011
- [j11]Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Benchmarking a model checker for algorithmic improvements and tuning for performance. Formal Methods Syst. Des. 39(2): 205-227 (2011) - [c13]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Interpolation sequences revisited. DATE 2011: 316-322 - [c12]Gianpiero Cabodi, Sergio Nocco:
Optimized model checking of multiple properties. DATE 2011: 543-546 - 2010
- [j10]Gianpiero Cabodi, Leandro Dipietro, Marco Murciano, Sergio Nocco:
Finding Multiple Equivalence-Preserving Transformations in Combinational Circuits through Incremental-SAT. J. Electron. Test. 26(2): 261-278 (2010) - [j9]Gianpiero Cabodi, Luz Amanda Garcia, Marco Murciano, Sergio Nocco, Stefano Quer
Partitioning Interpolant-Based Verification for Effective Unbounded Model Checking. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 29(3): 382-395 (2010) - [j8]Sergio Nocco, Stefano Quer
A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 29(12): 2027-2040 (2010)
2000 – 2009
- 2009
- [j7]Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Strengthening Model Checking Techniques With Inductive Invariants. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(1): 154-158 (2009) - [c11]Gianpiero Cabodi, Paolo Camurati, Luz Amanda Garcia, Marco Murciano, Sergio Nocco, Stefano Quer
Speeding up model checking by exploiting explicit and hidden verification constraints. DATE 2009: 1686-1691 - [c10]Gianpiero Cabodi, Leandro Dipietro, Marco Murciano, Sergio Nocco:
Exploiting incrementality in SAT-based search for multiple equivalence-preserving transformations in combinational circuits. HLDVT 2009: 46-53 - 2008
- [j6]Viviana Bruno, Luz Amanda Garcia, Sergio Nocco, Stefano Quer:
Stressing Symbolic Scheduling Techniques within Aircraft Maintenance Optimization. J. Satisf. Boolean Model. Comput. 5(1-4): 83-110 (2008) - [j5]Sergio Nocco, Stefano Quer:
A Probabilistic and Approximated Approach to Circuit-Based Formal Verification. J. Satisf. Boolean Model. Comput. 5(1-4): 111-132 (2008) - [j4]Gianpiero Cabodi, Marco Murciano, Sergio Nocco, Stefano Quer
Boosting interpolation with dynamic localized abstraction and redundancy removal. ACM Trans. Design Autom. Electr. Syst. 13(1): 3:1-3:20 (2008) - [c9]Gianpiero Cabodi, Paolo Camurati, Luz Amanda Garcia, Marco Murciano, Sergio Nocco, Stefano Quer
Trading-Off SAT Search and Variable Quantifications for Effective Unbounded Model Checking. FMCAD 2008: 1-8 - 2007
- [c8]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Boosting the role of inductive invariants in model checking. DATE 2007: 1319-1324 - 2006
- [c7]Gianpiero Cabodi, Marco Murciano, Sergio Nocco, Stefano Quer
Stepping forward with interpolants in unbounded model checking. ICCAD 2006: 772-778 - 2005
- [b1]Sergio Nocco:
Symbolic reachability analysis techniques within the fields of formal verification and automated scheduling. Polytechnic University of Turin, Italy, 2005 - [j3]Gianpiero Cabodi, Alex Kondratyev, Luciano Lavagno, Sergio Nocco, Stefano Quer
A BMC-based formulation for the scheduling problem of hardware systems. Int. J. Softw. Tools Technol. Transf. 7(2): 102-117 (2005) - [j2]Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Are BDDs still alive within sequential verification? Int. J. Softw. Tools Technol. Transf. 7(2): 129-142 (2005) - [c6]Gianpiero Cabodi, Marco Crivellari, Sergio Nocco, Stefano Quer
Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking. DATE 2005: 688-689 - 2004
- [j1]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Improving SAT-based Bounded Model Checking by Means of BDD-based Approximate Traversals. J. Univers. Comput. Sci. 10(12): 1696-1730 (2004) - [c5]Gabriel P. Bischoff, Karl S. Brace, Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking. BMC@CAV 2004: 33-49 - 2003
- [c4]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals. DATE 2003: 10898-10905 - [c3]Gianpiero Cabodi, Sergio Nocco, Stefano Quer
A BMC-formulation for the scheduling problem in highly constrained hardware Systems. BMC@CAV 2003: 623-638 - 2002
- [c2]Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification. CAV 2002: 471-484 - [c1]Luciano Lavagno, Mihai T. Lazarescu
A Symbolic Approach for the Combined Solution of Scheduling and Allocation. ISSS 2002: 237-242
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-10-07 21:23 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: