Complexity of Data Dependence Problems for Program Schemas with Concurrency
From MaRDI portal
Publication:2946663
DOI10.1145/2159531.2159537zbMath1351.68071arXiv1007.3878OpenAlexW2121670372MaRDI QIDQ2946663
Sebastian Danicic, Michael R. Laurence, Robert M. Hierons
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3878
Theory of compilers and interpreters (68N20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
This page was built for publication: Complexity of Data Dependence Problems for Program Schemas with Concurrency