UNSPECIFIED (1992) DEFINING CONDITIONAL-INDEPENDENCE USING COLLAPSES. In: INTERNATIONAL WORKSHOP ON SEMANTICS FOR CONCURRENCY, JUL 23-25, 1990, UNIV LEICESTER, LEICESTER, ENGLAND.

Full text not available from this repository.

Abstract

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.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Journal or Publication Title:	THEORETICAL COMPUTER SCIENCE
Publisher:	ELSEVIER SCIENCE BV
ISSN:	0304-3975
Date:	20 July 1992
Volume:	101
Number:	2
Number of Pages:	23
Page Range:	pp. 337-359
Publication Status:	Published
Title of Event:	INTERNATIONAL WORKSHOP ON SEMANTICS FOR CONCURRENCY
Location of Event:	UNIV LEICESTER, LEICESTER, ENGLAND
Date(s) of Event:	JUL 23-25, 1990
URI:	http://wrap.warwick.ac.uk/id/eprint/21902

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item