Jacques Cohen
- 1 Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer AIgorithms. Addison-Wesley, Reading, Mass., 1976 Google Scholar
Digital Library
- 2 Beizer, B. Micro Analysis of Computer System Performance. Van Nostrand, New York, 1978 Google ScholarDigital Library
- 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.Google Scholar
- 4 Boyer, R.S., Elspas, B., and Levitt, K.N. Select: A formal system for testing and debugging programs for symbolic execution. SIGPLAN Notices (ACM), 10, 6 (June 1975), 234-245. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 6 Cohen, J., and Carpenter, N. A language for inquiring about the behavior of programs. Software--Practice and Experience, 7 (1977), 445-460.Google ScholarCross Ref
- 7 Cohen, J., and Hickey, T. Two algorithms for determining the volume of convex polyhedra. J. ACM, 26, 3 (July 1979), 401-414. Google ScholarDigital Library
- 8 Cohen, J., and Katcoff, J. Symbolic solution of finite-difference equations. Trans. Math. Softw. 3, 3 (Sept. 1977), 261-271. Google ScholarDigital Library
- 9 Cohen, J., and Roth, M. Analyses of deterministic parsing algorithms. Comm. ACM, 21, 6 (June 1978), 448-458. Google ScholarDigital Library
- 10 Cohen, J., and Roth, M. On the implementation of Strassen's fast multiplication algorithm. Acta lnf., 6, 4 (1976), 341-355.Google Scholar
- 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.Google Scholar
- 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.Google ScholarDigital Library
- 13 Cohen, J., and Zuckerman, C. Two languages for estimating program efficiency. Comm. ACM, 17, 6 (June 1974), 301-308. Google ScholarDigital Library
- 14 Floyd, R.W. Assigning meaning to programs. In Proc. AMS Symposia in Applied Mathematics, 19 (1967), 19-32.Google ScholarCross Ref
- 15 Gosper, R.W. Decision procedure for indefinite hypergeometric summation. Proc. Nat. Acad. Sci., 75, 1 (Jan. 1978), 40--42.Google ScholarCross Ref
- 16 Hoare, C.A.R. An axiomatic basis for computer programming. Comm. ACM, 12, 10 (Oct. 1969), 576-580, 583. Google ScholarDigital Library
- 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.Google Scholar
- 18 Ivie, J. Some Macsyma programs for solving recurrence relations. ACM Trans. Math. Softw., 4, 1 (Mar. 1978), 24-33. Google ScholarDigital Library
- 19 Jonassen, A.T., and Knuth, D.E. A trivial algorithm whose analysis isn't. J. Comput. Syst. Sci., 16 (1978), 301-322.Google ScholarCross Ref
- 20 King, J. Symbolic execution and program testing. Comm. A CM, 19, 7 (July 1976), 385-394. Google ScholarDigital Library
- 21 Knuth, D.E. The Art of Computer Programming, vol. 1: Fundamental Algorithms, 2nd. ed. Addison-Wesley, Reading, Mass., 1973. Google ScholarDigital Library
- 22 Knuth, D.E. Mathematical analysis of algorithms. In Proc. 1971 IFIP Congress, Elsevier Science, New York (1972), 19-27.Google Scholar
- 23 Knuth, D.E., and Stevenson, F.R. Optimal measurement points for program frequency counts. BIT, 13 (1973), 313-322.Google ScholarCross Ref
- 24 Kozen, D. Semantics of probabilistic programs. Rep. RC 7581 (32819), IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., Mar. 1979.Google Scholar
- 25 Math Lab Group: Macsyma Reference Manual, version 9. Lab. Computer Science, Massachusetts Inst. Technology, Cambridge, Dec. 1977.Google Scholar
- 26 Monier, L. Combinatorial solutions of multidimensional divideand-conquer recurrences. Rep. 79-126, Dep. Computer Science, Carnegie-Mellon Univ., Pittsburgh, Pa., May 1979.Google Scholar
- 27 Ramamoorty, C.V. Discrete Markov analysis of computer programs. Proc. ACM 20th Nat. Conf (1965), 386-392. Google ScholarDigital Library
- 28 Ramshaw, L.H. Formalizing the analysis of algorithms. Rep. 79- 741, Ph.D. Thesis, Stanford Univ., Stanford, Calif., (June 1979); also available as Tech. Rep. SL-79-5, Xerox Palo Alto Research Center, Palo Alto, Calif. Google ScholarDigital Library
- 29 Strassen, V. Gaussian elimination is not optimal. Numer. Math. 13 (1969), 354-356.Google ScholarDigital Library
- 30 Warshall, S. A theorem on Boolean matrices. J. ACM, 9 (1962), 11-12. Google ScholarDigital Library
- 31 Wegbreit, B. Goal-directed program transformation. 1EEE Trans. Softw. Eng., SE-2, 2 (June 1976), 69-80.Google ScholarDigital Library
- 32 Wegbreit, B. Mechanical program analysis. Comm. ACM, 18, 9 (Sept. 1975), 528-539. Google ScholarDigital Library
- 33 Wegbreit, B. Verifying program performance. J. ACM, 23, 4 (Oct. 1976), 691-699. Google ScholarDigital Library
Index Terms
- Computer-assisted microanalysis of programs
Recommendations
A novel computer-assisted surgical technique for revision total knee arthroplasty
Revision total knee arthroplasty (RTKA) is a skill-demanding intervention presenting several technical challenges to the surgeon due to bone deficiencies and lack of anatomical references. Computer-assisted navigation systems can potentially solve these ...
A new approach to program testing
International Conference on Reliable SoftwareThe current approach for testing a program is, in principle, quite primitive. Some small sample of the data that a program is expected to handle is presented to the program. If the program produces correct results for the sample, it is assumed to be ...
Preliminary clinical experience using a newly developed minimal-invasive reference base in computer assisted foot surgery
In recent years, many new tools and techniques have been developed in computer assisted orthopaedic surgery primarily with an industry led effort in software innovation and development. Only a few research and clinical projects have focused on ...
Comments