Proving Properties of Programs on Hierarchical Nominative Data

Proving Properties of Programs on Hierarchical Nominative Data

In the paper we develop methods for proving properties of programs on hierarchical nominative data on the basis of the composition-nominative approach. In accordance with this approach, the semantics of a program is a function on nominative data constructed from basic operations using composition...

Full description

Bibliographic Details
Main Authors: Ievgen Ivanov, Mykola Nikitchenko, Volodymyr G. Skobelev
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2016-12-01
Series:Computer Science Journal of Moldova
Subjects:
Programming language semantics
algorithmic algebras
nominative data
composition
Friedman scheme
Online Access:http://www.math.md/files/csjm/v24-n3/v24-n3-(pp371-398).pdf

Similar Items

Similar Items