A trajectory-based strict semantics for program slicing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- A formalisation of the relationship between forms of program slicing
- A non-standard semantics for program slicing and dependence analysis
- Dynamic program slicing
- Equivalence of conservative, free, linear program schemas is decidable
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
- Non-standard semantics for program slicing
- Program Slicing
- Programming Languages and Systems
- Selective strictness and parametricity in structural operational semantics, inequationally
- Semantics-preserving procedure extraction
- Slicing software for model construction
- The program dependence graph and its use in optimization
- Theoretical foundations of dynamic program slicing
- Transfinite corecursion
- Transfinite reductions in orthogonal term rewriting systems
Cited in
(11)- Abstract program slicing: an abstract interpretation-based approach to program slicing
- Using Relational Verification for Program Slicing
- A non-standard semantics for program slicing and dependence analysis
- Cut branches before looking for bugs: certifiably sound verification on relaxed slices
- A generic program slicing technique based on language definitions
- Iteratively defined transfinite trace semantics and program slicing with respect to them
- A formal relationship between program slicing and partial evaluation
- Non-standard semantics for program slicing
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
- A unifying theory of control dependence and its application to arbitrary program structures
- Fractional Semantics
This page was built for publication: A trajectory-based strict semantics for program slicing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960858)
