Logo
Logo

Goldsmiths - University of London

Items Authored/Edited by Danicic, Sebastian

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Jump to: Article
Number of items: 13.

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]

Barraclough, Richard, Binkley, Dave, Danicic, Sebastian, Harman, Mark, Hierons, Robert, Kiss, Akos, Laurence, Mike 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]

Danicic, Sebastian, Harman, M., Hierons, R. and Laurence, M.. 2007. Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. Theoretical Computer Science, 373(1-2), pp. 1-18. ISSN 03043975 [Article]

Danicic, Sebastian, Harman, Mark, Howroyd, John and Ouarbya, Lahcen. 2007. A non-standard semantics for program slicing and dependence analysis. The Journal of Logic and Algebraic Programming, 72(2), pp. 192-206. ISSN 1567-8326 [Article]

Binkley, Dave, Danicic, Sebastian, Gyimóthy, Tibor, Harman, Mark, Kiss, Ákos and Korel, Bogdan. 2006. Theoretical foundations of dynamic program slicing. Theoretical Computer Science, 360(1-3), pp. 23-41. ISSN 03043975 [Article]

Binkley, Dave, Danicic, Sebastian, Harman, Mark, Howroyd, John and Ouarbya, Lahcen. 2006. A formal relationship between program slicing and partial evaluation. Formal Aspects of Computing, 18(2), pp. 103-119. ISSN 09345043 [Article]

Danicic, Sebastian, Laurence, M., Harman, M. and Hierons, R.. 2003. Equivalence of conservative, free, linear programs is decidable. Theoretical Computer Science, 290(1), pp. 831-862. ISSN 03043975 [Article]

This list was generated on Thu Dec 18 22:17:37 2014 GMT.