A trajectory-based strict semantics for program slicing

DOI10.1016/j.tcs.2009.10.025zbMath1191.68405OpenAlexW2147082313WikidataQ59609520 ScholiaQ59609520MaRDI QIDQ960858

Ákos Kiss, Lahcen Ouarbya, Robert M. Hierons, Mark Harman, Richard W. Barraclough, Mike Laurence, Sebastian Danicic, David W. Binkley

Publication date: 29 March 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.gold.ac.uk/2442/1/itNew.pdf

zbMATH Keywords

program slicingprogram semanticsprogram dependencenon-termination

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theory of software (68N99)

Related Items (2)

A unifying theory of control dependence and its application to arbitrary program structures ⋮ Cut branches before looking for bugs: certifiably sound verification on relaxed slices

Cites Work

• Unnamed Item
• Unnamed Item
• Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
• A non-standard semantics for program slicing and dependence analysis
• Dynamic program slicing
• Non-standard semantics for program slicing
• Slicing software for model construction
• Equivalence of conservative, free, linear program schemas is decidable
• Transfinite reductions in orthogonal term rewriting systems
• Selective strictness and parametricity in structural operational semantics, inequationally
• Theoretical foundations of dynamic program slicing
• A formalisation of the relationship between forms of program slicing
• Program Slicing
• The program dependence graph and its use in optimization
• Semantics-preserving procedure extraction
• Programming Languages and Systems

This page was built for publication: A trajectory-based strict semantics for program slicing