Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales

DOI10.3103/S0278641912040061MaRDI QIDQ357923zbMATH OpenOpenAlexFDO

Authors V. V. Podymov

Publication date 15 August 2013

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0278641912040061

zbMATH Keywords

semigroupsequivalence testrecursive programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Algebraic theory of languages and automata (68Q70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• On the effective solvability of the problem of the equivalence of linear unary recursive programs.
• Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales
• Program equivalence in linear contexts
• Efficient equivalence-checking algorithms for procedural programs in progressive semigroup gateway models
• scientific article; zbMATH DE number 3887686
• On the polynomial complexity of the equivalence checking problem in algebraic models of programs
• An algorithm deciding functional equivalence in a new class of program schemes
• On the decidability of the equivalence problem for orthogonal sequential programs
• A polynomial-time algorithm that recognizes the commutative equivalence of program schemata
• On an equivalence checking technique for algebraic models of programs

Cites work

• Decidable Properties of Monadic Functional Schemas
• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• On the effective solvability of the problem of the equivalence of linear unary recursive programs.
• Program schemes, recursion schemes, and formal languages

Cited in

(3)

• Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales
• On the effective solvability of the problem of the equivalence of linear unary recursive programs.
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs

This page was built for publication: Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales

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