Auxiliary variables for extending symbolic traversal techniques to data paths

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Auxiliary variables for extending symbolic traversal techniques to data paths

Full text

Pdf (859 KB)

Source

Annual ACM IEEE Design Automation Conference archive
Proceedings of the 31st annual Design Automation Conference table of contents

San Diego, California, United States

Pages: 289 - 293

Year of Publication: 1994

ISBN:0-89791-653-0

Authors

Gianpiero Cabodi	Politecnico di Torino, Dipartimento di Automatica e Informatica, Turin, Italy
Paolo Camurati	Politecnico di Torino, Dipartimento di Automatica e Informatica, Turin, Italy
Stefano Quer	Politecnico di Torino, Dipartimento di Automatica e Informatica, Turin, Italy

Sponsors

IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/196244.196380 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Zvi Kohavi , Richard W. Hamming , Edward A. Feigenbaum, Switching and Finite Automata Theory: Computer Science Series, McGraw-Hill Higher Education, 1990
	2	Olivier Coudert , Christian Berthet , Jean Christophe Madre, Verification of Synchronous Sequential Machines Based on Symbolic Execution, Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, p.365-373, June 12-14, 1989
	3	J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, L.J. Hwang: "Symbolic Model Checking: 102o States and Beyond," LICS'90, pp. 428-439
	4	H. Touati, H. Savoj, B. Lin, R.K. Brayton, A. Sangiovanni- Vincentelli: "Implicit Enumeration of Finite State Machines Using BDDs," ICCAD'90, pp. 130-133
	5	G. Cabodi, P. Camurati: "Exploiting cofactoring for emcient FSM symbolic traversal based on the Transition Relation," ICCD'93, pp. 299-303
	6	G. Cabodi, P. Camurati, S. Quer: "Boolean Function Decomposition in Symbolic FSM Traversal," ICVC'93, pp. 265-268
	7	G. Cabodi, P. Camurati, S. Quer: "Symbolic Traversals of Data Paths with Auxiliary Variables," GLS-VLSI'94, pp. XX-XX
	8	Jerry R. Burch, Using BDDs to verify multipliers, Proceedings of the 28th conference on ACM/IEEE design automation, p.408-412, June 17-22, 1991, San Francisco, California, United States [doi>10.1145/127601.127703]
	9	Randal E. Bryant, On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication, IEEE Transactions on Computers, v.40 n.2, p.205-213, February 1991 [doi>10.1109/12.73590]
	10	J. Jain, M. Abadir, J. Bitner, D.S. Fussell, J.A. Abraham: "IB- DDs: an efficient functional representation for digital circuits," EDAC'92, pp. 4,t0-4'16
	11	S.W.Jeong, B.Plessier, G.Hachtel, F.Somenzi: "Variable ordering and selectiox~ for FSM traversal," ICCAD'91, pp. 476-,179
	12	S. Yang: "Logic Sylltllesis and Optimization Benchmarks User Guide Version :t.0," MCNC Repo'rt, 1991

CITED BY 2

	Gianpiero Cabodi , Paolo Camurati , Stefano Quer, Auxiliary variables for BDD-based representation and manipulation of Boolean functions, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.3 n.3, p.309-340, July 1998
	Amit Narayan , Adrian J. Isles , Jawahar Jain , Robert K. Brayton , Alberto L. Sangiovanni-Vincentelli, Reachability analysis using partitioned-ROBDDs, Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, p.388-393, November 09-13, 1997, San Jose, California, United States