Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
A weakest precondition semantics for communicating processes is presented, based on a centralized, one-level approach. Semantic equations are given for the CSP constructs and their continuity is proved. The equivalence of two weakest precondition definitions, one with certain order preferences, and another one, preference-free, is shown. The representation of various operational concepts, including delay, is discussed. Several examples of applying the rules are given. © 1984.
Michael D. Moffitt
ICCAD 2009
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Bowen Zhou, Bing Xiang, et al.
SSST 2008