An approach to automating the verification of compact parallel coordination programs. I
type: Item
instance of: scholarly article
title: An approach to automating the verification of compact parallel coordination programs. I
zbMATH Open document ID: 0522.68017
DOI: 10.1007/BF00289237
author: Boris D. Lubachevsky
published in: Acta Informatica
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3827177
zbMATH Keywords: shared memory asynchronous parallel processor
zbMATH Keywords: NYU-ultracomputer
zbMATH Keywords: correctness proof
zbMATH Keywords: reachability set description
zbMATH Keywords: meta-states
zbMATH Keywords: compact parallel program
MaRDI profile type: Publication
cites work: Proving assertions about parallel programs
cites work: Q3318086
cites work: Synthesis of Resource Invariants for Concurrent Programs
cites work: System modelling with high-level Petri nets
cites work: Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
cites work: On the reachability problem for 5-dimensional vector addition systems
cites work: Parallel program schemata
cites work: A starvation-free solution to the mutual exclusion problem
cites work: Verifying properties of parallel programs
cites work: Proving Liveness Properties of Concurrent Programs
cites work: Q5624635
cites work: The temporal semantics of concurrent programs
cites work: A lattice-theoretical fixpoint theorem and its applications
full work available at URL: https://doi.org/10.1007/bf00289237
OpenAlex ID: W2042876806
description: scientific article; zbMATH DE number 3827177