|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
3
|
|
 |
4
|
|
| |
5
|
BOURNE, S. R., BIRRELL, A., AND WALKER, I. Algol "8C Reference Manual. Cambridge University, 1975.
|
| |
6
|
|
| |
7
|
COMER, D. Map: a Pascal macro preprocessor for large program development. Sofiw. Pract. Exper. 9, 3 (Mar. 1979), 203-209.
|
| |
8
|
COMER, D. Principles of program design induced from experience with small public programs. IEEE Trans. Sofiw. Eng. SE-7, 2 (Mar. 1981), 169-173.
|
| |
9
|
DIJKSTRA, E.W. Notes on Structured Programming. Academic Press, 1972.
|
| |
10
|
FAIMAN, R. N., AND KORTESOJA, A.A. An optimizing Pascal compiler. IEEE Trans. Softw. Eng. SE-6, 6 (Nov. 1980), 512-518.
|
 |
11
|
Susan L. Graham , Peter B. Kessler , Marshall K. Mckusick, Gprof: A call graph execution profiler, Proceedings of the 1982 SIGPLAN symposium on Compiler construction, p.120-126, June 23-25, 1982, Boston, Massachusetts, United States
|
 |
12
|
|
| |
13
|
JoY, W. N., GRAHAM, S. L., AND HALEY, C.B. Berkeley Pascal User's Manual, Version 2.0. Dept. of Electrical Engineering and Computer Science, Univ. of California, Berkeley, Oct. 1980.
|
| |
14
|
KARP, R.M. Reducibility Among Combinatorial Problems. Plenum Press, New York, 1972.
|
 |
15
|
|
| |
16
|
B. Liskov , R. R. Atkinson , T. Bloom , E. B. Moss , R. Schaffert , A. Snyder, CLU REFERENCE MANUAL, Massachusetts Institute of Technology, Cambridge, MA, 1979
|
 |
17
|
|
 |
18
|
|
| |
19
|
|
| |
20
|
PEREIRA, F., WARREN, D., BOWEN, D., B~mD, L., AND PEREIRA, L. CProlog User's Manual Version 1.2. SRI International, Menlo Fark, Calif.
|
| |
21
|
Reference Manual for the Ada Programming Language. Tech. Rep. U.S. Dept. of Defense, Feb. 1983.
|
| |
22
|
ROLLINS, E.J. A syntax analyzer constructor. Tech. Rep. Oregon Graduate Center, Beaverton, Ore., Aug. 1982.
|
| |
23
|
ROSEN, B.K. Robust linear algorithms for cutsets. J. Algorithms 3 (1982), 205-213.
|
| |
24
|
SHAMIR, A. A linear time algorithm for finding minimum cutsets in reducible graphs. SIAM J. Comput. 8, 4 (Nov. 1979), 645-655.
|
| |
25
|
TURNER, D. A., AND CAMPBELL, R.W. SASL Language Reference Manual. Tech. Rep. Dept. of Computational Science, St. Andrews Univ., 1979.
|
| |
26
|
UCB. UNIX Programmer's Manual, 4.2 BSD. Dept. of Electrical Engineering and Computer Science, Univ. of California, Berkeley, Aug. 1983.
|
 |
27
|
|
 |
28
|
|
REVIEW
Conventionally, compilers for block structured languages with
potentially recursive procedures generate code to allocate stack storage
for local variables on each procedure call. This paper reviews previous
schemes for reducing storage allocat
more...
|