Complexity of pattern-based verification for multithreaded programs
From MaRDI portal
Publication:5408569
DOI10.1145/1926385.1926443zbMath1284.68182MaRDI QIDQ5408569
Publication date: 10 April 2014
Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1926385.1926443
68Q45: Formal languages and automata
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Unboundedness Problems for Languages of Vector Addition Systems., On the Complexity of Bounded Context Switching., A complete refinement procedure for regular separability of context-free languages, Bounded underapproximations, Parametric runtime verification is NP-complete and coNP-complete, Parikh's theorem: a simple and direct automaton construction, Interprocedural Reachability for Flat Integer Programs