TY - GEN

T1 - Defining Conditional Independence Using Collapses

AU - Katz, S.

AU - Peled, D.

N1 - Place of conference:University of Leicester, UK

PY - 1990

Y1 - 1990

N2 - Trace semantics is extended to allow conditional commutativity among operations. Conditional commutativity is obtained by identifying the context (the set of global states) in which operations are commutative using special predicates. These predicates allow collapsing execution histories into equivalence classes of conditional traces. Using this approach, it is possible that the execution of two operations will be dependent in one context and independent in another. The predicates allow defining a family of possible semantic definitions for each language, where each is an extension of previous standard definitions. Examples are shown when such a semantics is desired. As an example of an application, a proof method for total correctness is introduced.

AB - Trace semantics is extended to allow conditional commutativity among operations. Conditional commutativity is obtained by identifying the context (the set of global states) in which operations are commutative using special predicates. These predicates allow collapsing execution histories into equivalence classes of conditional traces. Using this approach, it is possible that the execution of two operations will be dependent in one context and independent in another. The predicates allow defining a family of possible semantic definitions for each language, where each is an extension of previous standard definitions. Examples are shown when such a semantics is desired. As an example of an application, a proof method for total correctness is introduced.

UR - https://books.google.co.il/books?hl=iw&lr=&id=l4rfBwAAQBAJ&oi=fnd&pg=PA262&dq=De%EF%AC%81ning+Conditional+Independence+Using+Collapses,+Semantics+for+Concurrency&ots=fcRMm93HbX&sig=2gwGABpVoM2WyhnajrHqx3irp1w&redir_esc=y#v=onepage&q&f=false

M3 - Conference contribution

BT - International BCS-FACS Workshop

PB - Springer

ER -