We give a new denotational semantics for a shared variable pamllel progmmming language and prove full abstraction: the semantics gives identical meanings to commands if and only if they induce the same partial comctness behavior in all program conteds. The meaning of a command is a set of "transition truces", which record the ways in which a command may interact with and be aflected by its environment. W e show how to modify the semantics to incorporate new progmm constructs, to allow for diflerent levels of granularity or atomicity, and to model fair infinite cornputation, in each case achieving full abstraction with respect to an appropriate notion of program behavior.
Full abstraction for a shared variable parallel imperative language is also studied in REF .
Full abstraction for a shared variable parallel language
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
Computer Science