Path Verification Using Boolean Satisfiability

D
DATE
1998
Design Automation and Test in Europe (DATE '98)
Abstract - Path Verification Using Boolean Satisfiability

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Matthias Ringe Articles by Thomas Lindenkreuz Articles by Erich Barke

Design Automation and Test in Europe (DATE '98)

Paris, France

February 23-February 26

ISBN: 0-8186-8359-7

	ASCII Text	x
	Matthias Ringe, Thomas Lindenkreuz, Erich Barke, "Path Verification Using Boolean Satisfiability," Design, Automation and Test in Europe Conference and Exhibition, pp. 965, Design Automation and Test in Europe (DATE '98), 1998.

	BibTex	x
	@article{ 10.1109/DATE.1998.655991, author = {Matthias Ringe and Thomas Lindenkreuz and Erich Barke}, title = {Path Verification Using Boolean Satisfiability}, journal ={Design, Automation and Test in Europe Conference and Exhibition}, volume = {0}, year = {1998}, isbn = {0-8186-8359-7}, pages = {965}, doi = {http://doi.ieeecomputersociety.org/10.1109/DATE.1998.655991}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Design, Automation and Test in Europe Conference and Exhibition TI - Path Verification Using Boolean Satisfiability SN - 0-8186-8359-7 SP EP A1 - Matthias Ringe, A1 - Thomas Lindenkreuz, A1 - Erich Barke, PY - 1998 KW - Static Timing Analysis KW - False Path Problem KW - Satisfiability KW - Dynamic Esperance VL - 0 JA - Design, Automation and Test in Europe Conference and Exhibition ER -

Matthias Ringe, Robert Bosch GmbH

Thomas Lindenkreuz, Robert Bosch GmbH

Erich Barke, University of Hanover

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DATE.1998.655991

The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circuit in a reasonable time.

Index Terms:

Static Timing Analysis, False Path Problem, Satisfiability, Dynamic Esperance

Citation:

Matthias Ringe, Thomas Lindenkreuz, Erich Barke, "Path Verification Using Boolean Satisfiability," date, pp.965, Design Automation and Test in Europe (DATE '98), 1998

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.