Pages that link to "Item:Q912596"
From MaRDI portal
The following pages link to An algorithm deciding functional equivalence in a new class of program schemes (Q912596):
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)
- Equivalence of conservative, free, linear program schemas is decidable (Q1853616) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs (Q4508638) (← links)
