A general-purpose algorithm for analyzing concurrent programs

DOI10.1145/69586.69587zbMath0516.68027OpenAlexW1984909114MaRDI QIDQ3664420

Richard N. Taylor

Publication date: 1983

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/69586.69587

zbMATH Keywords

parallelismsynchronizationverification problemsconcurrent software systems

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (6)

Formal timing analysis for distributed real-time programs ⋮ Combining Model Checking and Testing ⋮ An algorithm for analyzing communicating processes ⋮ Complexity measures for concurrent programs based on information- theoretic metrics ⋮ Complexity analysis of propositional concurrent programs using domino tiling ⋮ A minimal property for characterizing deadlock-free programs

This page was built for publication: A general-purpose algorithm for analyzing concurrent programs