On optimal slicing of parallel programs

DOI10.1145/380752.380864zbMath1323.68316OpenAlexW2068674794MaRDI QIDQ5176023

Helmut Seidl, Markus Müller-Olm

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

complexityundecidabilityinterprocedural analysisslicingparallel programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Precise interprocedural dependence analysis of parallel programs ⋮ Scaling down discrete-event simulation models ⋮ Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation ⋮ Slicing communicating automata specifications: Polynomial algorithms for model reduction

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: On optimal slicing of parallel programs