A linear history semantics for distributed languages extended abstract

N. Frances, D. Lehmann, A. Pnueli

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

A denotational semantics is given for a distributed language based on communication (CSP). The semantics uses linear sequences of communications to record computations; for any well formed program segment the semantics is a relation between attainable states and the communication sequences needed to attain these states. In binding two or more processes we match and merge the communication sequences assumed by each process to obtain a sequence and state of the combined process.. The approach taken here is distinguished by relatively simple semantic domains and ordering.

Original languageEnglish
Article number4567814
Pages (from-to)143-151
Number of pages9
JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOIs
StatePublished - 1980
Event21st Annual Symposium on Foundations of Computer Science, FOCS 1980 - Syracuse, United States
Duration: 13 Oct 198015 Oct 1980

Bibliographical note

Publisher Copyright:
© 1980 IEEE Computer Society. All rights reserved.

Fingerprint

Dive into the research topics of 'A linear history semantics for distributed languages extended abstract'. Together they form a unique fingerprint.

Cite this