The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for bdds with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1990-1994 (30) 1995 (16) 1996 (15) 1997 (27) 1998 (27) 1999 (40) 2000 (38) 2001 (42) 2002 (38) 2003 (44) 2004 (45) 2005 (37) 2006 (50) 2007 (30) 2008 (38) 2009 (20) 2010 (17) 2011-2014 (18) 2015-2018 (16) 2019-2022 (18) 2023 (3)
Publication types (Num. hits)
article(109) incollection(2) inproceedings(497) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 535 occurrences of 278 keywords

Results
Found 609 publication records. Showing 609 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
88Wolfgang Günther 0001, Rolf Drechsler Efficient manipulation algorithms for linearly transformed BDDs. Search on Bibsonomy ICCAD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
78Ulrich Kühne, Nicole Drechsler Finding Compact BDDs Using Genetic Programming. Search on Bibsonomy EvoWorkshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
78Marc Berndl, Ondrej Lhoták, Feng Qian, Laurie J. Hendren, Navindra Umanee Points-to analysis using BDDs. Search on Bibsonomy PLDI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF binary decision diagrams, points-to analysis
78Anuchit Anuchitanukul, Zohar Manna, Tomás E. Uribe Differential BDDs. Search on Bibsonomy Computer Science Today The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
78Aarti Gupta, Pranav Ashar Integrating a Boolean Satisfiability Checker and BDDs for Combinational Equivalence Checking. Search on Bibsonomy VLSI Design The full citation details ... 1998 DBLP  DOI  BibTeX  RDF ATPG techniques, circuit similarity, formal verification, combinational circuits, Boolean satisfiability (SAT), combinational equivalence checking, Binary Decision Diagrams (BDDs)
69Rüdiger Ebendt, Rolf Drechsler On the sensitivity of BDDs with respect to path-related objective functions. Search on Bibsonomy ISCAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
69In-Ho Moon, Carl Pixley Non-miter-based Combinational Equivalence Checking by Comparing BDDs with Different Variable Orders. Search on Bibsonomy FMCAD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
68Gianpiero Cabodi, Paolo Camurati, Stefano Quer Can BDDs compete with SAT solvers on bounded model checking? Search on Bibsonomy DAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF model checking, formal verification, SAT, BDDs
59Graham D. Price, Manish Vachharajani Large program trace analysis and compression with ZDDs. Search on Bibsonomy CGO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF parallel programming, trace compression
59Andrei Rimsa, Luis E. Zárate, Mark A. J. Song Handling Large Formal Context Using BDD - Perspectives and Limitations. Search on Bibsonomy ICFCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Formal Concept Analysis, Binary Decision Diagrams, Formal Context, Formal Concept
59Rolf Drechsler, Görschwin Fey, Sebastian Kinder An Integrated Approach for Combining BDD and SAT Provers. Search on Bibsonomy VLSI Design The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
59Rajeev K. Ranjan 0001, Jagesh V. Sanghavi, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli Binary decision diagrams on network of workstation. Search on Bibsonomy ICCD The full citation details ... 1996 DBLP  DOI  BibTeX  RDF memory resources, breadth-first technique, verification, Boolean functions, synthesis, binary decision diagram, network of workstations
59Graham D. Price, Manish Vachharajani A Case for Compressing Traces with BDDs. Search on Bibsonomy IEEE Comput. Archit. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
59Shin-ichi Minato, Hiroki Arimura Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs. Search on Bibsonomy WIRI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
59Jaco Geldenhuys, Antti Valmari Techniques for Smaller Intermediary BDDs. Search on Bibsonomy CONCUR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
59Jer-Sheng Chen, Prithviraj Banerjee Parallel construction algorithms for BDDs. Search on Bibsonomy ISCAS (1) The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
59Reinhard Enders, Thomas Filkorn, Dirk Taubner Generating BDDs for Symbolic Model Checking in CCS. Search on Bibsonomy CAV The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
58Leomar S. da Rosa Jr., Felipe S. Marques 0001, Tiago Muller Gil Cardoso, Renato P. Ribas, Sachin S. Sapatnekar, André Inácio Reis Fast disjoint transistor networks from BDDs. Search on Bibsonomy SBCCI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF PTL, unateness, BDDs, switch theory, CMOS gates
58Edmund M. Clarke, Somesh Jha, Yuan Lu 0004, Dong Wang Abstract BDDs: A Technique for Using Abstraction in Model Checking. Search on Bibsonomy CHARME The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Abstract BDDs, Model checking and abstraction
58Silvano Gai, Maurizio Rebaudengo, Matteo Sonza Reorda An improved data parallel algorithm for Boolean function manipulation using BDDs. Search on Bibsonomy PDP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Boolean function manipulation, parallel algorithms, parallel algorithm, Boolean functions, Binary Decision Diagrams, BDDs, SIMD architectures, CPU time, data parallel algorithm
58Jawahar Jain, James R. Bitner, Magdy S. Abadir, Jacob A. Abraham, Donald S. Fussell Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1997 DBLP  DOI  BibTeX  RDF free BDDs, IBDDs, verification, Boolean functions, satisfiability, BDDs, graph representations, OBDDs, canonical representations
57Ingo Wegener Comments on "A Characterization of Binary Decision Diagrams". Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1994 DBLP  DOI  BibTeX  RDF EXOR gates, NEXOR gates, free BDDs, ordered BDDs, repeated BDDs, computational complexity, complexity, Boolean functions, binary decision diagrams, decision tables, combinatorial circuits
49Michael Glaß, Martin Lukasiewycz, Christian Haubelt, Jürgen Teich Towards scalable system-level reliability analysis. Search on Bibsonomy DAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF SAT-assisted simulation, early quantification, reliability analysis
49Ondrej Lhoták, Stephen Curial, José Nelson Amaral Using ZBDDs in Points-to Analysis. Search on Bibsonomy LCPC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
49Frank Reffel BDD-Nodes Can Be More Expressive. Search on Bibsonomy ASIAN The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
49Chia-Pin R. Liu, Jacob A. Abraham Transistor Level Synthesis for Static CMOS Combinational Circuits. Search on Bibsonomy Great Lakes Symposium on VLSI The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
49Nils Klarlund An n log n Algorithm for Online BDD Refinement. Search on Bibsonomy CAV The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
49Taisuke Sato Statistical Learning of Probabilistic BDDs. Search on Bibsonomy SAGA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
49Constantinos Bartzis, Tevfik Bultan Efficient BDDs for bounded arithmetic constraints. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Model checking, BDD, Integer arithmetic, SMV
49Rüdiger Ebendt, Wolfgang Günther 0001, Rolf Drechsler Minimization of the expected path length in BDDs based on local changes. Search on Bibsonomy ASP-DAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
49Constantinos Bartzis, Tevfik Bultan Construction of Efficient BDDs for Bounded Arithmetic Constraints. Search on Bibsonomy TACAS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
49Gianpiero Cabodi Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions. Search on Bibsonomy CAV The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
49Wolfgang Günther 0001, Andreas Hett, Bernd Becker 0001 Application of linearly transformed BDDs in sequential verification. Search on Bibsonomy ASP-DAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
49Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Yunshan Zhu Symbolic Model Checking without BDDs. Search on Bibsonomy TACAS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
49Justin E. Harlow III, Franc Brglez Mirror, mirror, on the wall...is the new release any different at all? [BDDs]. Search on Bibsonomy ISCAS (6) The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
49Srilatha Manne, Dirk Grunwald, Fabio Somenzi Remembrance of Things Past: Locality and Memory in BDDs. Search on Bibsonomy DAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
49Alan J. Hu, David L. Dill Efficient Verification with BDDs using Implicitly Conjoined Invariants. Search on Bibsonomy CAV The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
49Alan J. Hu, David L. Dill, Andreas J. Drexler, C. Han Yang Higher-Level Specification and Verification with BDDs. Search on Bibsonomy CAV The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
49Mats Per Erik Heimdahl, Barbara J. Czerny Using PVS to analyze hierarchical state-based requirements for completeness and consistency. Search on Bibsonomy HASE The full citation details ... 1996 DBLP  DOI  BibTeX  RDF hierarchical state based requirements specifications, input sequence, analysis procedures, large real world requirements specification, hierarchical state based language, Requirements State Machine Language, Prototype Verification System, theorem proving component, spurious error reports, formal specifications, robustness, consistency, program verification, completeness, Binary Decision Diagrams, BDDs, PVS, interactive environment, formal proofs, RSML
49Will Marrero Using BDDs to Decide CTL. Search on Bibsonomy TACAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF validity, satisfiability, BDDs, CTL, tableau
39Ondrej Lhoták, Laurie J. Hendren Relations as an abstraction for BDD-based program analysis. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Boolean formula satisfiability, physical domain assignment, Java, program analysis, Binary decision diagrams, language design, relations, points-to analysis
39Gianpiero Cabodi, Marco Murciano BDD-Based Hardware Verification. Search on Bibsonomy SFM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Viresh Paruthi, Christian Jacobi 0002, Kai Weber 0001 Efficient Symbolic Simulation via Dynamic Scheduling, Don't Caring, and Case Splitting. Search on Bibsonomy CHARME The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
39Jean-Michel Couvreur A BDD-Like Implementation of an Automata Package. Search on Bibsonomy CIAA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
39Ondrej Lhoták, Laurie J. Hendren Jedd: a BDD-based relational extension of Java. Search on Bibsonomy PLDI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF boolean formula satisfiability, Java, program analysis, binary decision diagrams, language design, relations
39Rolf Drechsler, Detlef Sieling Binary decision diagrams in theory and practice. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF data structure, Boolean function, Binary decision diagram, VLSI CAD, Branching program
39Jan Friso Groote, Hans Zantema Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially. Search on Bibsonomy Ershov Memorial Conference The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Youpyo Hong, Peter A. Beerel, Jerry R. Burch, Kenneth L. McMillan Sibling-substitution-based BDD minimization using don't cares. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Aarti Gupta, Zijiang Yang 0006, Pranav Ashar, Anubhav Gupta 0001 SAT-Based Image Computation with Application in Reachability Analysis. Search on Bibsonomy FMCAD The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Per Bjesse, Koen Claessen SAT-Based Verification without State Space Traversal. Search on Bibsonomy FMCAD The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Youpyo Hong, Peter A. Beerel, Jerry R. Burch, Kenneth L. McMillan Safe BDD Minimization Using Don't Cares. Search on Bibsonomy DAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
39Mikko Tiusanen Symbolic, Symmetry, and Stubborn Set Searches. Search on Bibsonomy Application and Theory of Petri Nets The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
39Markus Behle On threshold BDDs and the optimal variable ordering problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Threshold BDD, 0/1 integer programming, Optimal variable ordering, Variable ordering spectrum, Binary decision diagram, Knapsack
39Shin-ichi Minato A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent Itemsets. Search on Bibsonomy Discovery Science The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Markus Behle On Threshold BDDs and the Optimal Variable Ordering Problem. Search on Bibsonomy COCOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Roberto Cavada, Alessandro Cimatti, Anders Franzén, Krishnamani Kalyanasundaram, Marco Roveri, R. K. Shyamasundar Computing Predicate Abstractions by Integrating BDDs and SMT Solvers. Search on Bibsonomy FMCAD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Görschwin Fey, Rolf Drechsler Minimizing the number of paths in BDDs: Theory and algorithm. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Shin-ichi Minato Symmetric Item Set Mining Based on Zero-Suppressed BDDs. Search on Bibsonomy Discovery Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Carsten Sinz, Armin Biere Extended Resolution Proofs for Conjoining BDDs. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Bernd Becker 0001, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer 0001 BDDs in a Branch and Cut Framework. Search on Bibsonomy WEA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
39Renato E. B. Poli, Felipe Ribeiro Schneider, Renato P. Ribas, André Inácio Reis Unified Theory to Build Cell-Level Transistor Networks from BDDs. Search on Bibsonomy SBCCI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
39Robert F. Damiano, James H. Kukula Checking satisfiability of a conjunction of BDDs. Search on Bibsonomy DAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF satisfiability, BDD
39Pascal Fontaine, E. Pascal Gribomont Using BDDs with Combinations of Theories. Search on Bibsonomy LPAR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
39Henrik Brosenne, Matthias Homeister, Stephan Waack Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Wolfgang Günther 0001, Rolf Drechsler Implementation of Read- k-times BDDs on Top of Standard BDD Packages. Search on Bibsonomy VLSI Design The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Martin Sauerhoff An Improved Hierarchy Result for Partitioned BDDs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar Reflecting BDDs in Coq. Search on Bibsonomy ASIAN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Wolfgang Günther 0001, Rolf Drechsler Minimization of Free BDDs. Search on Bibsonomy ASP-DAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
39Jun Yuan 0007, Kurt Shultz, Carl Pixley, Hillel Miller, Adnan Aziz Modeling design constraints and biasing in simulation using BDDs. Search on Bibsonomy ICCAD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
39Jean Goubault, Joachim Posegga BDDs and Automated Deduction. Search on Bibsonomy ISMIS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
39Detlef Sieling, Ingo Wegener A Comparison of Free BDDs and Transformed BDDs. Search on Bibsonomy Formal Methods Syst. Des. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Tomohiro Yoneda, Hideyuki Hatori, Atsushi Takahara, Shin-ichi Minato BDDs vs. Zero-Suppressed BDDs: for CTL Symbolic Model Checking of Petri Nets. Search on Bibsonomy FMCAD The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
39Dirk Beyer 0001 Improvements in BDD-Based Reachability Analysis of Timed Automata. Search on Bibsonomy FME The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Real-time systems, Formal verification, Timed automata, BDDs, Discretization
39Enric Pastor, Jordi Cortadella Efficient Encoding Schemes for Symbolic Analysis of Petri Nets. Search on Bibsonomy DATE The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Petri nets, BDDs, symbolic analysis
39Aarti Gupta, Malay K. Ganai, Chao Wang 0001, Zijiang Yang 0006, Pranav Ashar Learning from BDDs in SAT-based bounded model checking. Search on Bibsonomy DAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF BDD learning, learning, SAT, BDDs, bounded model checking, boolean satisfiability, SAT solvers, property checking
39Malay K. Ganai, Adnan Aziz, Andreas Kuehlmann Enhancing Simulation with BDDs and ATPG. Search on Bibsonomy DAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF simulation, formal verification, coverage, ATPG, BDDs
29Daniel Král Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Free binary decision diagrams, Binary decision diagrams
29Andrei Rimsa, Luis E. Zárate, Mark A. J. Song Evaluation of Different BDD Libraries to Extract Concepts in FCA - Perspectives and Limitations. Search on Bibsonomy ICCS (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Zero-Supressed Binary Decision Diagrams, Formal Concept Analysis, Binary Decision Diagrams, Formal Context, Formal Concept
29Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown Scalable Synthesis and Clustering Techniques Using Decision Diagrams. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Guoqing Xu 0001, Atanas Rountev Merging equivalent contexts for scalable heap-cloning-based context-sensitive points-to analysis. Search on Bibsonomy ISSTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF pointer analysis, context sensitivity, points-to analysis
29Richard Mark Downing Evolving Binary Decision Diagrams with Emergent Variable Orderings. Search on Bibsonomy PPSN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Koen Claessen, Jan-Willem Roorda An Introduction to Symbolic Trajectory Evaluation. Search on Bibsonomy SFM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Toni Jussila, Carsten Sinz, Armin Biere Extended Resolution Proofs for Symbolic SAT Solving with Quantification. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Jaco van de Pol, Olga Tveretina A BDD-Representation for the Logic of Equality and Uninterpreted Functions. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Marta Z. Kwiatkowska, Gethin Norman, David Parker 0001 Probabilistic symbolic model checking with PRISM: a hybrid approach. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Binary decision diagrams, Symbolic model checking, Probabilistic model checking
29HoonSang Jin, Fabio Somenzi CirCUs: A Hybrid Satisfiability Solver. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Jinbo Huang, Adnan Darwiche Toward Good Elimination Orders for Symbolic SAT Solving. Search on Bibsonomy ICTAI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Maitrali Marik, Ajit Pal Energy-aware Logic Synthesis and Technology Mapping for MUX-based FPGAs. Search on Bibsonomy VLSI Design The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Mark G. Karpovsky, Radomir S. Stankovic, Jaakko Astola Reduction of Sizes of Decision Diagrams by Autocorrelation Functions. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Logic synthesis, decision diagrams, linear transforms, autocorrelation functions, spectral techniques
29Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, Malay K. Ganai Robust Boolean reasoning for equivalence checking and functional property verification. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Per Bjesse Industrial Model Checking Based on Satisfiability Solvers. Search on Bibsonomy SPIN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Marta Z. Kwiatkowska, Gethin Norman, David Parker 0001 Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach. Search on Bibsonomy TACAS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Jan Friso Groote, Jaco van de Pol Equational Binary Decision Diagrams. Search on Bibsonomy LPAR The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
29Christoph Meinel, Harald Sack, Arno Wagner WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms. Search on Bibsonomy Experimental Algorithmics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
29Frank Schmiedle, Wolfgang Günther 0001, Rolf Drechsler Dynamic Re-Encoding During MDD Minimization. Search on Bibsonomy ISMVL The full citation details ... 2000 DBLP  DOI  BibTeX  RDF variable grouping, MDD, BDD, sifting
29Frank Reffel, Stefan Edelkamp Error Detection with Directed Symbolic Model Checking. Search on Bibsonomy World Congress on Formal Methods The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
29Marius Bozga, Oded Maler, Stavros Tripakis Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics. Search on Bibsonomy CHARME The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
29Kavita Ravi, Fabio Somenzi Efficient Fixpoint Computation for Invariant Checking. Search on Bibsonomy ICCD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
29Premal Buch, Amit Narayan, A. Richard Newton, Alberto L. Sangiovanni-Vincentelli Logic synthesis for large pass transistor circuits. Search on Bibsonomy ICCAD The full citation details ... 1997 DBLP  DOI  BibTeX  RDF logic synthesis, BDD, Pass transistor logic
29Ramin Hojati, Sriram C. Krishnan, Robert K. Brayton Early Quantification and Partitioned Transition Relations. Search on Bibsonomy ICCD The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 609 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license