Pages that link to "Item:Q875512"
From MaRDI portal
The following pages link to Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512):
Displaying 6 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)
- 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)
- Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas (Q997992) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)
