A strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations

Ali Dasdan. A strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations. In Jörg Henkel, Xiaobo Sharon Hu, Rajesh Gupta, Sri Parameswaran, editors, Proceedings of the Tenth International Symposium on Hardware/Software Codesign, CODES 2002, Estes Park, Colorado, USA, May 6-8, 2002. pages 127-132, ACM, 2002. [doi]

Abstract

Abstract is missing.