|
Search the dblp DataBase
Sergio Nocco:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification. [Citation Graph (0, 0)][DBLP] CAV, 2002, pp:471-484 [Conf]
- Gianpiero Cabodi, Marco Crivellari, Sergio Nocco, Stefano Quer
Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking. [Citation Graph (0, 0)][DBLP] DATE, 2005, pp:688-689 [Conf]
- Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals. [Citation Graph (0, 0)][DBLP] DATE, 2003, pp:10898-10905 [Conf]
- Gianpiero Cabodi, Marco Murciano, Sergio Nocco, Stefano Quer
Stepping forward with interpolants in unbounded model checking. [Citation Graph (0, 0)][DBLP] ICCAD, 2006, pp:772-778 [Conf]
- Luciano Lavagno, Mihai T. Lazarescu, Stefano Quer, Sergio Nocco, Claudio Passerone, Gianpiero Cabodi
A Symbolic Approach for the Combined Solution of Scheduling and Allocation. [Citation Graph (0, 0)][DBLP] ISSS, 2002, pp:237-242 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:119, n:2, pp:33-49 [Journal]
- Gianpiero Cabodi, Sergio Nocco, Stefano Quer, Alex Kondratyev, Luciano Lavagno, Yosinori Watanabe
A BMC-formulation for the scheduling problem in highly constrained hardware Systems. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2003, v:89, n:4, pp:- [Journal]
- Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Improving SAT-based Bounded Model Checking by Means of BDD-based Approximate Traversals. [Citation Graph (0, 0)][DBLP] J. UCS, 2004, v:10, n:12, pp:1696-1730 [Journal]
- Gianpiero Cabodi, Alex Kondratyev, Luciano Lavagno, Sergio Nocco, Stefano Quer, Yosinori Watanabe
A BMC-based formulation for the scheduling problem of hardware systems. [Citation Graph (0, 0)][DBLP] STTT, 2005, v:7, n:2, pp:102-117 [Journal]
- Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Are BDDs still alive within sequential verification? [Citation Graph (0, 0)][DBLP] STTT, 2005, v:7, n:2, pp:129-142 [Journal]
- Gianpiero Cabodi, Sergio Nocco, Stefano Quer
Boosting the role of inductive invariants in model checking. [Citation Graph (0, 0)][DBLP] DATE, 2007, pp:1319-1324 [Conf]
Speeding up model checking by exploiting explicit and hidden verification constraints. [Citation Graph (, )][DBLP]
Trading-Off SAT Search and Variable Quantifications for Effective Unbounded Model Checking. [Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.007secs
|