PROGRAM SYSTEMS: THEORY AND APPLICATIONS

12+

Online Scientific Journal published by the Ailamazyan Program Systems Institute of the Russian Academy of Sciences

Papers are accepted in the form of a PDF file

To view the PDF files, you will need Adobe Acrobat Reader

• Содержание выпуска •
• Software and Hardware for Distributed Systems and Supercomputers •
• Mathematical Foundations of Programming •
• Methods for Optimal Control and Control Theory •
• Artificial Intelligence, Intelligence Systems, Neural Networks •
• Supercomputing Software and Hardware •

Mathematical Foundations of Programming

Responsible for the Section: doctor of physico-mathematical Sciences Nikolay Nepeivoda

On the left: assigned number of the paper, submission date, the number of A5 pages contained in the paper, and the reference to the full-text PDF .

Article # 32_2015 69 p. PDF	submitted on 05th Oct 2015 displayed on website on 02th Nov 2015 Aleksey Burtsev, Sergey Sidorov Ternary virtual machine and ternary DSSP In research laboratory of ternary informatics leaded by Brusentsov N. P. at the Computer Science (CS) department of the Moscow State University (MSU) the ternary virtual machine (TVM) and cross-system (DSSP- TVM) for development of programs for it using the DSSP-T language are created (during the period from 2010 to 2013). Ternary virtual machine (TVM) is a simulator of ternary computer, which architecture has two stacks (data stack and control stack) and machine commands for structured programming like "Setun-70".Two variants of Dialogue System of Structured Programming (DSSP) for TVM have been constructed. DSSP-TVM lets it possible to create DSSP-program for TVM by means of cross-compiler. DSSP/TVM is a dialogue interpreter, which can run on TVM as its resident software. Programming language DSSP-T used in both systems is a ternary version of language of the DSSP. The architecture of the TVM ternary processor and its instructions system, the main lines of the DSSP-T language and possibilities of the development environment DSSP-TVM are presented in article, and also some problem aspects of realization of the TVM simulator, a cross compiler of the DSSP-T language and the DSSP/TVM dialogue interpreter for the specific ternary computer are explained. (In Russian). Key words: ternary computer, simulation model, TVM, DSSP, structured programming, threaded code.
article citation	http://psta.psiras.ru/read/psta2015_4_29-97.pdf
DOI	https://doi.org/10.25209/2079-3316-2015-6-4-29-97
Article # 42_2015 28 p. PDF	submitted on 17th Nov 2015 displayed on website on 23th Dec 2015 Sergei Meshveliani Programming basic computer algebra in a language with dependent types It is described the experience in provable programming of certain classical categories of computational algebra (“group”, “ring”, and so on) basing on the approach of intuitionism, a language with dependent types, forming of machinechecked proofs. There are detected the related problems, and are described certain additional possibilities given by the approach. The Agda functional language is used as an instrument. This paper is a continuation for the introductory paper published in this journal in 2014. (In Russian) Key words: constructive mathematics, algebra, dependent types, functional programming, Agda.
article citation	http://psta.psiras.ru/read/psta2015_4_313-340.pdf
DOI	https://doi.org/10.25209/2079-3316-2015-6-4-313-340
Article # 43_2015 11 p. PDF	submitted on 10th Nov 2015 displayed on website on 23th Dec 2015 Antonina Nepeivoda A remark about long attacks on ping-pong protocols The paper presents some long attacks on cryptographic ping-pong protocols in the Dolev–Yao intruder model. The length of these attacks reaches the upper bound on the attack length proven in the previous works of the author. (In Russian). Key words: Computational complexity, ping-pong protocols, protocol security, Dolev-Yao intruder model
article citation	http://psta.psiras.ru/read/psta2015_4_341-351.pdf
DOI	https://doi.org/10.25209/2079-3316-2015-6-4-341-351
Article # 44_2015 6 p. PDF	submitted on 08th Dec 2015 displayed on website on 23th Dec 2015 Aleksey Demidov Computing capabilities of crystals The work is devoted to investigation from the standpoint of quantum physics the possibility of using the scattering of a beam of light on crystals for calculations. There is proposed a model of computation, corresponding the transformation of the light beam as it passes through the crystal, and provided the necessary formulas for the calculation of the model. It is necessary to emphasize the abstract nature of the research, which is aimed at creation of the theoretical basis for further study of the produced algebraic structures, rather than the construction of a real device — a quantum computer or the like. The work carried out by the program of creation of algebraic computer [1]. (In Russian). Key words: parallel computing, programm algebras, quantum optics.
article citation	http://psta.psiras.ru/read/psta2015_4_353-358.pdf
DOI	https://doi.org/10.25209/2079-3316-2015-6-4-353-358
Article # 45_2015 8 p. PDF	submitted on 01th Dec 2015 displayed on website on 24th Dec 2015 Kochurov E.V. Logic of constructions on graphs within application to business process execution This article introduces the approach to the execution of business processes based on the logic synthesis of programs for business process models. The approach uses logic of constructions on graphs GL5. (In Russian). Key words: constructive logic, constrictions on graphs, business process modeling.
article citation	http://psta.psiras.ru/read/psta2015_4_359-366.pdf
DOI	https://doi.org/10.25209/2079-3316-2015-6-4-359-366

Adress: Ailamazyan Program Systems Institute of the Russian Academy of Sciences, PSTA Online Journal, 4 a Peter the First Street,
Veskovo village, Pereslavl area, Yaroslavl region, 152021 Russia
Phone: +7-4852-695-228. E-mail: info@psta.psiras.ru. Website: http://psta.psiras.ru