Sebastian Danicic

Available identifiers

Publication	Date of Publication	Type
Complexity of Data Dependence Problems for Program Schemas with Concurrency	2015-09-17	Paper
On the computational complexity of dynamic slicing problems for program schemas	2011-12-08	Paper
A unifying theory of control dependence and its application to arbitrary program structures	2011-12-07	Paper
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas	2011-12-02	Paper
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas	2011-02-09	Paper
A trajectory-based strict semantics for program slicing	2010-03-29	Paper
A non-standard semantics for program slicing and dependence analysis	2007-08-10	Paper
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time	2007-04-13	Paper
A formal relationship between program slicing and partial evaluation	2006-10-25	Paper
A formalisation of the relationship between forms of program slicing	2006-10-05	Paper
Theoretical foundations of dynamic program slicing	2006-09-14	Paper
Equivalence of conservative, free, linear program schemas is decidable	2003-01-21	Paper
Slicing programs in the presence of errors	1997-03-03	Paper
A parallel algorithm for static program slicing	1997-02-28	Paper

This page was built for person: Sebastian Danicic