On optimal slicing of parallel programs

DOI10.1145/380752.380864MaRDI QIDQ5176023zbMATH OpenOpenAlexFDO

Authors Markus Müller-Olm, Helmut Seidl

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

complexityinterprocedural analysisparallel programsslicingundecidability

Mathematics Subject Classification ID

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

Recommendations

• On the sequential nature of interprocedural program-analysis problems
• scientific article; zbMATH DE number 2006645
• Program Slicing
• A parallel algorithm for static program slicing
• On the computational complexity of dynamic slicing problems for program schemas

Cites work

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

Cited in

(6)

• Slicing communicating automata specifications: Polynomial algorithms for model reduction
• 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
• Compiler Construction
• Efficient comparison of program slices

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

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