Program Analysis for Implicit Computational Complexity

  • Neil D. Jones
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2053)


This talk brings together ideas from two lines: automatic estimation of program running times, and implicit computational complexity. It describes ongoing research. Recent work in the two areas has been done by Bellantoni and Cook, Benzinger, Hofmann, Jones, Crary and Weirich, Leivant, Marion, Schwichtenberg, and others.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Neil D. Jones
    • 1
  1. 1.DIKU, University of CopenhagenCopenhagen ØDenmark

Personalised recommendations