ACM Home Page
Please provide us with feedback. Feedback
Computer-assisted microanalysis of programs
Full text PdfPdf (827 KB)
Source
Communications of the ACM archive
Volume 25 ,  Issue 10  (October 1982) table of contents
Pages: 724 - 733  
Year of Publication: 1982
ISSN:0001-0782
Author
Jacques Cohen  Brandeis Univ., Waltham, Massachusetts
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 14
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/358656.358674
What is a DOI?

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
Bentley, J.L., Haken, D., and Saxe, J.B. A general method for solving divide and conquer recurrences. Rept. 78-154, Dep. Computer Science, Carnegie-Mellon Univ., Pittsburgh, Pa., Dec. 1978.
4
 
5
Cheatham, T.E., Holloway, G.H., and Townley, J.A. Symbolic evaluation and the analysis of programs. IEEE Trans. Softw. Eng., SE-5, 4 (July 1979), 402-417.
 
6
Cohen, J., and Carpenter, N. A language for inquiring about the behavior of programs. Software--Practice and Experience, 7 (1977), 445-460.
7
8
9
 
10
Cohen, J., and Roth, M. On the implementation of Strassen's fast multiplication algorithm. Acta lnf., 6, 4 (1976), 341-355.
 
11
Cohen, J., and Sitver, R. A case study in program transformation: Translation into Polish. IEEE Trans. Softw. Eng. SE- 5, 6 (Nov. 1979), 593-606.
 
12
Cohen, J., Sitver, R., and Auty, D. Evaluating and improving recursive descent parsers. IEEE Trans. Soflw. Eng., SE-5, 5 (Sept. 1979), 472-480.
13
 
14
Floyd, R.W. Assigning meaning to programs. In Proc. AMS Symposia in Applied Mathematics, 19 (1967), 19-32.
 
15
Gosper, R.W. Decision procedure for indefinite hypergeometric summation. Proc. Nat. Acad. Sci., 75, 1 (Jan. 1978), 40--42.
16
 
17
Ingalls, D. The Execution Time Profile as a Programming Tool, in Design and Optimization of Compilers, R. Rustin (Ed.) Prentice-Hall, Englewood Cliffs, N.J. 1972, 107-128.
18
 
19
Jonassen, A.T., and Knuth, D.E. A trivial algorithm whose analysis isn't. J. Comput. Syst. Sci., 16 (1978), 301-322.
20
 
21
 
22
Knuth, D.E. Mathematical analysis of algorithms. In Proc. 1971 IFIP Congress, Elsevier Science, New York (1972), 19-27.
 
23
Knuth, D.E., and Stevenson, F.R. Optimal measurement points for program frequency counts. BIT, 13 (1973), 313-322.
 
24
Kozen, D. Semantics of probabilistic programs. Rep. RC 7581 (32819), IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., Mar. 1979.
 
25
Math Lab Group: Macsyma Reference Manual, version 9. Lab. Computer Science, Massachusetts Inst. Technology, Cambridge, Dec. 1977.
 
26
Monier, L. Combinatorial solutions of multidimensional divideand-conquer recurrences. Rep. 79-126, Dep. Computer Science, Carnegie-Mellon Univ., Pittsburgh, Pa., May 1979.
27
 
28
 
29
Strassen, V. Gaussian elimination is not optimal. Numer. Math. 13 (1969), 354-356.
30
 
31
Wegbreit, B. Goal-directed program transformation. 1EEE Trans. Softw. Eng., SE-2, 2 (June 1976), 69-80.
32
33

CITED BY  14
 
 
 
 
 


Peer to Peer - Readers of this Article have also read: