BibSLEIGH — Stefano

Travelled to:

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

Collaborated with:

G.Cabodi P.Camurati S.Nocco L.Lavagno P.Pasini D.Vendraminetto F.Somenzi V.Bertacco M.Damiani M.Crivellari C.Passerone L.Garcia M.Murciano C.Loiacono M.Palena D.Patti S.Ricossa J.Baumgartner

Talks about:

base (9) symbol (7) travers (5) model (5) check (5) verif (4) circuit (3) comput (3) mean (3) sat (3)

Person: Stefano Quer

DBLP: Quer:Stefano

Contributed to:

2014

2013

2011

2009

2007

2005

2003

2002

2001

2000

1999

1997

1994

Wrote 18 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-LoiaconoPPPQRVB #estimation #multi #performance #problem: Fast cone-of-influence computation and estimation in problems with multiple properties (CL, MP, PP, DP, SQ, SR, DV, JB), pp. 803–806.
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.
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.
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-BertaccoDQ #simulation: Cycle-Based Symbolic Simulation of Gate-Level Synchronous Circuits (VB, MD, SQ), pp. 391–396.
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.