The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sebastian Danicic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yoga Sivagurunathan, Mark Harman, Sebastian Danicic
    Slicing, I/O and the Implicit State. [Citation Graph (0, 0)][DBLP]
    AADEBUG, 1997, pp:59-68 [Conf]
  2. Chris Fox, Mark Harman, Robert M. Hierons, Sebastian Danicic
    ConSIT: A Conditioned Program Slicer. [Citation Graph (0, 0)][DBLP]
    ICSM, 2000, pp:216-0 [Conf]
  3. Mark Harman, Lin Hu, Robert M. Hierons, Chris Fox, Sebastian Danicic, Joachim Wegener, Harmen Sthamer, André Baresel
    Evolutionary Testing Supported by Slicing and Transformation. [Citation Graph (0, 0)][DBLP]
    ICSM, 2002, pp:285- [Conf]
  4. Mark Harman, Robert M. Hierons, Chris Fox, Sebastian Danicic, John Howroyd
    Pre/Post Conditioned Slicing. [Citation Graph (0, 0)][DBLP]
    ICSM, 2001, pp:138-147 [Conf]
  5. Mark Harman, Yoga Sivagurunathan, Sebastian Danicic
    Analysis of Dynamic Memory Access Using Amorphous Slicing. [Citation Graph (0, 0)][DBLP]
    ICSM, 1998, pp:336-0 [Conf]
  6. Sebastian Danicic, Andrea De Lucia, Mark Harman
    Building Executable Union Slices using Conditioned Slicing. [Citation Graph (0, 0)][DBLP]
    IWPC, 2004, pp:89-99 [Conf]
  7. Chris Fox, Sebastian Danicic, Mark Harman, Robert M. Hierons
    Backward Conditioning: A New Program Specialisation Technique and Its Application to Program Comprehension. [Citation Graph (0, 0)][DBLP]
    IWPC, 2001, pp:89-97 [Conf]
  8. Mark Harman, Sebastian Danicic
    Amorphous Program Slicing. [Citation Graph (0, 0)][DBLP]
    WPC, 1997, pp:70-79 [Conf]
  9. Mark Harman, Chris Fox, Robert M. Hierons, David Binkley, Sebastian Danicic
    Program Simplification as a Means of Approximating Undecidable Propositions. [Citation Graph (0, 0)][DBLP]
    IWPC, 1999, pp:208-217 [Conf]
  10. Lewis Berman, Sebastian Danicic, Keith Brian Gallagher, Nicolas Gold
    The Sound of Software: Using Sonification to Aid Comprehension. [Citation Graph (0, 0)][DBLP]
    ICPC, 2006, pp:225-229 [Conf]
  11. Sebastian Danicic, Mark Harman
    Espresso: A Slicer Generator. [Citation Graph (0, 0)][DBLP]
    SAC (2), 2000, pp:831-839 [Conf]
  12. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    Minimal Slicing and the Relationships Between Forms of Slicing. [Citation Graph (0, 0)][DBLP]
    SCAM, 2005, pp:45-56 [Conf]
  13. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Lahcen Ouarbya
    Formalizing Executable Dynamic and Forward Slicing. [Citation Graph (0, 0)][DBLP]
    SCAM, 2004, pp:43-52 [Conf]
  14. Mark Harman, Chris Fox, Robert M. Hierons, Lin Hu, Sebastian Danicic, Joachim Wegener
    VADA: A Transformation-Based System for Variable Dependence Analysis. [Citation Graph (0, 0)][DBLP]
    SCAM, 2002, pp:55-64 [Conf]
  15. Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya
    An Interprocedural Amorphous Slicer for WSL. [Citation Graph (0, 0)][DBLP]
    SCAM, 2002, pp:105-114 [Conf]
  16. Mohammed Daoudi, Lahcen Ouarbya, John Howroyd, Sebastian Danicic, Mark Harman, Chris Fox, Martin P. Ward
    ConSUS: A Scalable Approach to Conditioned Slicing. [Citation Graph (0, 0)][DBLP]
    WCRE, 2002, pp:109-118 [Conf]
  17. Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox
    Node Coarsening Calculi for Program Slicing. [Citation Graph (0, 0)][DBLP]
    WCRE, 2001, pp:25-34 [Conf]
  18. Lahcen Ouarbya, Sebastian Danicic, Mohammed Daoudi, Mark Harman, Chris Fox
    A Denotational Interprocedural Program Slicer. [Citation Graph (0, 0)][DBLP]
    WCRE, 2002, pp:181-0 [Conf]
  19. Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, David Binkley, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya
    Syntax-Directed Amorphous Slicing. [Citation Graph (0, 0)][DBLP]
    Autom. Softw. Eng., 2004, v:11, n:1, pp:27-61 [Journal]
  20. Sebastian Danicic, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence
    Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:6, pp:737-748 [Journal]
  21. David Binkley, Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya
    A formal relationship between program slicing and partial evaluation. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2006, v:18, n:2, pp:103-119 [Journal]
  22. Mark Harman, Dan Simpson, Sebastian Danicic
    Slicing Programs in the Presence of Errors. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1996, v:8, n:4, pp:490-497 [Journal]
  23. Sebastian Danicic, Mark Harman, Yoga Sivagurunathan
    A Parallel Algorithm for Static Program Slicing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:6, pp:307-313 [Journal]
  24. Sebastian Danicic, Mohammed Daoudi, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Lahcen Ouarbya, Martin P. Ward
    ConSUS: a light-weight program conditioner. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2005, v:77, n:3, pp:241-262 [Journal]
  25. Mark Harman, David Binkley, Sebastian Danicic
    Amorphous program slicing. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2003, v:68, n:1, pp:45-64 [Journal]
  26. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    A formalisation of the relationship between forms of program slicing. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2006, v:62, n:3, pp:228-252 [Journal]
  27. Mark Harman, Sebastian Danicic
    Projecting Functional Models of Imperative Programs. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1993, v:28, n:11, pp:33-41 [Journal]
  28. Keith Gallagher, Mark Harman, Sebastian Danicic
    Guaranteed inconsistency avoidance during software evolution. [Citation Graph (0, 0)][DBLP]
    Journal of Software Maintenance, 2003, v:15, n:6, pp:393-416 [Journal]
  29. Mark Harman, Sebastian Danicic
    A new algorithm for slicing unstructured programs. [Citation Graph (0, 0)][DBLP]
    Journal of Software Maintenance, 1998, v:10, n:6, pp:415-441 [Journal]
  30. Chris Fox, Sebastian Danicic, Mark Harman, Robert M. Hierons
    ConSIT: a fully automated conditioned program slicer. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2004, v:34, n:1, pp:15-46 [Journal]
  31. Mark Harman, Sebastian Danicic
    Using Program Slicing to Simplify Testing. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 1995, v:5, n:3, pp:143-162 [Journal]
  32. Robert M. Hierons, Mark Harman, Sebastian Danicic
    Using Program Slicing to Assist in the Detection of Equivalent Mutants. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 1999, v:9, n:4, pp:233-262 [Journal]
  33. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    Theoretical foundations of dynamic program slicing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:360, n:1-3, pp:23-41 [Journal]
  34. Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd
    Equivalence of conservative, free, linear program schemas is decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:831-862 [Journal]
  35. Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence
    Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:373, n:1-2, pp:1-18 [Journal]
  36. David Clark, Sebastian Danicic, Roberto Giacobazzi
    Special issue on Programming Language Interference and Dependence. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:72, n:2, pp:123- [Journal]
  37. Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya
    A non-standard semantics for program slicing and dependence analysis. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:72, n:2, pp:191-206 [Journal]

  38. An Evaluation of Current Java Bytecode Decompilers. [Citation Graph (, )][DBLP]


  39. Complexity of Data Dependence problems for Program Schemas with Concurrency [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002