Ludmila O. Axiomatic Systems of Specifications of Programs over Nominative Data

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0407U001656

Thesis Registration Form

0407U001656.pdf

Applicant for

Specialization

  • 01.05.01 - Теоретичні основи інформатики та кібернетики

05-04-2007

Specialized Academic Board

Д 26.001.09

Taras Shevchenko National University of Kyiv

Essay

Imperative and declarative models of programs based on composition-nominative approach are constructed and investigated. A special computability considered in this paper is nominative computability. At the same time nominative computability is invariant relative to a set of basic elements. An axiomatic theory of nominative data, which is capable to specify all computable functions, is constructed. A prototype of axiomatic system of specifications of programs over nominative data is constructed.

Read more

Files

Dis.doc

aref.doc

Similar theses

0421U102388

Nasirov Emil Mekhdiievych

Parallelization of non-negative huge sparse linguistic matrix and tensors factorization

0420U102355

Dudar Vyacheslav Vyacheslavovych

Training algorithms and invariance to geometric transformations of neural networks

0520U101700

Prytomanova Olga M.

Fuzzy problems of optimal set partitioning: theoretical bases, methods and algorithms for solving

0520U100242

Zavadskyi Ihor O.

Splittable codes and their applications

0520U100209

Rystsov Ihor

Application of algebraic automata theory to analysis of discrete dynamical systems.