On the decidability of the equivalence problem for orthogonal sequential programs

DOI10.1023/A:1009954232570MaRDI QIDQ1592932zbMATH OpenOpenAlexFDO

Authors Vladimir A. Zakharov

Publication date 16 January 2001

Published in Grammars (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009954232570

zbMATH Keywords

orthogonal substitutions

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Semantics in the theory of computing (68Q55)

Recommendations

• On the Decidability of the Equivalence Problem for Monadic Recursive Programs
• Decidable subcases of the equivalence problem for recursive program schemes
• Implementation and Application of Automata
• Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales
• Equivalence of conservative, free, linear program schemas is decidable

Cited in

(5)

• Implementation and Application of Automata
• Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales
• Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs
• Program equivalence checking by two-tape automata

This page was built for publication: On the decidability of the equivalence problem for orthogonal sequential programs

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