No label defined (Q4040207)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 193386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 193386 |
Statements
5 June 1993
0 references
analysis of algorithms
0 references
transformation of algorithms
0 references
computational complexity
0 references
block schemes
0 references
program optimization
0 references
programming automization
0 references
optimizing compilation
0 references
optimizing transformations
0 references
0.7837426662445068
0 references
0.7794103026390076
0 references
0.7676140666007996
0 references
0.7224429845809937
0 references
Optimizing transformations (OT) are effective tools for working out high-quality programs. The book consists of 11 chapters which are organized in the 3 parts: Part 1: Mathematical instruments for program optimization, particularly elements of graph theory and theory of computational complexity of algorithms; main concepts and characteristics of operator model of program; abstract model of computer; methods of algorithm investigation, classes of large-block schemes (particularly Martynyuk's schemes) are considered. Part 2: OT-systems and its correctness, completeness and complexity are investigated. This part consists of the summary of the main concepts of program optimization, the methods and algorithms of control-flow in the program are considered; OT of programs, algorithms of global optimization of the whole program are studied. Part 3: OT-applications for programming automatization, optimizing compilation are considered (for ALFA, FOREKS, PL/1L translators).
0 references