z-logo
open-access-imgOpen Access
About Algebraic Program Models with Procedures
Author(s) -
Р. И. Подловченко,
Андрей Эрикович Молчанов
Publication year - 2015
Publication title -
modelirovanie i analiz informacionnyh sistem
Language(s) - English
Resource type - Journals
eISSN - 2313-5417
pISSN - 1818-1015
DOI - 10.18255/1818-1015-2012-5-100-114
Subject(s) - equivalence (formal languages) , decidability , algebraic number , algebra over a field , computer science , point (geometry) , class (philosophy) , mathematics , theoretical computer science , calculus (dental) , discrete mathematics , pure mathematics , artificial intelligence , medicine , mathematical analysis , geometry , dentistry
Algebraic program models with procedures are designed to analyze program semantic properties on their models called program schemes. The concepts that give foundation to the theory of such models are stated along with a description of their implementation. The key point of the theory is the equivalence of program schemes that belong to a particular model. A class of special algebraic models with procedures, called gateway models, is studied. Necessary and sufficient conditions of the equivalence problem decidability in such models are proposed.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here