Proving partial order properties
type: Item
instance of: scholarly article
title: Proving partial order properties
zbMATH Open document ID: 0803.68070
DOI: 10.1016/0304-3975(94)90009-4
author: Amir Pnueli
author: Doron Peled
published in: Theoretical Computer Science
publication date: 1995-01-08T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 562574
zbMATH Keywords: proof system
zbMATH Keywords: safety
zbMATH Keywords: soundness
zbMATH Keywords: completeness
zbMATH Keywords: snapshot algorithm
zbMATH Keywords: concurrency
zbMATH Keywords: serializability
zbMATH Keywords: temporal verification
zbMATH Keywords: partial order semantics
zbMATH Keywords: traces
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90009-4
OpenAlex ID: W2034410903
cites work: Recursive assertions and parallel programs
cites work: Q3899466
cites work: Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
cites work: Soundness and Completeness of an Axiom System for Program Verification
cites work: Guarded commands, nondeterminacy and formal derivation of programs
cites work: Decomposition of distributed programs into communication-closed layers
cites work: Using branching time temporal logic to synthesize synchronization skeletons
cites work: “Sometimes” and “not never” revisited
cites work: Q3738540
cites work: A proof rule for fair termination of guarded commands
cites work: First-order dynamic logic
cites work: Communicating sequential processes
cites work: Concurrent and maximally concurrent evolution of nonsequential systems
cites work: Verification of distributed programs using representative interleaving sequences
cites work: Defining conditional independence using collapses
cites work: Event fairness and non-interleaving concurrency
cites work: Q3922147
cites work: Adequate proof principles for invariance and liveness properties of concurrent programs
cites work: Q4733399
cites work: Q3482822
cites work: Synthesis of Communicating Processes from Temporal Logic Specifications
cites work: Concurrent systems and inevitability
cites work: Petri nets, event structures and domains. I
cites work: Q4140351
cites work: Q4205072
cites work: Modeling concurrency with partial orders
cites work: Q3814798
cites work: Q5573961
cites work: Q5537599
cites work: The \(\mu\)-calculus as an assertion-language for fairness arguments
cites work: Q3776635
description: scientific article; zbMATH DE number 562574