On formalised computer programs

From MaRDI portal
Publication:2543556

DOI10.1016/S0022-0000(70)80022-8zbMath0209.18704OpenAlexW2010927194MaRDI QIDQ2543556

Yanyan Li

Publication date: 1970

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(70)80022-8




Related Items

Automaton semigroup models of programsEfficient Equivalence Checking Technique for Some Classes of Finite-State MachinesMinimality and deadlockness of multitape automataUnnamed ItemSolution of the generalized minimization problem for two-tape automata with one fixed tapeFirst order data types and first order logicProgram schemes, recursion schemes, and formal languagesThe logic-termal equivalence is polynomial-time decidableJohn McCarthy (1927--2011)Observations on the complexity of regular expression problemsThe independence of control structures in abstract programming systemsAn algorithm deciding functional equivalence in a new class of program schemesSynthesis of Strategies Using the Hoare Logic of Angelic and Demonic NondeterminismThe IO- and OI-hierarchiesA survey of state vectorsPrograms as partial graphs. I: Flow equivalence and correctnessEquational Theories of Abnormal Termination Based on Kleene AlgebraDefinability by programs in first-order structuresProgram equivalence checking by two-tape automataComputing on structuresUnnamed ItemInference rules for proving the equivalence of recursive proceduresThe functional dimension of inductive definitionsComputability of String Functions Over Algebraic Structures Armin HemmerlingThe equivalence problem of multidimensional multitape automataProgram schemata and the first-order decision problemProgram schemata as automata. IProgram schemata with polynomial bounded countersInference Rules for Proving the Equivalence of Recursive ProceduresSome applications of topology to program semanticsProgram equivalence and context-free grammarsThe computational complexity of program schemataFormal system of definition of data sets as a high-level tool of data extractionFunction iteration logics and flowchart schemataThe applicability of program schema results to programsCompleteness results for the equivalence of recursive schemasFiniteness is mu-ineffableEffective proper procedures and universal classes of program schemataAn improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machinesUna classe di schemi ricorsivi non-deterministici paralleliÄquivalente Transformationen für FlußdiagrammeProgram transformations and algebraic semanticsModifications of the program scheme modelParallel operator schemata over variable arrays and the maximal parallelism problemMonadic recursion schemes: The effect of constantsExecution traces and programming-language semanticsOn the non-compactness of the class of program schemasEquivalences on program schemesOn the computational complexity of dynamic slicing problems for program schemasSubrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problemsOn program schemata equivalenceCharacterization of flowchartable recursionsOn approximate and algebraic computability over the real numbersOn self-modifying programsA view of computability on term algebras\(L(A)=L(B)\)? decidability results from complete formal systemsThe totality problem for program schemasEquivalence of conservative, free, linear program schemas is decidableNecessary and sufficient conditions for the universality of programming formalismsOn the Decidability of the Equivalence Problem for Monadic Recursive ProgramsSome thoughts on computational models: from massive human computing to abstract state machines, and beyond



Cites Work