|
This article is cited in 3 scientific papers (total in 3 papers)
Hardware, software and distributed supercomputer systems
The JaSpe specializer: BT-objects and the interprocedural aspect of the binding-time analysis algorithm
I. A. Adamovich Ailamazyan Program Systems Institute of Russian Academy of Sciences
Abstract:
This paper is devoted to partial evaluations that use the offline strategy.
The power of this method for solving the problem of program specialization
depends mainly on the binding-time analysis, which annotates the program
constructs as either executable or not executable at the stage of specialization.
The binding-time analysis can use several variants of the annotation of the
class fields, depending on their use in the program. Increasing the number of
additional optimizations, this class polyvariance allows more programs to be
specialized effectively. The better effect is achieved during the specialization of
object-oriented programs, involving the creation of many class instances with
different purposes.
Known algorithms for the binding-time analysis are extended to be class
polyvariant and applied to a general-purpose, object-oriented language. The new
methods are implemented as plugins for the Eclipse IDE. The plugins form the
JaSpe specializer for Java programs.
Key words and phrases:
modern programming languages, static program analysis, program
transformation, metacomputations, mixed computations, interactive specialization.
Received: 08.11.2021 Accepted: 01.12.2021
Citation:
I. A. Adamovich, “The JaSpe specializer: BT-objects and the interprocedural aspect of the binding-time analysis algorithm”, Program Systems: Theory and Applications, 12:4 (2021), 3–32
Linking options:
https://www.mathnet.ru/eng/ps387 https://www.mathnet.ru/eng/ps/v12/i4/p3
|
Statistics & downloads: |
Abstract page: | 69 | Full-text PDF : | 36 | References: | 13 |
|