On the computational complexity of dynamic slicing problems for program schemas

DOI10.1017/S0960129511000223zbMath1252.68077arXiv1705.07686OpenAlexW2171827762MaRDI QIDQ3103616

Sebastian Danicic, Michael R. Laurence, Robert M. Hierons

Publication date: 8 December 2011

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.07686

zbMATH Keywords

program slicingprogram slicing algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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 (1)

Statistics and recognition for software birthmark based on clustering analysis

Cites Work

• Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
• An algorithm deciding functional equivalence in a new class of program schemes
• Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas
• Dynamic program slicing
• Equivalence of conservative, free, linear program schemas is decidable
• Precise interprocedural dependence analysis of parallel programs
• Computing polynomial program invariants
• Theoretical foundations of dynamic program slicing
• On formalised computer programs
• Translating Program Schemas to While-Schemas
• Program Slicing
• On the Computational Complexity of Program Scheme Equivalence
• On Ianov's Program Schemata

This page was built for publication: On the computational complexity of dynamic slicing problems for program schemas