BibSLEIGH — Gianpiero

Travelled to:

1 × Denmark
1 × Italy
5 × Germany
6 × USA
7 × France

Collaborated with:

S.Quer P.Camurati S.Nocco M.Murciano D.Vendraminetto ∅ L.Lavagno S.Gai M.S.Reorda C.Loiacono F.Somenzi P.Pasini M.Crivellari C.Passerone M.Rebaudengo L.Garcia F.Corno P.Prinetto

Talks about:

base (9) symbol (8) model (8) check (7) travers (6) verif (5) bdd (5) techniqu (3) improv (3) optim (3)

Person: Gianpiero Cabodi

DBLP: Cabodi:Gianpiero

Contributed to:

2014

2013

2011

2009

2007

2006

2005

2003

2002

2001

2000

1999

1997

1994

1992

Wrote 22 papers:

DATE-2014-CabodiPQV #approximate #reachability #satisfiability: Tightening BDD-based approximate reachability with SAT-based clause generalization∗ (GC, PP, SQ, DV), pp. 1–6.
DATE-2013-CabodiLV #bound #model checking #optimisation: Optimization techniques for craig interpolant compaction in unbounded model checking (GC, CL, DV), pp. 1417–1422.
DATE-2011-CabodiN #model checking #multi: Optimized model checking of multiple properties (GC, SN), pp. 543–546.
DATE-2011-CabodiNQ #revisited #sequence: Interpolation sequences revisited (GC, SN, SQ), pp. 316–322.
DATE-2009-CabodiCGMNQ #constraints #model checking #verification: Speeding up model checking by exploiting explicit and hidden verification constraints (GC, PC, LG, MM, SN, SQ), pp. 1686–1691.
DATE-2007-CabodiNQ #induction #invariant #model checking: Boosting the role of inductive invariants in model checking (GC, SN, SQ), pp. 1319–1324.
SFM-2006-CabodiM #hardware #verification: BDD-Based Hardware Verification (GC, MM), pp. 78–107.
DATE-2005-CabodiCNQ #bound #model checking #quantifier #set: Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking (GC, MC, SN, SQ), pp. 688–689.
DATE-2003-CabodiNQ #approximate #bound #model checking #satisfiability #traversal: Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals (GC, SN, SQ), pp. 10898–10905.
CAV-2002-CabodiNQ #traversal #verification: Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification (GC, SN, SQ), pp. 471–484.
DAC-2002-CabodiCQ #bound #model checking #question #satisfiability: Can BDDs compete with SAT solvers on bounded model checking? (GC, PC, SQ), pp. 117–122.
DATE-2002-CabodiCQ #clustering #image #scheduling: Dynamic Scheduling and Clustering in Symbolic Image Computation (GC, PC, SQ), pp. 150–156.
CAV-2001-Cabodi #named #representation: Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions (GC), pp. 118–130.
DATE-2001-CabodiCQ #process: Biasing symbolic search by means of dynamic activity profiles (GC, PC, SQ), pp. 9–15.
DAC-2000-CabodiQS #optimisation #verification: Optimizing sequential verification by retiming transformations (GC, SQ, FS), pp. 601–606.
DAC-1999-CabodiCQ #process #traversal: Improving Symbolic Traversals by Means of Activity Profiles (GC, PC, SQ), pp. 306–311.
DATE-1999-CabodiCPQ #simulation: Computing Timed Transition Relations for Sequential Cycle-Based Simulation (GC, PC, CP, SQ), pp. 8–12.
DAC-1997-CabodiCLQ #approach #clustering #effectiveness #scalability #traversal: Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits (GC, PC, LL, SQ), pp. 728–733.
EDTC-1997-CabodiCLQ #synthesis #verification: Verification and synthesis of counters based on symbolic techniques (GC, PC, LL, SQ), pp. 176–181.
DAC-1994-CabodiCQ #traversal: Auxiliary Variables for Extending Symbolic Traversal Techniques to Data Paths (GC, PC, SQ), pp. 289–293.
PDP-1994-CabodiGRR #architecture #parallel: A BDD Package For A Massively Parallel SIMD Architecture (GC, SG, MR, MSR), pp. 212–219.
DAC-1992-CabodiCCGPR #traversal: A New Model for Improving symbolic Product Machine Traversal (GC, PC, FC, SG, PP, MSR), pp. 614–619.