Pages that link to "Item:Q1853616"
From MaRDI portal
The following pages link to Equivalence of conservative, free, linear program schemas is decidable (Q1853616):
Displaying 5 items.
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← 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)
- Theoretical foundations of dynamic program slicing (Q2503318) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)
