Travelled to:1 × Germany
1 × Greece
1 × Hungary
2 × Italy
4 × Canada
4 × USA
Collaborated with:M.Harman C.Fox R.M.Hierons J.Hamilton D.Binkley L.Ouarbya J.Howroyd T.Gyimóthy Á.Kiss M.Daoudi L.Hu B.Korel A.D.Lucia Y.Sivagurunathan J.Wegener L.I.Berman K.B.Gallagher N.Gold M.R.Laurence M.Munro X.Zhang M.P.Ward H.Sthamer A.Baresel
Talks about:slice (12) program (8) condit (5) slicer (4) amorph (3) use (3) interprocedur (2) relationship (2) comprehens (2) transform (2)
Person: Sebastian Danicic
DBLP: Danicic:Sebastian
Contributed to:
2012
2009
200620052006
2004200420022002
20022001200120012000
200019991998
1997Wrote 20 papers:
- ICSM-2012-HamiltonD #community #dependence #source code
- Dependence communities in source code (JH, SD), pp. 579–582.
- SCAM-2009-HamiltonD #bytecode #evaluation #java
- An Evaluation of Current Java Bytecode Decompilers (JH, SD), pp. 129–136.
- ICPC-2006-BermanDGG #comprehension #using
- The Sound of Software: Using Sonification to Aid Comprehension (LIB, SD, KBG, NG), pp. 225–229.
- SCAM-2005-BinkleyDGHKK #slicing
- Minimal Slicing and the Relationships Between Forms of Slicing (DB, SD, TG, MH, ÁK, BK), pp. 45–56.
- SCAM-J-2005-BinkleyDGHKK06 #formal method #slicing
- A formalisation of the relationship between forms of program slicing (DB, SD, TG, MH, ÁK, BK), pp. 228–252.
- IWPC-2004-DanicicLH #execution #slicing #using
- Building Executable Union Slices using Conditioned Slicing (SD, ADL, MH), pp. 89–99.
- SCAM-2004-BinkleyDGHKO #execution #formal method #slicing
- Formalizing Executable Dynamic and Forward Slicing (DB, SD, TG, MH, ÁK, LO), pp. 43–52.
- ICSM-2002-HarmanHHFDWSB #slicing #testing
- Evolutionary Testing Supported by Slicing and Transformation (MH, LH, RMH, CF, SD, JW, HS, AB), p. 285.
- SCAM-2002-HarmanFHHDW #analysis #dependence #named
- VADA: A Transformation-Based System for Variable Dependence Analysis (MH, CF, RMH, LH, SD, JW), pp. 55–64.
- SCAM-2002-HarmanHMZDDO #interprocedural #slicing
- An Interprocedural Amorphous Slicer for WSL (MH, LH, MM, XZ, SD, MD, LO), pp. 105–114.
- WCRE-2002-DaoudiOHDHFW #approach #named #scalability #slicing
- ConSUS: A Scalable Approach to Conditioned Slicing (MD, LO, JH, SD, MH, CF, MPW), pp. 109–118.
- WCRE-2002-OuarbyaDDHF #interprocedural #slicing
- A Denotational Interprocedural Program Slicer (LO, SD, MD, MH, CF), p. 181–?.
- ICSM-2001-HarmanHFDH #slicing
- Pre/Post Conditioned Slicing (MH, RMH, CF, SD, JH), pp. 138–147.
- IWPC-2001-FoxDHH #comprehension
- Backward Conditioning: A New Program Specialisation Technique and Its Application to Program Comprehension (CF, SD, MH, RMH), pp. 89–97.
- WCRE-2001-HarmanHDHLF #calculus #slicing
- Node Coarsening Calculi for Program Slicing (MH, RMH, SD, JH, MRL, CF), pp. 25–34.
- ICSM-2000-FoxHHD #named #slicing
- ConSIT: A Conditioned Program Slicer (CF, MH, RMH, SD), p. 216–?.
- SAC-2000-DanicicH #generative #named #slicing
- Espresso: A Slicer Generator (SD, MH), pp. 831–839.
- IWPC-1999-HarmanFHBD #approximate #decidability
- Program Simplification as a Means of Approximating Undecidable Propositions (MH, CF, RMH, DB, SD), pp. 208–217.
- ICSM-1998-HarmanSD #analysis #memory management #slicing #using
- Analysis of Dynamic Memory Access Using Amorphous Slicing (MH, YS, SD), p. 336–?.
- WPC-1997-HarmanD #slicing
- Amorphous Program Slicing (MH, SD), pp. 70–79.