Cited By
View all- Pratt T(2019)Program analysis and optimization through kernel-control decompositionActa Informatica10.1007/BF002888829:3(195-216)Online publication date: 2-Jan-2019
Four models for the analysis and optimization of program control structures
Pages 167 - 176
Abstract
The analysis of the relation between the structure of a program and the function that it computes requires a decomposition of the program into its components. Traditionally this decomposition has been based on the common division of a program into subprograms, and ultimately into statements, expressions and individual variables and constants. In this paper an alternative decomposition is proposed that is based on the decomposition of a program into a set of kernel elements, those program elements that participate in the direct computation of the outputs of the program, and a set of control elements, those elements that participate in the determination of the execution path. The kernel-control decomposition of a program leads to a series of progressively more abstract program representations, each of which has both theoretical and practical interest. The separation of control structure from kernel and the three abstract models presented here, which are based on this decomposition, are particularly valuable in the analysis and optimization of program control structures. This research summary outlines the major results, which will be reported in full in a journal article.
References
[1]
Elspas, B., Levitt, K., Waldinger, R., and Waksman, A. "An assessment of techniques for proving program correctness", Computing Surveys, 4, 2, June 1972, 97-147.
[2]
Pratt, T. "Case descriptions of programs: An informal introduction", University of Texas Computation Center Report TSN-32, October 1972, 48 pp.
[3]
Moriconi, M. "Semiautomatic synthesis of inductive predicates", University of Texas Department of Mathematics and Computer Sciences Report ATP-16, June 1974, 41 pp.
[4]
Pratt, T. "Kernel equivalence of programs and proving kernel equivalence and correctness by test cases" IJCAI-2 Preprints, London 1972.
Index Terms
- Four models for the analysis and optimization of program control structures
Recommendations
Program analysis and optimization through kernel-control decomposition
The decomposition of a program into a control part, which is concerned only with determining the flow of control, and a kernel part, which is concerned only with computing output values, is proposed. It is shown that such a kernel-control decomposition ...
Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
A new fast computational structure identical both for the forward and backward modified discrete cosine/sine transform (MDCT/MDST) computation is described. It is the result of a systematic construction of a fast algorithm for an efficient ...
New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
New universal rotation-based fast computational structures identical both for the discrete cosine/sine transform of type IV (DCT-IV/DST-IV) and the forward/backward modified discrete cosine/sine transform (MDCT/MDST) computation are described. They are ...
Comments
Information & Contributors
Information
Published In
May 1975
265 pages
ISBN:9781450374194
DOI:10.1145/800116
Copyright © 1975 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 05 May 1975
Check for updates
Qualifiers
- Article
Acceptance Rates
STOC '75 Paper Acceptance Rate 31 of 87 submissions, 36%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 59Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
Cited By
View all- Pratt T(2019)Program analysis and optimization through kernel-control decompositionActa Informatica10.1007/BF002888829:3(195-216)Online publication date: 2-Jan-2019
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in