Proving partial order properties

Doron Peled, Amir Pnueli

Research output: Contribution to journalArticlepeer-review

35 Scopus citations

Abstract

A temporal verification method which is based upon partial order semantics of traces (Mazurkiewicz, 1987) is presented. The semantic model used here can express the distributed aspects of a program, e.g. properties such as serializability of database transactions, layering of a program, snapshots or the parallel execution of program segments. The proof rules are shown to be sound and relatively complete.

Original languageEnglish
Pages (from-to)143-182
Number of pages40
JournalTheoretical Computer Science
Volume126
Issue number2
DOIs
StatePublished - 25 Apr 1994
Externally publishedYes

Fingerprint

Dive into the research topics of 'Proving partial order properties'. Together they form a unique fingerprint.

Cite this