|
|
 |
• Содержание выпуска •
• Supercomputing Software and Hardware •
• Healthcare Information Systems •
• Mathematical Foundations of Programming •
• Methods for Optimal Control and Control Theory •
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
/r1/pdf.jpg) .
|
Article #
32_2022
27
p.
/r2/pdf.jpg)
PDF |
submitted on 02th Nov 2022 displayed on
website on 05th Dec
2022
Igor A.
Adamovich, Yuri A. Klimov
Efficiency Investigation of BT-Object Based Partial Evaluation of
Interpreters Written in the Java Object-Oriented Language
Barriers of real object-oriented program specialization can be
often overcome using modern metacomputation techniques. One of the
barriers is the resolution of polymorphism at the stage of program
analysis before the execution of the program. The last problem is
successfully solved for a number of cases in the JaSpe specializer,
as shown in this paper. The paper is devoted to the program
compilation by specialization methods, without the use of a
compiler. We have applied the partial evaluator JaSpe to two
arithmetic expression language interpreters written in Java. The
interpreters were implemented using the recursive descent method and
the visitor pattern. As a result of the successful specialization of
these interpreters by the square root program written on arithmetic
expression language, compiled versions of the latter were obtained.
In this case, the acceleration was from 12 to 22 times. (In
Russian).
Key words: interpreters, compilers, partial evaluation,
specialization, metacomputations.
|
|
article citation |
http://psta.psiras.ru/read/psta2022_4_111-137.pdf |
|
DOI |
https://doi.org/10.25209/2079-3316-2022-13-4-111-137 |
|
Article #
34_2022
17
p.
PDF |
submitted on 14th Oct 2022 displayed on
website on 10th Nov
2022
Iurii M. Smetanin
Front-end algorithm for
solving the SAT problem
The algorithm for calculating the semantic value of
conjunctive formulas of the form U = F(X1, X2,
..., Xn) in non-classical propositional logic LS₂
[1–3] also calculates the set of all solutions of the logical
equation
F(x1, x2, ..., xn)
= 1,
Where F(X1, X2, ..., Xn)
— a formula of Boolean algebra of the sets making a discrete Venn
diagram. The elements of these sets are non-negative integers. Based
on this algorithm, a new algorithm is built to solve the SAT
problem. A significant difference between it and a family of
algorithms based on DPLL and CDCL is the replacement
of Boolean variables with sets. This allows you to effectively check
the feasibility of not one, but many sets of values of the logical
variables x1, x2,
..., xn.
(In Russian).
Key words: non-classical propositional logic based on a model
with non-degenerate Boolean algebra, calculus of discrete Venn
diagrams, problem SAT. |
|
article citation |
http://psta.psiras.ru/read/psta2022_4_163-179.pdf |
|
DOI |
https://doi.org/10.25209/2079-3316-2022-13-4-163-179 |
• Содержание выпуска •
• Supercomputing Software and Hardware •
• Healthcare Information Systems •
• Mathematical Foundations of Programming •
• Methods for Optimal Control and Control Theory •
|
 |
|
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
©
Electronic Scientific Journal "Program Systems: Theory and
Applications" 2010-2017
© Organization of Russian Academy of Sciences Program Systems
Institute of RAS (PSI RAS) 2010-2022
 |
|
