The following publications are possibly variants of this publication:
- Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemasMichael R. Laurence. jlp, 72(2):157-172, 2007. [doi]
- Static Program Slicing Algorithms are Minimal for Free Liberal Program SchemasSebastian Danicic, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence. cj, 48(6):737-748, 2005. [doi]
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial timeSebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence. TCS, 373(1-2):1-18, 2007. [doi]
- Formalizing executable dynamic and forward slicingBinkley, D., Danicic, S., Gyimothy, T., Harman, M., Kiss, A., Ouarbya, L.. In Source Code Analysis and Manipulation, 2004. Fourth IEEE International Workshop on. 2004: [doi]
- Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemasSebastian Danicic, Robert M. Hierons, Michael R. Laurence. jlp, 80(2):92-112, 2011. [doi]
- A non-standard semantics for program slicing and dependence analysisSebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya. jlp, 72(2):191-206, 2007. [doi]