default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Danicic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j28]Sebastian Danicic, Michael R. Laurence:
Static Backward Slicing of Non-deterministic Programs and Systems. ACM Trans. Program. Lang. Syst. 40(3): 11:1-11:46 (2018)- 2017
- [j27]Yun Zhou, Minlue Wang, Valeriia Haberland
, John Howroyd, Sebastian Danicic, J. Mark Bishop:
Improving Record Linkage Accuracy with Hierarchical Feature Level Information and Parsed Data. New Gener. Comput. 35(1): 87-104 (2017) - [i3]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
On the computational complexity of dynamic slicing problems for program schemas. CoRR abs/1705.07686 (2017) - [i2]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Characterizing Minimal Semantics-preserving Slices of predicate-linear, Free, Liberal Program Schemas. CoRR abs/1705.09615 (2017) - 2015
- [c22]Yun Zhou, John Howroyd, Sebastian Danicic, J. Mark Bishop:
Extending Naive Bayes Classifier with Hierarchy Feature Level Information for Record Linkage. AMBN@JSAI-isAI 2015: 93-104 - 2012
- [j26]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Complexity of Data Dependence Problems for Program Schemas with Concurrency. ACM Trans. Comput. Log. 13(2): 15:1-15:18 (2012) - [c21]James Alexander George Hamilton, Sebastian Danicic:
Dependence communities in source code. ICSM 2012: 579-582 - 2011
- [j25]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas. J. Log. Algebraic Methods Program. 80(2): 92-112 (2011) - [j24]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas. J. Log. Algebraic Methods Program. 80(8): 481-496 (2011) - [j23]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
On the computational complexity of dynamic slicing problems for program schemas. Math. Struct. Comput. Sci. 21(6): 1339-1362 (2011) - [j22]Sebastian Danicic, Richard W. Barraclough, Mark Harman, John Howroyd, Ákos Kiss, Michael R. Laurence:
A unifying theory of control dependence and its application to arbitrary program structures. Theor. Comput. Sci. 412(49): 6809-6842 (2011) - [c20]James Alexander George Hamilton, Sebastian Danicic:
A survey of static software watermarking. WorldCIS 2011: 100-107 - 2010
- [j21]Richard W. Barraclough, David W. Binkley, Sebastian Danicic, Mark Harman, Robert M. Hierons, Ákos Kiss, Mike Laurence, Lahcen Ouarbya:
A trajectory-based strict semantics for program slicing. Theor. Comput. Sci. 411(11-13): 1372-1386 (2010) - [i1]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Complexity of Data Dependence problems for Program Schemas with Concurrency. CoRR abs/1007.3878 (2010)
2000 – 2009
- 2009
- [c19]James Alexander George Hamilton, Sebastian Danicic:
An Evaluation of Current Java Bytecode Decompilers. SCAM 2009: 129-136 - 2007
- [j20]David Clark, Sebastian Danicic, Roberto Giacobazzi:
Special issue on Programming Language Interference and Dependence. J. Log. Algebraic Methods Program. 72(2): 123 (2007) - [j19]Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya:
A non-standard semantics for program slicing and dependence analysis. J. Log. Algebraic Methods Program. 72(2): 191-206 (2007) - [j18]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. Theor. Comput. Sci. 373(1-2): 1-18 (2007) - 2006
- [j17]David W. Binkley, Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya:
A formal relationship between program slicing and partial evaluation. Formal Aspects Comput. 18(2): 103-119 (2006) - [j16]David W. Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel:
A formalisation of the relationship between forms of program slicing. Sci. Comput. Program. 62(3): 228-252 (2006) - [j15]David W. Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel:
Theoretical foundations of dynamic program slicing. Theor. Comput. Sci. 360(1-3): 23-41 (2006) - [c18]Lewis Irwin Berman, Sebastian Danicic, Keith B. Gallagher, Nicolas Gold:
The Sound of Software: Using Sonification to Aid Comprehension. ICPC 2006: 225-229 - 2005
- [j14]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. Comput. J. 48(6): 737-748 (2005) - [j13]Sebastian Danicic, Mohammed Daoudi, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Lahcen Ouarbya, Martin P. Ward:
ConSUS: a light-weight program conditioner. J. Syst. Softw. 77(3): 241-262 (2005) - [c17]David W. Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel:
Minimal Slicing and the Relationships Between Forms of Slicing. SCAM 2005: 45-56 - 2004
- [j12]Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, David W. Binkley, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya:
Syntax-Directed Amorphous Slicing. Autom. Softw. Eng. 11(1): 27-61 (2004) - [j11]Chris Fox, Sebastian Danicic, Mark Harman, Robert M. Hierons:
ConSIT: a fully automated conditioned program slicer. Softw. Pract. Exp. 34(1): 15-46 (2004) - [c16]Sebastian Danicic, Andrea De Lucia, Mark Harman:
Building Executable Union Slices using Conditioned Slicing. IWPC 2004: 89-99 - [c15]David W. Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Lahcen Ouarbya:
Formalizing Executable Dynamic and Forward Slicing. SCAM 2004: 43-52 - 2003
- [j10]Mark Harman, David W. Binkley, Sebastian Danicic:
Amorphous program slicing. J. Syst. Softw. 68(1): 45-64 (2003) - [j9]Keith B. Gallagher, Mark Harman, Sebastian Danicic:
Guaranteed inconsistency avoidance during software evolution. J. Softw. Maintenance Res. Pract. 15(6): 393-416 (2003) - [j8]Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd:
Equivalence of conservative, free, linear program schemas is decidable. Theor. Comput. Sci. 290(1): 831-862 (2003) - 2002
- [c14]Mark Harman, Lin Hu, Robert M. Hierons, Chris Fox, Sebastian Danicic, Joachim Wegener, Harmen Sthamer, André Baresel:
Evolutionary Testing Supported by Slicing and Transformation. ICSM 2002: 285 - [c13]Mark Harman, Chris Fox, Robert M. Hierons, Lin Hu, Sebastian Danicic, Joachim Wegener:
VADA: A Transformation-Based System for Variable Dependence Analysis. SCAM 2002: 55-64 - [c12]Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya:
An Interprocedural Amorphous Slicer for WSL. SCAM 2002: 105-114 - [c11]Mohammed Daoudi, Lahcen Ouarbya, John Howroyd, Sebastian Danicic, Mark Harman, Chris Fox, Martin P. Ward:
ConSUS: A Scalable Approach to Conditioned Slicing. WCRE 2002: 109-118 - [c10]Lahcen Ouarbya, Sebastian Danicic, Mohammed Daoudi, Mark Harman, Chris Fox:
A Denotational Interprocedural Program Slicer. WCRE 2002: 181- - 2001
- [c9]Mark Harman, Robert M. Hierons, Chris Fox, Sebastian Danicic, John Howroyd:
Pre/Post Conditioned Slicing. ICSM 2001: 138-147 - [c8]Chris Fox, Sebastian Danicic, Mark Harman, Robert M. Hierons:
Backward Conditioning: A New Program Specialisation Technique and Its Application to Program Comprehension. IWPC 2001: 89-97 - [c7]Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox:
Node Coarsening Calculi for Program Slicing. WCRE 2001: 25-34 - 2000
- [c6]Chris Fox, Mark Harman, Robert M. Hierons, Sebastian Danicic:
ConSIT: A Conditioned Program Slicer. ICSM 2000: 216- - [c5]Sebastian Danicic, Mark Harman:
Espresso: A Slicer Generator. SAC (2) 2000: 831-839
1990 – 1999
- 1999
- [j7]Robert M. Hierons, Mark Harman, Sebastian Danicic:
Using Program Slicing to Assist in the Detection of Equivalent Mutants. Softw. Test. Verification Reliab. 9(4): 233-262 (1999) - [c4]Mark Harman, Chris Fox, Robert M. Hierons, David W. Binkley, Sebastian Danicic:
Program Simplification as a Means of Approximating Undecidable Propositions. IWPC 1999: 208-217 - 1998
- [j6]Mark Harman, Sebastian Danicic:
A new algorithm for slicing unstructured programs. J. Softw. Maintenance Res. Pract. 10(6): 415-441 (1998) - [c3]Mark Harman, Yoga Sivagurunathan, Sebastian Danicic:
Analysis of Dynamic Memory Access Using Amorphous Slicing. ICSM 1998: 336- - 1997
- [c2]Yoga Sivagurunathan, Mark Harman, Sebastian Danicic:
Slicing, I/O and the Implicit State. AADEBUG 1997: 59-68 - [c1]Mark Harman, Sebastian Danicic:
Amorphous Program Slicing. WPC 1997: 70-79 - 1996
- [j5]Mark Harman, Dan Simpson, Sebastian Danicic:
Slicing Programs in the Presence of Errors. Formal Aspects Comput. 8(4): 490-497 (1996) - 1995
- [j4]Sebastian Danicic, Mark Harman, Yoga Sivagurunathan:
A Parallel Algorithm for Static Program Slicing. Inf. Process. Lett. 56(6): 307-313 (1995) - [j3]Mark Harman, Sebastian Danicic:
Using Program Slicing to Simplify Testing. Softw. Test. Verification Reliab. 5(3): 143-162 (1995) - 1993
- [j2]Mark Harman, Sebastian Danicic:
Projecting Functional Models of Imperative Programs. ACM SIGPLAN Notices 28(11): 33-41 (1993)
1980 – 1989
- 1987
- [j1]G. R. Perkins, R. W. Norman, Sebastian Danicic:
Coping with deeply nested control structures. ACM SIGPLAN Notices 22(2): 68-77 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
