Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
From MaRDI portal
Publication:624386
DOI10.1016/j.jlap.2010.08.001zbMath1209.68136OpenAlexW2109987256MaRDI QIDQ624386
Michael R. Laurence, Sebastian Danicic, Robert M. Hierons
Publication date: 9 February 2011
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://research.gold.ac.uk/2448/1/lin.f.near.l.pdf
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
- An algorithm deciding functional equivalence in a new class of program schemes
- Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas
- Theory of program structures: Schemes, semantics, verification
- Translating Program Schemas to While-Schemas
- On the Computational Complexity of Program Scheme Equivalence
- On Ianov's Program Schemata
This page was built for publication: Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas