A general-purpose algorithm for analyzing concurrent programs

DOI10.1145/69586.69587MaRDI QIDQ3664420zbMATH OpenOpenAlexFDO

Authors 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

synchronizationparallelismverification problemsconcurrent software systems

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664420)