On formalised computer programs

DOI10.1016/S0022-0000(70)80022-8MaRDI QIDQ2543556zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3229496 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• On Ianov's Program Schemata

Cited in

(61)

• Computability of String Functions Over Algebraic Structures Armin Hemmerling
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs
• Effective proper procedures and universal classes of program schemata
• Una classe di schemi ricorsivi non-deterministici paralleli
• On approximate and algebraic computability over the real numbers
• Equivalence of conservative, free, linear program schemas is decidable
• Modifications of the program scheme model
• Automaton semigroup models of programs
• An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
• Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
• Formal system of definition of data sets as a high-level tool of data extraction
• Characterization of flowchartable recursions
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Programs as partial graphs. I: Flow equivalence and correctness
• Observations on the complexity of regular expression problems
• The independence of control structures in abstract programming systems
• The totality problem for program schemas
• On the computational complexity of dynamic slicing problems for program schemas
• On program schemata equivalence
• Some applications of topology to program semantics
• Equational theories of abnormal termination based on Kleene algebra
• The logic-termal equivalence is polynomial-time decidable
• Parallel operator schemata over variable arrays and the maximal parallelism problem
• First order data types and first order logic
• The equivalence problem of multidimensional multitape automata
• A survey of state vectors
• The IO- and OI-hierarchies
• Solution of the generalized minimization problem for two-tape automata with one fixed tape
• On the non-compactness of the class of program schemas
• Minimality and deadlockness of multitape automata
• scientific article; zbMATH DE number 3567992 (Why is no real title available?)
• John McCarthy (1927--2011)
• Program equivalence checking by two-tape automata
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• The functional dimension of inductive definitions
• The applicability of program schema results to programs
• Computing on structures
• Äquivalente Transformationen für Flußdiagramme
• Completeness results for the equivalence of recursive schemas
• Execution traces and programming-language semantics
• Inference rules for proving the equivalence of recursive procedures
• scientific article; zbMATH DE number 3448088 (Why is no real title available?)
• An algorithm deciding functional equivalence in a new class of program schemes
• Necessary and sufficient conditions for the universality of programming formalisms
• Program schemata and the first-order decision problem
• Program schemata as automata. I
• Program schemata with polynomial bounded counters
• The computational complexity of program schemata
• Synthesis of strategies using the Hoare logic of angelic and demonic nondeterminism
• On self-modifying programs
• Program equivalence and context-free grammars
• Monadic recursion schemes: The effect of constants
• Program transformations and algebraic semantics
• A view of computability on term algebras
• Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
• Definability by programs in first-order structures
• Function iteration logics and flowchart schemata
• Equivalences on program schemes
• Inference rules for proving the equivalence of recursive procedures
• Program schemes, recursion schemes, and formal languages
• Finiteness is mu-ineffable

This page was built for publication: On formalised computer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2543556)