Mads Rosendahl
- Adachi, Kasai & Moriya 1979.Akeo Adachi, Takumi Kazai, and Etsuro Moriya. A TAcorctieal Study on the Time Analysis of Programs. Lecture Notes in Computer Science, vol. 74, pp. 201-207. Springer-Verlag, 1979.Google Scholar
Cross Ref
- Aho, Hopcroft & Ullman 1974.Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974. Google ScholarDigital Library
- Cohen & Katcoff 1977.Jacques Cohen and J. Kat. coff. Symbolic Solution of Finite-Difference Equations. ACM Transactions on Mathematical Software, vol. 3, no. 3, pp. 261-271, September, 1977. Google ScholarDigital Library
- Cohen 1982.Jacques Cohen. Computer-Assisted Mieroanalyzis of Programs. Communications of the ACM, vol. 25, no. 10, pp. 724-733, October, 1982. Google ScholarDigital Library
- Cousot & Cousot 1977.Patrick Cousot and Radhis Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approzimation of Fizpoi~ts. in Conference Record of the Fourth A CM $ympoMum on Principles of Proyramming Languages, Los Angeles, CA, pp. 238-252, January, 1977. Google ScholarDigital Library
- Flajolet 1987.P. Flajolet. Mathematical Tools for Antomatic Program Analltzis. Technical Report 603. Institut National de Recherche en Informatique et en Automatiqtte, February, 1987.Google Scholar
- Gordon 1979.Michael 5. C. Gordon. The Denorational Description of Programming Languages. Springer-Verlag, Berlin/New York, 1979. Google ScholarDigital Library
- Hickey & Cohen 1988.Timothy Hickey and Jacques Cohen. Automatic Program Analysis. 3ournal of the Association for Computing Machinery, vol. 35, no. 1, pp. 185-220, January, 1988. Google ScholarDigital Library
- Kazai et al 1980.Kazai et al. An Automatic Time Analysis $~stem. Technical Report RIMS-335. Kyoto University, May, 1980.Google Scholar
- Le Métayer 1985.D. Le M6tayer. Mechanical Analysis of Program Complezity. In ACM $IGPLAN 85 Symposium. ACM SIGPLAN Notices, vol. 20, no. 7, pp. 69-73. ACM, July, 1985. Google ScholarDigital Library
- Le Métayer 1988.Daniel Le M~tayer. ACE: An Autorustic Oomplezity Evaluator. ACM Transactions on Programming Languages and Systems, vol. 10, no. 2, pp. 248-266, April, 1988. Google ScholarDigital Library
- McCarthy et al 1965.John McCarthy et al. Lisp 1.5 Programmers Manual, second edition. The M.I.T. Press, Cambridge, Mass, 1965. Google ScholarDigital Library
- Reynolds 1969.John C. Reynolds. Automatic Computation of Data Set Definitions. Information Processing 68, pp. 456--461, 1969.Google Scholar
- Rosendahl 1986.Madz Rozendahl. A~tomatic Program Analysis. Master's Thesis. Institute of Dat. slaty, University of Copenhagen, 1986.Google Scholar
- Sarkar & Hennessy 1986.Vivek Sarkar and John Hennessy. Compile-time Partitioning and Scheduling of Parallel Programs. In Proc. Sigplan '86 $~tmp. on Compiler Construction. ACM SIC- PLAN Notices, vol. 21, no. 7, pp. 17-26, July, 198(}. Google ScholarDigital Library
- Talcott 1986.Carolyn Talcott. Derived properties and de~i~ed programs. Stanford University, May, 1986.Google Scholar
- Turchin 1986.Valentin F. Turchin. The Concapt of a Supercompiler. ACM Transactions on Programming Languages and Systems, vol. 8, no. 3, pp. 292-325, July, 1986. Google ScholarDigital Library
- Wadler 1988.Philip Wadler. Strictness Analysis Aids Time Analysis. In Principle6 of Programming Languages, 1988. Google ScholarDigital Library
- Wegbreit 1975.Ben Wegbreit. Mechanical Program Analysis. Communications of the ACM, vol. 18, no. 9, pp. 528-539, September, 1975. Google ScholarDigital Library
- Wegbreit 1976.Ben Wegbreit. Goal-Directed Program Transformation. IEEE Transactions on Software Engineering, vol. SF_,-2, no. 2, pp. 69-80, June, 1976.Google ScholarDigital Library
Index Terms
- Automatic complexity analysis
Recommendations
ACE: an automatic complexity evaluator
There has been a great deal of research done on the evaluation of the complexity of particular algorithms; little effort, however, has been devoted to the mechanization of this evaluation. The ACE (Automatic Complexity Evaluator) system is able to ...
Automatic Complexity Analysis
ESOP '02: Proceedings of the 11th European Symposium on Programming Languages and SystemsWe consider the problem of automating the derivation of tight asymptotic complexity bounds for solving Horn clauses. Clearly, the solving time crucially depends on the "sparseness" of the computed relations. Therefore, our asymptotic runtime analysis is ...
Automated higher-order complexity analysis
Implicit computational complexityThis paper describes the automated complexity analysis (ACA) system for automated higher-order complexity analysis of functional programs synthesized with the NCPRD proof development system. We introduce a general framework for defining models of ...
Comments