The problem of equivalence in commutative s-models for programs
From MaRDI portal
A special type of program model, s-models, is examined. Sufficient criteria that the equivalence of the program schemes can be established are found for these models. That equivalence which can be established is proved for two new situations through the use of these criteria. Each of these situations is covered by a broad class of models.
Recommendations
- An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements
- On an equivalence checking technique for algebraic models of programs
- The equivalence problem and correctness formulas for a simple class of programs
- scientific article; zbMATH DE number 3883587
- Halting and equivalence of program schemes in models of arbitrary theories
- scientific article; zbMATH DE number 3846863
- Equivalences among logics of programs
- Equivalent transformations in the model of programs with commuting and monotone operators
- scientific article; zbMATH DE number 3970089
- Calculus of equivalences of abstract programs
Cited in
(5)- Investigating s-model programs for the purpose of reducing them to canonical form
- Approximability of some program models by others
- An abstract equivalence notion for object models
- An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements
- scientific article; zbMATH DE number 862230 (Why is no real title available?)
This page was built for publication: The problem of equivalence in commutative s-models for programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111006)
