Algebraic-grammatical specifications and synthesis of structured program schemas

Yushchenko, E. L.; Tseitlin, G. E.; Galushka, A. V.

doi:10.1007/bf01069770

Cited by 5 publications

(5 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algebraic facilities for generation of algorithm schemes are based on SAA and the abstract automaton model of the parameter-driven text generator [1,6]. The generator works according to a feedback principle (see Fig.…”

Section: Methodsmentioning

confidence: 99%

“…The specifies the generation method for all operations of the algebra of hyperschemes and is defined in detail in [6].…”

Section: Methodsmentioning

confidence: 99%

“…The purpose of the work is to apply algorithm algebra and hyperschemes [1,6] for the parameter-driven generation of an evaluation program for a sample neuroevolution problem.…”

Section: Nomenclaturementioning

confidence: 99%

“…The problem consists in designing a high-level parameterized specification in the algebra of hyperschemes [1,6] that is applied to generate classes of evaluation schemes for a binary multiplexer (Binary MultiplexerEvaluator) example [4] depending on the multiplexer parameters, followed by the automated synthesis of code in C# language for the SharpNEAT framework.…”

Section: Problem Statementmentioning

confidence: 99%

“…The peculiar feature of our approach to program generation consists in using algebra of algorithms and hyperschemes [6]. Algorithms and programs are constructed using high-level algebra-algorithmic schemes represented in a natural linguistic form.…”

Section: Problem Statementmentioning

confidence: 99%

See 4 more Smart Citations

Parameter-Driven Generation of Evaluation Program for a Neuroevolution Algorithm on a Binary Multiplexer Example

Doroshenko

Achour

Yatsenko

2023

RIC

View full text Add to dashboard Cite

Context. The problem of automated development of evaluation programs for the neuroevolution of augmenting topologies. Neuroevolution algorithms apply mechanisms of mutation, recombination, and selection to find neural networks with behavior that satisfies the conditions of a certain formally defined problem. An example of such a problem is finding a neural network that implements a certain digital logic. Objective. The goal of the work is the automated design and generation of an evaluation program for a sample neuroevolution problem (binary multiplexer). Method. The methods and tools of Glushkov’s algebra of algorithms and hyperscheme algebra are applied for the parameterdriven generation of a neuroevolution evaluation program for a binary multiplexer. Glushkov’s algebra is the basis of the algorithmic language intended for multilevel structural design and documentation of sequential and parallel algorithms and programs in a form close to a natural language. Hyperschemes are high-level parameterized specifications intended for solving a certain class of problems. Setting parameter values and subsequent interpretation of hyperschemes allows obtaining algorithms adapted to specific conditions of their use. Results. The facilities of hyperschemes were implemented in the developed integrated toolkit for the automated design and synthesis of programs. Based on algorithm schemes, the system generates programs in a target programming language. The advantage of the system is the possibility of describing algorithm schemes in a natural-linguistic form. An experiment was conducted consisting in the execution of the generated program for the problem of evaluating a binary multiplexer on a distributed cloud platform. The multiplexer example is included in SharpNEAT, an open-source framework that implements the genetic neuroevolution algorithm NEAT for the .NET platform. The parallel distributed implementation of the SharpNEAT was proposed in the previous work of the authors. Conclusions. The conducted experiments demonstrated the possibility of the developed distributed system to perform evaluations on 64 cloud clients-executors and obtain an increase in 60–100% of the maximum capabilities of a single-processor local implementation.

show abstract

Section: Methodsmentioning

confidence: 99%

“…The specifies the generation method for all operations of the algebra of hyperschemes and is defined in detail in [6].…”

Section: Methodsmentioning

confidence: 99%

“…The purpose of the work is to apply algorithm algebra and hyperschemes [1,6] for the parameter-driven generation of an evaluation program for a sample neuroevolution problem.…”

Section: Nomenclaturementioning

confidence: 99%

Section: Problem Statementmentioning

confidence: 99%

Section: Problem Statementmentioning

confidence: 99%

See 3 more Smart Citations