Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
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 C. McCord, Violetta Cavalli-Sforza
ACL 2007
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
B. Wagle
EJOR