Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2109987256
@@ Property / OpenAlex ID: W2109987256 / rank @@
+Normal rank
@@ Property / cites work @@
+Translating Program Schemas to While-Schemas
@@ Property / cites work: Translating Program Schemas to While-Schemas / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
+Normal rank
@@ Property / cites work @@
+Theory of program structures: Schemes, semantics, verification
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Program Scheme Equivalence
+Normal rank
@@ Property / cites work @@
+Q5517672
@@ Property / cites work: Q5517672 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas
+Normal rank
@@ Property / cites work @@
+Q4124327
@@ Property / cites work: Q4124327 / rank @@
+Normal rank
@@ Property / cites work @@
+On Ianov's Program Schemata
@@ Property / cites work: On Ianov's Program Schemata / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm deciding functional equivalence in a new class of program schemes
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:624386