Danicic, Sebastian; Hierons, Robert M.; Laurence, Michael R. Complexity of data dependence problems for program schemas with concurrency. (English) Zbl 1351.68071 ACM Trans. Comput. Log. 13, No. 2, Article No. 15, 18 p. (2012). MSC: 68N30 68N20 68Q85 PDFBibTeX XMLCite \textit{S. Danicic} et al., ACM Trans. Comput. Log. 13, No. 2, Article No. 15, 18 p. (2012; Zbl 1351.68071) Full Text: DOI arXiv
Danicic, Sebastian; Hierons, Robert. M.; Laurence, Michael R. On the computational complexity of dynamic slicing problems for program schemas. (English) Zbl 1252.68077 Math. Struct. Comput. Sci. 21, No. 6, 1339-1362 (2011). MSC: 68N30 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Danicic} et al., Math. Struct. Comput. Sci. 21, No. 6, 1339--1362 (2011; Zbl 1252.68077) Full Text: DOI arXiv
Danicic, Sebastian; Barraclough, Richard W.; Harman, Mark; Howroyd, John D.; Kiss, Ákos; Laurence, Michael R. A unifying theory of control dependence and its application to arbitrary program structures. (English) Zbl 1231.68179 Theor. Comput. Sci. 412, No. 49, 6809-6842 (2011). MSC: 68R10 68N30 PDFBibTeX XMLCite \textit{S. Danicic} et al., Theor. Comput. Sci. 412, No. 49, 6809--6842 (2011; Zbl 1231.68179) Full Text: DOI Link
Danicic, Sebastian; Hierons, Robert M.; Laurence, Michael R. Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas. (English) Zbl 1231.68107 J. Log. Algebr. Program. 80, No. 8, 481-496 (2011). MSC: 68N30 PDFBibTeX XMLCite \textit{S. Danicic} et al., J. Log. Algebr. Program. 80, No. 8, 481--496 (2011; Zbl 1231.68107) Full Text: DOI arXiv
Danicic, Sebastian; Hierons, Robert M.; Laurence, Michael R. Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas. (English) Zbl 1209.68136 J. Log. Algebr. Program. 80, No. 2, 92-112 (2011). MSC: 68N99 PDFBibTeX XMLCite \textit{S. Danicic} et al., J. Log. Algebr. Program. 80, No. 2, 92--112 (2011; Zbl 1209.68136) Full Text: DOI Link
Barraclough, Richard W.; Binkley, David; Danicic, Sebastian; Harman, Mark; Hierons, Robert M.; Kiss, Ákos; Laurence, Mike; Ouarbya, Lahcen A trajectory-based strict semantics for program slicing. (English) Zbl 1191.68405 Theor. Comput. Sci. 411, No. 11-13, 1372-1386 (2010). MSC: 68Q55 68N99 PDFBibTeX XMLCite \textit{R. W. Barraclough} et al., Theor. Comput. Sci. 411, No. 11--13, 1372--1386 (2010; Zbl 1191.68405) Full Text: DOI Link
Danicic, Sebastian; Harman, Mark; Howroyd, John; Ouarbya, Lahcen A non-standard semantics for program slicing and dependence analysis. (English) Zbl 1119.68110 J. Log. Algebr. Program. 72, No. 2, 191-206 (2007). MSC: 68Q55 68N99 PDFBibTeX XMLCite \textit{S. Danicic} et al., J. Log. Algebr. Program. 72, No. 2, 191--206 (2007; Zbl 1119.68110) Full Text: DOI
Danicic, Sebastian; Harman, Mark; Hierons, Rob; Howroyd, John; Laurence, Michael R. Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. (English) Zbl 1111.68024 Theor. Comput. Sci. 373, No. 1-2, 1-18 (2007). MSC: 68N99 PDFBibTeX XMLCite \textit{S. Danicic} et al., Theor. Comput. Sci. 373, No. 1--2, 1--18 (2007; Zbl 1111.68024) Full Text: DOI
Binkley, David W.; Danicic, Sebastian; Harman, Mark; Howroyd, John; Ouarbya, Lahcen A formal relationship between program slicing and partial evaluation. (English) Zbl 1102.68442 Formal Asp. Comput. 18, No. 2, 103-119 (2006). MSC: 68N99 PDFBibTeX XMLCite \textit{D. W. Binkley} et al., Formal Asp. Comput. 18, No. 2, 103--119 (2006; Zbl 1102.68442) Full Text: DOI
Binkley, Dave; Danicic, Sebastian; Gyimóthy, Tibor; Harman, Mark; Kiss, Ákos; Korel, Bogdan A formalisation of the relationship between forms of program slicing. (English) Zbl 1100.68549 Sci. Comput. Program. 62, No. 3, 228-252 (2006). MSC: 68N99 PDFBibTeX XMLCite \textit{D. Binkley} et al., Sci. Comput. Program. 62, No. 3, 228--252 (2006; Zbl 1100.68549) Full Text: DOI
Binkley, Dave; Danicic, Sebastian; Gyimóthy, Tibor; Harman, Mark; Kiss, Ákos; Korel, Bogdan Theoretical foundations of dynamic program slicing. (English) Zbl 1097.68026 Theor. Comput. Sci. 360, No. 1-3, 23-41 (2006). MSC: 68N99 PDFBibTeX XMLCite \textit{D. Binkley} et al., Theor. Comput. Sci. 360, No. 1--3, 23--41 (2006; Zbl 1097.68026) Full Text: DOI
Laurence, Michael R.; Danicic, Sebastian; Harman, Mark; Hierons, Rob; Howroyd, John Equivalence of conservative, free, linear program schemas is decidable. (English) Zbl 1019.68011 Theor. Comput. Sci. 290, No. 1, 831-862 (2003). MSC: 68N01 PDFBibTeX XMLCite \textit{M. R. Laurence} et al., Theor. Comput. Sci. 290, No. 1, 831--862 (2003; Zbl 1019.68011) Full Text: DOI
Harman, Mark; Simpson, Dan; Danicic, Sebastian Slicing programs in the presence of errors. (English) Zbl 0857.68017 Formal Asp. Comput. 8, No. 4, 490-497 (1996). MSC: 68N01 PDFBibTeX XMLCite \textit{M. Harman} et al., Formal Asp. Comput. 8, No. 4, 490--497 (1996; Zbl 0857.68017) Full Text: DOI
Danicic, Sebastian; Harman, Mark; Sivagurunathan, Yoga A parallel algorithm for static program slicing. (English) Zbl 0875.68506 Inf. Process. Lett. 56, No. 6, 307-313 (1995). MSC: 68W15 PDFBibTeX XMLCite \textit{S. Danicic} et al., Inf. Process. Lett. 56, No. 6, 307--313 (1995; Zbl 0875.68506) Full Text: DOI