Finding Bounded Path in Graph Using SMT for Automatic Clock Routing

Amit Erez, Alexander Nadel. Finding Bounded Path in Graph Using SMT for Automatic Clock Routing. In Daniel Kroening, Corina S. Pasareanu, editors, Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II. Volume 9207 of Lecture Notes in Computer Science, pages 20-36, Springer, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.