Design of experiments and evaluation of BDD ordering heuristics

International Journal on Software Tools for Technology Transfer

Volumn 3, Issue 2, 2001, Pages 193-206

  Harlow III, Justin E ^a   Brglez, Franc ^b  

^a Duke University   (United States)

^b North Carolina State University   (United States)

Author keywords

BDD; Benchmarking; Design of experiments

Indexed keywords

BDD; BENCHMARK CIRCUIT; SHOW THROUGH; TRADITIONAL APPROACHES; VARIABLE ORDER;

ALGORITHMS; DESIGN OF EXPERIMENTS;

BENCHMARKING;

EID: 84896693374     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090100052     Document Type: Article

References (41)

1. Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proc. Int. Conf. on Computer Aided Design, pp. 42-47, November 1993
2. Mercer, M.R., Kapur, R., Ross, D.E.: Functional approaches to generating orderings for efficient symbolic representations. In: Proc. 29th ACM/IEEE Design Automation Conference, pp. 624-627, June 1992
3. Panda, S., Somenzi, F., Plessier, B.F.: Symmetry detection and dynamic variable ordering of decision diagrams. In: Proc. Int. Conf. on Computer Aided Design, pp. 628-631, November 1994
4. Drechsler, R., Sieling, D.: Binary decision diagrams in theory and practice. In: Int J STTT 3(2): 112-136, 2001
5. Brglez, F., Fujiwara, H.: Special session on ATPG (Also introducing 'ANeutral Netlist of 10 Combinational Benchmark Circuits'). In: Int. Symp. on Circuits and Systems, 1985. Now a benchmark directory ISCAS85 at http://www.cbl.ncsu.edu/benchmarks/
6. Brglez, F., Bryan, D., Kozminski, K.: Combinational profiles of sequential benchmark circuits. In: IEEE 1989 Int. Symp. on Circuits and Systems ISCAS89, pp. 1924-1934, May 1989. Abasis for a benchmark directory ISCAS89, now archived at http://www.cbl.ncsu.edu/benchmarks/
7. Yang, S.: Logic synthesis and optimization benchmarks user guide. Technical Report 1991-IWLS-UG-Saeyang, MCNC, Research Triangle Park, N.C., USA, January 1991. This report is now available from http://www.cbl.ncsu.edu/publications/#1991-IWLS-UG-Saeyang, and benchmark directories archived at http://www.cbl.ncsu.edu/benchmarks/
8. Fisher, R.A.: Statistical methods, experimental design, and scientific inference. Oxford University, 1993. Reprinted, with corrections, from earlier versions, 1925-1973
9. Sentovich, E.M.: Abrief study of BDD package performance. In: Proc. FMCAD'96. LNCS 1166. Berlin, Heidelberg, New York: Springer-Verlag, 1996, pp. 389-403
10. Ghosh, D., Kapur, N., Harlow III J.E., Brglez, F.: Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking. In: Proc. Design Automation and Test in Europe, pp. 656-663, February 1998. Also available at http://www.cbl.ncsu.edu/publications/#1998-DATE-Ghosh
11. Kapur, N., Ghosh, D., Brglez, F.: Towards a new benchmarking paradigm in EDA: analysis of equivalence class mutant circuit distributions. In: ACM Int. Symp. on Physical Design, April 1997
12. Brglez, F.: Design of experiments to evaluate CAD algorithms: which improvements are due to improved heuristic and which are merely due to chance? Technical Report 1998-TR@CBL-04-Brglez, CBL, CS Dept., NCSU, Box 7550, Raleigh, NC 27695, USA, April 1998. Also available at http://www.cbl.ncsu.edu/publications/#1998-TR@CBL-04-Brglez
13. Harlow, J.E., Brglez, F.: Design of experiments in BDD variable ordering: lessons learned. In: Proc. Int. Conf. on Computer Aided Design. ACM, November 1998. Also available from http://www.cbl.ncsu.edu/publications/#1998-ICCAD-Harlow
14. Ghosh, D.: Generation of tightly controlled equivalence classes for experimental design of heuristics for graph-based NP-hard problems. PhD thesis, Electrical and Computer Engineering, North Carolina State University, Raleigh, N.C., USA, May 2000. Also available at http://www.cbl.ncsu.edu/publications/#2000-Thesis-PhD-Ghosh
15. Harlow, J.E., Brglez, F.: Design of experiments for evaluation of bdd packages using controlled circuit mutations In: Proc. Int. Conf. on Formal Methods in ComputerAided Design (FMCAD'98). LNCS 1522. Berlin, Heidelberg, New York: Springer-Verlag, 1998. Also available from http://www.cbl.ncsu.edu/publications/#1998-FMCAD-Harlow
16. The VIS Group.: VIS: Asystem for verification and synthesis. In: Alur, R., Henzinger, T. (eds): Proc. 8th Int. Conf. on Computer Aided Verification. LNCS 1102. Berlin, Heidelberg, New York: Springer-Verlag, 1996, pp. 428-432. Version 1.3 is available from UC Berkeley Design Technology Warehouse at http://www-cad.eecs.berkeley.edu
17. Somenzi, F., et al.: Colorado University Decision Diagram package (CUDD), release 2.3.0, 1998. Software available from http://vlsi.colorado.edu/pub/cudd-2.3.0.tar.gz
18. Hansen, M., Yalcin, H., Hayes, J.P.: Unveiling the iscas85 benchmarks: a case study in reverse engineering. IEEE Design Test Comput 16(3): 72-80, 1999. Also see http://www.eecs.umich.edu/~jhayes/iscas/benchmark.html
19. Calhoun, J., Brglez, F.: Aframework and method for hierarchical test generation. IEEE Trans Computer-Aided Design 11(1): 45-67, 1992
20. Box, G.E.P., Hunter, W.G., Hunter, J.S.: Statistics for experimenters: an introduction to design, data analysis, and model building. Wiley, New York, 1978
21. Brownlee, K.A.: Statistical theory and methodology in: science and engineering. Krieger, 1984. Reprinted, with revisons, from second edition, 1965
22. Hsu, J.C.: Multiple comparisons: theory and methods. Chapman and Hall, London, 1996
23. Shiple, T.R.: Private communication, 1998
24. Ghosh, D., Brglez, F.: Equivalence classes of circuit mutants for experimental design. In: Pro. Int. Symp. Circuits and Systems (ISCAS), May-June 1999. Also available at http://www.cbl.ncsu.edu/publications/#1999-ISCAS-Ghosh
25. Long, D.E.: CMU BDD package, 1993. Available from http://emc.cmu.edu/pub/bdd/bddlib.tar.Z
26. Harlow, J.E.: Overview of popular benchmark sets. IEEE Design Test Comput July-September 17(3): 15-17, 2000
27. Harlow, J.E., Brglez, F.: Mirror, mirror, on the wall is the new release any different at all? In: Proc. Int. Symp. Circuits and Systems (ISCAS), May-June 1999. Also available at http://www.cbl.ncsu.edu/publications/#1999-ISCAS-Harlow
28. Brglez, F., Harlow, J.: On classification of Boolean functions and experimental design. Technical Report 2000TR@CBL-06-Brglez, CBL, CS Dept., NCSU, Box 8206, Raleigh, NC 27695, USA, November 2000. Available at http://www.cbl.ncsu.edu/publications/#2000-TR-06-Brglez
29. Golomb, S.W.: Shift register sequences. Ageon Park, 1982
30. Wegener, I.: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions. Inf Control 62: 129-143, 1984
31. Möller, D., Mohnke, J., Weber, M.: Detection of symmetry of Boolean functions represented by ROBDDs. In: Proc. Int. Conference on Computer-Aided Design, pp. 680-684. ACM, November 1993
32. Snelting, G.: Paul Feyerabend and software technology. Software Tools Technol Transfer 2: 1-5, 1998
33. Shannon, C.E.: Amathematical theory of communication. Bell Syst Tech J 27: 379-423+623-656, 1948
34. Hellerman, L.: Ameasure of computational work. IEEE Trans Comput C-21: 439-446, 1972
35. Cook, R.W., Flynn, M.J.: Logical network cost and entropy. IEEE Trans Comput C-22: 823-826, 1973
36. Cheng, K.T., Agrawal, V.D.: An entropy measure for the complexity of multi-output Boolean functions. In: Proc. 27th ACMIEEE Design Automation Conference, pp. 302-305, 1990
37. Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell Syst Tech J 28: 59-98, 1949
38. Slepian, D.: On the number of symmetry types of Boolean functions of n variables. Can J Math 5(2): 565-715, 1952
39. Golomb, S.W.: On the classification of Boolean functions. IRE Trans Inf Theor IT-5: 176-186, 1959
40. Harrison, M.A.: Counting theorems and their application to classification of switching functions. In: Mukhopadhyay, A. (ed): Recent developments in switching theory, pp. 86-121. Academic, New York, 1971
41. Lechner, R.J.: Harmonic analysis of switching functions. In: Mukhopadhyay, A. (ed): Recent developments in switching theory, pp. 122-229. Academic, New York, 1971