On optimal slicing of parallel programs
From MaRDI portal
Publication:5176023
DOI10.1145/380752.380864zbMath1323.68316MaRDI 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
68Q25: Analysis of algorithms and problem complexity
03B70: Logic in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
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
Cites Work