Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
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.
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Rolf Clauberg
IBM J. Res. Dev
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Elliot Linzer, M. Vetterli
Computing