On Ianov's Program Schemata
From MaRDI portal
Publication:5732102
DOI10.1145/321203.321204zbMath0121.12107OpenAlexW2074864221MaRDI QIDQ5732102
Publication date: 1964
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321203.321204
Related Items
Verification and comparison of transition systems, Unnamed Item, Flowchart machines, Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas, Equivalence of free Boolean graphs can be decided probabilistically in polynomial time, Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism, Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas, A survey of state vectors, Program schemata technique for propositional program logics: a 30-year history, On optimization of numerical algorithms, Program schemata as automata. I, Using algebraic models of programs for detecting metamorphic malwares, Monadic recursion schemes: The effect of constants, Some definitional suggestions for automata theory, Regular expressions and the equivalence of programs, Parallel program schemata, On formalised computer programs, On the computational complexity of dynamic slicing problems for program schemas, A note on infinite trees, On program schemata equivalence, The common algebraic structure of exit-automata and machines, On self-modifying programs, \(L(A)=L(B)\)? decidability results from complete formal systems, The complexity of monadic recursion schemes: Exponential time bounds, On the Decidability of the Equivalence Problem for Monadic Recursive Programs, Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
