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 9 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)
- Decidability of equivalence in the set of program schema with monotonic and partially commutative operators (Q1183814) (← links)
- On the decidability of the equivalence problem for orthogonal sequential programs (Q1592932) (← links)
- A polynomial-time algorithm that recognizes the commutative equivalence of program schemata (Q1594177) (← links)
- Theoretical foundations of dynamic program slicing (Q2503318) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)