The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Gianpiero Cabodi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gianpiero Cabodi
    Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:118-130 [Conf]
  2. 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]
  3. Gianpiero Cabodi, Paolo Camurati
    Advancements in Symbolic Traversal Technique. [Citation Graph (0, 0)][DBLP]
    CHARME, 1993, pp:155-166 [Conf]
  4. Gianpiero Cabodi, Paolo Camurati, Antonio Lioy, Massimo Poncino, Stefano Quer
    A parallel approach to symbolic traversal based on set partitioning. [Citation Graph (0, 0)][DBLP]
    CHARME, 1997, pp:167-184 [Conf]
  5. Gianpiero Cabodi, Stefano Quer, Paolo Camurati
    Transforming boolean relations by symbolic encoding. [Citation Graph (0, 0)][DBLP]
    CHARME, 1995, pp:161-170 [Conf]
  6. Gianpiero Cabodi, Paolo Camurati, Fulvio Corno, Silvano Gai, Paolo Prinetto, Matteo Sonza Reorda
    A New Model for Improving symbolic Product Machine Traversal. [Citation Graph (0, 0)][DBLP]
    DAC, 1992, pp:614-619 [Conf]
  7. Gianpiero Cabodi, Paolo Camurati, Luciano Lavagno, Stefano Quer
    Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits. [Citation Graph (0, 0)][DBLP]
    DAC, 1997, pp:728-733 [Conf]
  8. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Can BDDs compete with SAT solvers on bounded model checking? [Citation Graph (0, 0)][DBLP]
    DAC, 2002, pp:117-122 [Conf]
  9. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Auxiliary Variables for Extending Symbolic Traversal Techniques to Data Paths. [Citation Graph (0, 0)][DBLP]
    DAC, 1994, pp:289-293 [Conf]
  10. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Improving Symbolic Traversals by Means of Activity Profiles. [Citation Graph (0, 0)][DBLP]
    DAC, 1999, pp:306-311 [Conf]
  11. Gianpiero Cabodi, Stefano Quer, Fabio Somenzi
    Optimizing sequential verification by retiming transformations. [Citation Graph (0, 0)][DBLP]
    DAC, 2000, pp:601-606 [Conf]
  12. 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]
  13. Gianpiero Cabodi, Paolo Camurati, Claudio Passerone, Stefano Quer
    Computing Timed Transition Relations for Sequential Cycle-Based Simulation. [Citation Graph (0, 0)][DBLP]
    DATE, 1999, pp:8-12 [Conf]
  14. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Biasing symbolic search by means of dynamic activity profiles. [Citation Graph (0, 0)][DBLP]
    DATE, 2001, pp:9-15 [Conf]
  15. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Dynamic Scheduling and Clustering in Symbolic Image Computation. [Citation Graph (0, 0)][DBLP]
    DATE, 2002, pp:150-157 [Conf]
  16. 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]
  17. Gianpiero Cabodi, Paolo Camurati, Paolo Prinetto
    Experiences in Prolog-Based DFT Rule Checking. [Citation Graph (0, 0)][DBLP]
    FJCC, 1986, pp:909-914 [Conf]
  18. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Improved reachability analysis of large finite state machines. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1996, pp:354-360 [Conf]
  19. 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]
  20. Gianpiero Cabodi, Paolo Camurati
    Exploiting Cofactoring for Efficient FSM Symbolic Traversal Based on the Transition Relation. [Citation Graph (0, 0)][DBLP]
    ICCD, 1993, pp:299-303 [Conf]
  21. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Efficient State Space Pruning in Symbolic Backward Traversal. [Citation Graph (0, 0)][DBLP]
    ICCD, 1994, pp:230-235 [Conf]
  22. Gianpiero Cabodi, Silvano Gai, Matteo Sonza Reorda
    Fast Differential Fault Simulation by Dynamic Fault Ordering. [Citation Graph (0, 0)][DBLP]
    ICCD, 1991, pp:60-63 [Conf]
  23. Gianpiero Cabodi, Luciano Lavagno, Enrico Macii, Massimo Poncino, Stefano Quer, Paolo Camurati, Ellen Sentovich
    Enhancing FSM Traversal by Temporary Re-Encoding. [Citation Graph (0, 0)][DBLP]
    ICCD, 1996, pp:6-11 [Conf]
  24. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Detecting hard faults with combined approximate forward/backward symbolic techniques. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1994, pp:299-302 [Conf]
  25. 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]
  26. Gianpiero Cabodi, Paolo Camurati, Fulvio Corno, Paolo Prinetto, Matteo Sonza Reorda
    Sequential Circuit Diagnosis Based on Formal Verification Techniques. [Citation Graph (0, 0)][DBLP]
    ITC, 1992, pp:187-196 [Conf]
  27. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Full-Symbolic ATPG for Large Circuits. [Citation Graph (0, 0)][DBLP]
    ITC, 1994, pp:980-988 [Conf]
  28. 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]
  29. 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]
  30. Gianpiero Cabodi, Paolo Camurati, Fulvio Corno, Paolo Prinetto, Matteo Sonza Reorda
    The General Product Machine: a New Model for Symbolic FSM Traversal. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1998, v:12, n:3, pp:267-289 [Journal]
  31. Stefano Quer, Gianpiero Cabodi, Paolo Camurati, Luciano Lavagno, Ellen Sentovich, Robert K. Brayton
    Verification of Similar FSMs by Mixing Incremental Re-encoding, Reachability Analysis, and Combinational Checks. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2000, v:17, n:2, pp:107-134 [Journal]
  32. 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]
  33. G. P. Balboni, Gianpiero Cabodi, Silvano Gai, Matteo Sonza Reorda
    A Parallel System for Test Pattern Generation. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1993, v:19, n:2, pp:177-185 [Journal]
  34. Gianpiero Cabodi, Paolo Camurati, Paolo Prinetto, Matteo Sonza Reorda
    TPDL: Extended Temporal Profile Description Language. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1991, v:21, n:4, pp:355-374 [Journal]
  35. Gianpiero Cabodi, Stefano Quer, Paolo Camurati
    Memory Optimization in Function and Set Manipulation with BDDs. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1998, v:28, n:1, pp:99-120 [Journal]
  36. 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]
  37. 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]
  38. Gianpiero Cabodi, Paolo Camurati
    Symbolic FSM traversals based on the transition relation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1997, v:16, n:5, pp:448-457 [Journal]
  39. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Improving symbolic reachability analysis by means of activityprofiles. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2000, v:19, n:9, pp:1065-1075 [Journal]
  40. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Improving the efficiency of BDD-based operators by means of partitioning. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1999, v:18, n:5, pp:545-556 [Journal]
  41. Gianpiero Cabodi, Paolo Camurati, Stefano Quer
    Auxiliary variables for BDD-based representation and manipulation of Boolean functions. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 1998, v:3, n:3, pp:309-340 [Journal]
  42. 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]
  43. Gabriel P. Bischoff, Karl S. Brace, Gianpiero Cabodi
    A Compositional Approach for Equivalence Checking of Sequential Circuits with Unknown Reset State and Overlapping Partitions. [Citation Graph (0, 0)][DBLP]
    EUROCAST, 2007, pp:505-514 [Conf]
  44. Gianpiero Cabodi, Marco Murciano
    BDD-Based Hardware Verification. [Citation Graph (0, 0)][DBLP]
    SFM, 2006, pp:78-107 [Conf]

  45. Verification and synthesis of counters based on symbolic techniques. [Citation Graph (, )][DBLP]


  46. Speeding up model checking by exploiting explicit and hidden verification constraints. [Citation Graph (, )][DBLP]


  47. Computing subsets of equivalence classes for large FSMs. [Citation Graph (, )][DBLP]


  48. Symbolic exploration of large circuits with enhanced forward/backward traversals. [Citation Graph (, )][DBLP]


  49. Trading-Off SAT Search and Variable Quantifications for Effective Unbounded Model Checking. [Citation Graph (, )][DBLP]


  50. Automated abstraction by incremental refinement in interpolant-based model checking. [Citation Graph (, )][DBLP]


  51. A parallel system for test pattern generation. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002