Logo
Logo

Goldsmiths - University of London

Items Authored/Edited by Laurence, Michael

Up a level
Export as [feed] RSS
Group by: Item Type | Date | No Grouping
Number of items: 11.

Article

Danicic, Sebastian; Hierons, Robert and Laurence, Michael. 2012. Complexity of data dependence problems for program schemas with concurrency. ACM Transactions on Computational Logic, 13(2), pp. 1-18. ISSN 1529-3785 [Article]

Danicic, Sebastian; Barraclough, Richard; Harman, Mark; Howroyd, John; Kiss, Akos and Laurence, Michael. 2011. A unifying theory of control dependence and its application to arbitrary program structures. Theoretical Computer Science, 412(49), pp. 6809-6842. ISSN 0304-3975 [Article]

Danicic, Sebastian; Hierons, Robert and Laurence, Michael. 2011. Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas. Journal of Logic and Algebraic Programming, 80(8), pp. 481-496. ISSN 1567-8326 [Article]

Danicic, Sebastian; Hierons, Robert and Laurence, Michael. 2011. Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas. Journal of Logic and Algebraic Programming, 80(2), pp. 92-112. ISSN 1567-8326 [Article]

Danicic, Sebastian; Hierons, Robert and Laurence, Michael. 2011. On the computational complexity of dynamic slicing problems for program schemas. Mathematical Structures in Computer Science, 21(06), pp. 1339-1362. ISSN 0960-1295 [Article]

[img]
Preview
Danicic, Sebastian; Barraclough, Richard; Binkley, David; Harman, Mark; Hierons, Robert; Kiss, Ákos; Laurence, Michael and Ouarbya, Lahcen. 2010. A trajectory-based strict semantics for program slicing. Theoretical Computer Science, 411(11-13), pp. 1372-1386. ISSN 0304-3975 [Article]

[img]
Preview
Danicic, Sebastian; Laurence, Michael and Hierons, Robert. 2009. Decidability of Strong Equivalence for Subschemas of a Class of Linear, Free, near-Liberal Program Schemas. Goldsmiths Department of Computing Technical Report, [Article]

[img]
Preview
Laurence, Michael. 2007. Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas. The Journal of Logic and Algebraic Programming, 72(2), pp. 157-172. ISSN 1567-8326 [Article]

Danicic, Sebastian; Fox, Chris; Harman, Mark; Hierons, Robert; Howroyd, John and Laurence, Michael. 2005. Slicing algorithms are minimal for programs which can be expressed as linear, free, liberal schemas. The Computer Journal, 48(6), pp. 737-748. ISSN 0010-4620 [Article]

Book Section

Harman, Mark; Hierons, Robert; Danicic, Sebastian; Howroyd, John; Laurence, Michael and Fox, Chris. 2001. Node coarsening calculi for program slicing. In: , ed. 8th Working Conference on Reverse Engineering. Los Alamitos, California, USA: IEEE Computer Society Press, pp. 25-34. ISBN 978-0769513034 [Book Section]

Conference or Workshop Item

Danicic, Sebastian; Harman, Mark; Hierons, Robert; Howroyd, John; Laurence, Michael and Danicic, Sebastian. 2004. 'Applications of linear program schematology in dependence analysis'. In: 1st International Workshop on Programming Language Interference and Dependence. Verona, Italy. [Conference or Workshop Item]

This list was generated on Sat Feb 6 04:58:17 2016 GMT.