The following pages link to Sebastian Danicic (Q624384):
Displaying 14 items.
- Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386) (← links)
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← links)
- A unifying theory of control dependence and its application to arbitrary program structures (Q650921) (← links)
- A parallel algorithm for static program slicing (Q672833) (← links)
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- A trajectory-based strict semantics for program slicing (Q960858) (← links)
- A non-standard semantics for program slicing and dependence analysis (Q997995) (← links)
- Slicing programs in the presence of errors (Q1815347) (← links)
- Equivalence of conservative, free, linear program schemas is decidable (Q1853616) (← links)
- A formal relationship between program slicing and partial evaluation (Q2432231) (← links)
- Theoretical foundations of dynamic program slicing (Q2503318) (← links)
- A formalisation of the relationship between forms of program slicing (Q2507782) (← links)
- Complexity of Data Dependence Problems for Program Schemas with Concurrency (Q2946663) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)
