Verifying imprecisely working arithmetic circuits

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Verifying imprecisely working arithmetic circuits

Full text

Pdf (115 KB)

Source

Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe table of contents

Munich, Germany

Article No. 13

Year of Publication: 1999

ISBN:1-58113-121-6

Authors

M. Huhn	Institut für Rechnerentwurf und Fehlertoleranz, Universität Karlsruhe, Karlsruhe, Germany
K. Schneider	Institut für Rechnerentwurf und Fehlertoleranz, Universität Karlsruhe, Karlsruhe, Germany
Th. Kropf	Institut für Rechnerentwurf und Fehlertoleranz, Universität Karlsruhe, Karlsruhe, Germany
G. Logothetis	Institut für Rechnerentwurf und Fehlertoleranz, Universität Karlsruhe, Karlsruhe, Germany

Sponsor

SIGDA: ACM Special Interest Group on Design Automation

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/307418.307451 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	Randal E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, v.35 n.8, p.677-691, August 1986 [doi>10.1109/TC.1986.1676819]
	2	Randal E. Bryant , Yirng-An Chen, Verification of arithmetic circuits with binary moment diagrams, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.535-541, June 12-16, 1995, San Francisco, California, United States [doi>10.1145/217474.217583]
	3	[3] B. Char, K. Geddes, G. Gonnet, B. Leong, M. Monagan, and S. Watt. Maple V Language Reference Manual. 1992.
	4	Edmund M. Clarke , E. Allen Emerson, Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic, Logic of Programs, Workshop, p.52-71, May 01, 1981
	5	Edmund M. Clarke , Orna Grumberg , David E. Long, Model checking and abstraction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.5, p.1512-1542, Sept. 1994 [doi>10.1145/186025.186051]
	6	Deepak Kapur , Hantao Zhang, RRL: A Rewrite Rule Laboratory, Proceedings of the 9th International Conference on Automated Deduction, p.768-769, May 23-26, 1988
	7	[7] C. Loeffler, A. Ligtenberg, and G. Moschytz. Practical fast 1-D DCT algorithms with 11 multiplications. In International Conference on Acoustics, Speech, and Signal Processing 1989 (ICASSP '89), pages 988-99, 1989.
	8	Kenneth L. McMillan, Symbolic Model Checking, Kluwer Academic Publishers, Norwell, MA, 1993
	9	William B. Pennebaker , Joan L. Mitchell, JPEG Still Image Data Compression Standard, Kluwer Academic Publishers, Norwell, MA, 1992
	10	Klaus Schneider , Michaela Huhn, Comparing model checking and term rewriting for the verification of an embedded system, Proceedings of the IFIP WG10.3/WG10.5 international workshop on Distributed and parallel embedded systems, p.129-138, October 1998, Scholoß Eringerfeld, Germany
	11	Stephen Wolfram, Mathematica: a system for doing mathematics by computer (2nd ed.), Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1991

CITED BY 2

	Katarzyna Radecka , Zeljko Zilic, Specifying and verifying imprecise sequential datapaths by Arithmetic Transforms, Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design, p.128-131, November 10-14, 2002, San Jose, California
	Abu Nasser Mohammed Abdullah , Behzad Akbarpour , Sofiène Tahar, Error Analysis and Verification of an IEEE 802.11 OFDM Modem using Theorem Proving, Electronic Notes in Theoretical Computer Science (ENTCS), v.242 n.2, p.3-30, July, 2009