Technique of traces in solving the equivalence problem in algebraic program models
From MaRDI portal
Publication:844347
DOI10.1007/S10559-009-9139-8zbMATH Open1185.68420OpenAlexW2078464192MaRDI QIDQ844347FDOQ844347
Authors: R. I. Podlovchenko
Publication date: 19 January 2010
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-009-9139-8
Recommendations
- On an equivalence checking technique for algebraic models of programs
- On a class of algebraic models of programs of practical interest
- On the polynomial complexity of the equivalence checking problem in algebraic models of programs
- A case of insolubility of the problem of equivalence of programs
- Studies in the theory of algebraic models of programs with procedures
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)
Cites Work
Cited In (7)
- On a class of algebraic models of programs of practical interest
- Tracks of relations and equivalences-based reasoning
- On the polynomial complexity of the equivalence checking problem in algebraic models of programs
- Complete systems of equivalent transformations in balanced semigroup models of programs with left cancellation
- On an equivalence checking technique for algebraic models of programs
- Program equivalence checking by two-tape automata
- A case of insolubility of the problem of equivalence of programs
This page was built for publication: Technique of traces in solving the equivalence problem in algebraic program models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844347)