论文信息 - Do We Really Need Common Variable Orders for Synthesizing OBDDs?

Do We Really Need Common Variable Orders for Synthesizing OBDDs?

Electronic copies of technical reports are available: Via FTP: Host ftp.informatik.uni-trier.de, directory /pub/reports Via gopher: Host gopher.informatik.uni-trier.de, port 70, type 1, pathes 1/TechReports/Abstracts and 1/TechReports/FullText Via WWW: URL http://www.informatik.uni-trier.de/Reports/List Via email: Send a mail to ftpmail@ftp.informatik.uni-trier.de, subject ’MAIL ME CLEAR’, body ’TechReports.HowTo’ followed by an empty line, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..

Christoph Meinel | Christian Stangier | Harald Sack | Arno Wagner

[1] R. Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[2] Shuzo Yajima,et al. The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams , 1993, ISAAC.

[3] Robert K. Brayton,et al. Logic Verification Using BDDs in a Logic Synthesis Environ-ment , 1988 .

[4] Erik Meineche Schmidt,et al. The Complexity of Equivalence and Containment for Free Single Variable Program Schemes , 1978, ICALP.

[5] R. Brayton,et al. Reachability analysis using partitioned-ROBDDs , 1997, ICCAD 1997.

[6] Jean Christophe Madre,et al. Proving circuit correctness using formal comparison between expected and extracted behaviour , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[7] Beate Bollig,et al. Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[8] Alberto L. Sangiovanni-Vincentelli,et al. Partitioned ROBDDs-a compact, canonical and efficiently manipulable representation for Boolean functions , 1996, Proceedings of International Conference on Computer Aided Design.