Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
This paper presents a comparatively general method for specifying a 'data constraint' on a parameterized data type (i.e., specifying just which category of algebras it is supposed to be defined or correct on), and shows that there is a simple canonical form for such constraint specifications. We also show how such constraints may be employed to give 'loose' specifications of data types. © 1987.
Michael D. Moffitt
ICCAD 2009
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Oliver Bodemer
IBM J. Res. Dev