Analysis of recursively parallel programs

DOI10.1145/2103656.2103681zbMath1321.68184OpenAlexW4214858758MaRDI QIDQ2942873

Michael Emmi, Ahmed Bouajjani

Publication date: 11 September 2015

Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.2508

zbMATH Keywords

verificationparallelismconcurrency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Unnamed Item ⋮ Nonelementary Complexities for Branching VASS, MELL, and Extensions ⋮ Automated synthesis of asynchronizations ⋮ Unnamed Item ⋮ Analyzing pushdown systems with stack manipulation ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ Hardness Results for Coverability Problem of Well-Structured Pushdown Systems ⋮ Deadlock Detection in Linear Recursive Programs

This page was built for publication: Analysis of recursively parallel programs