38 papers:
IJCAR-2014-GoreOT #calculus #implementation #using- Implementing Tableau Calculi Using BDDs: BDDTab System Description (RG, KO, JT), pp. 337–343.
DATE-2013-StergiouJ #dataset #optimisation- Optimizing BDDs for time-series dataset manipulation (SS, JJ), pp. 1018–1021.
SAT-2011-AbioNOR #constraints #pseudo #revisited- BDDs for Pseudo-Boolean Constraints — Revisited (IA, RN, AO, ERC), pp. 61–75.
- DATE-2010-CimattiFGKR #abstraction #integration #smt
- Tighter integration of BDDs and SMT for Predicate Abstraction (AC, AF, AG, KK, MR), pp. 1707–1712.
ILC-2010-YuasaY #low level #using #validation- Validating low-level instructions for fixnums using BDDs (SY, MY), pp. 11–20.
- ICST-2010-JobstlWAW #consistency #execution #smt #symbolic computation #testing
- When BDDs Fail: Conformance Testing with Symbolic Execution and SMT Solving (EJ, MW, BKA, FW), pp. 479–488.
PADL-2008-Subbarayan #constraints #performance #reasoning #theorem proving- Efficient Reasoning for Nogoods in Constraint Solvers with BDDs (SS), pp. 53–67.
TACAS-2005-Marrero #using- Using BDDs to Decide CTL (WM), pp. 222–236.
- DATE-v1-2004-PadmanabanT #fault #identification #performance #using
- Using BDDs and ZBDDs for Efficient Identification of Testable Path Delay Faults (SP, ST), pp. 50–55.
DAC-2003-DamianoK #satisfiability- Checking satisfiability of a conjunction of BDDs (RFD, JHK), pp. 818–823.
- DAC-2003-GuptaGWYA #bound #learning #model checking #satisfiability
- Learning from BDDs in SAT-based bounded model checking (AG, MKG, CW, ZY, PA), pp. 824–829.
- DATE-2003-ZengZHC #correlation #performance #using
- Fast Computation of Data Correlation Using BDDs (ZZ, QZ, IGH, MJC), pp. 10122–10129.
- TACAS-2003-BartzisB #bound #constraints #performance
- Construction of Efficient BDDs for Bounded Arithmetic Constraints (CB, TB), pp. 394–408.
PLDI-2003-BerndlLQHU #analysis #points-to #using- Points-to analysis using BDDs (MB, OL, FQ, LJH, NU), pp. 103–114.
CAV-2003-GuptaGWYA #abstraction #satisfiability- Abstraction and BDDs Complement SAT-Based BMC in DiVer (AG, MKG, CW, ZY, PA), pp. 206–209.
- 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-AloulMS #satisfiability #search-based #using
- Search-Based SAT Using Zero-Suppressed BDDs (FAA, MNM, KAS), p. 1082.
- TACAS-2001-Finkbeiner #nondeterminism
- Language Containment Checking with Nondeterministic BDDs (BF), pp. 24–38.
- CAV-2001-Cabodi #named #representation
- Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions (GC), pp. 118–130.
- TACAS-2000-BharadwajS #automation #constraints #invariant #named #theorem proving
- Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking (RB, SS), pp. 378–394.
- DAC-1999-BiereCCFZ #model checking #satisfiability #using
- Symbolic Model Checking Using SAT Procedures instead of BDDs (AB, AC, EMC, MF, YZ), pp. 317–320.
- DAC-1999-GanaiAK #simulation
- Enhancing Simulation with BDDs and ATPG (MKG, AA, AK), pp. 385–390.
- TACAS-1999-BiereCCZ #model checking
- Symbolic Model Checking without BDDs (AB, AC, EMC, YZ), pp. 193–207.
- CAV-1999-BiereCRZ #model checking #safety #using
- Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs (AB, EMC, RR, YZ), pp. 60–71.
- DAC-1998-DrechslerDG #performance
- Fast Exact Minimization of BDDs (RD, ND, WG), pp. 200–205.
- DAC-1998-GovindarajuDHH #approximate #reachability #using
- Approximate Reachability with BDDs Using Overlapping Projections (SGG, DLD, AJH, MH), pp. 451–456.
- DAC-1997-ManneGS #locality #memory management
- Remembrance of Things Past: Locality and Memory in BDDs (SM, DG, FS), pp. 196–201.
- EDTC-1997-HettDB #order #performance #synthesis
- Fast and efficient construction of BDDs by reordering based synthesis (AH, RD, BB), pp. 168–175.
LICS-1996-GodefroidL #protocol #queue #verification- Symbolic Protocol Verification With Queue BDDs (PG, DEL), pp. 198–206.
- DAC-1994-HuYD #performance #verification
- New Techniques for Efficient Verification with Implicitly Conjoined BDDs (AJH, GY, DLD), pp. 276–282.
- DAC-1994-Minato #algebra #set #using
- Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs (SiM), pp. 420–424.
- DAC-1994-ShipleHSB #heuristic #using
- Heuristic Minimization of BDDs Using Don’t Cares (TRS, RH, ALSV, RKB), pp. 225–231.
CADE-1994-Goubault #proving- Proving with BDDs and Control of Information (JG), pp. 499–513.
- DAC-1993-Minato #combinator #problem #set
- Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems (SiM), pp. 272–277.
- CAV-1993-HuD #invariant #performance #using #verification
- Efficient Verification with BDDs using Implicitly Conjoined Invariants (AJH, DLD), pp. 3–14.
- CAV-1992-HuDDY #specification #verification
- Higher-Level Specification and Verification with BDDs (AJH, DLD, AJD, CHY), pp. 82–95.
- DAC-1991-Burch #multi #using #verification
- Using BDDs to Verify Multipliers (JRB), pp. 408–412.
- CAV-1991-EndersFT #generative #model checking
- Generating BDDs for Symbolic Model Checking in CCS (RE, TF, DT), pp. 203–213.
