The Essence of Computation

Complexity, Analysis, Transformation

  • Torben Æ. Mogensen
  • David A. Schmidt
  • I. Hal Sudborough

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2566)

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Computational Complexity

    1. Linda Morales, I. Hal Sudborough
      Pages 18-36
    2. David Sands, Jörgen Gustavsson, Andrew Moran
      Pages 60-82
  3. Program Analysis

    1. Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné et al.
      Pages 85-108
    2. Michael Codish, Harald Søndergaard
      Pages 109-134
    3. Chris Hankin, Rajagopal Nagarajan, Prahladavaradan Sampath
      Pages 135-156
    4. John Hannan
      Pages 157-171
    5. John Hatcliff, Matthew B. Dwyer, Corina S. Păsăreanu, Robby
      Pages 172-203
    6. Thomas Jensen
      Pages 204-222
    7. Hanne Riis Nielson, Flemming Nielson
      Pages 223-244
  4. Program Transformation

    1. Mads Sig Ager, Olivier Danvy, Mayer Goldberg
      Pages 296-331
    2. Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær
      Pages 332-357
    3. Yoshihiko Futamura, Zenjiro Konishi, Robert Glück2
      Pages 358-378
    4. Mads Rosendahl
      Pages 404-419
    5. Peter Sestoft
      Pages 420-435

About this book

Introduction

By presenting state-of-the-art aspects of the theory of computation, this book commemorates the 60th birthday of Neil D. Jones, whose scientific career parallels the evolution of computation theory itself.
The 20 reviewed research papers presented together with a brief survey of the work of Neil D. Jones were written by scientists who have worked with him, in the roles of student, colleague, and, in one case, mentor. In accordance with the Festschrift's subtitle, the papers are organized in parts on computational complexity, program analysis, and program transformation.

Keywords

Automata Theory Computational Complexity Flow Analysis Program Analysis Program Semantics Program Transformation Programming Calculi Programming Logic Programming Theory Static Analysis algorithms automata calculus complexity lambda calculus

Editors and affiliations

  • Torben Æ. Mogensen
    • 1
  • David A. Schmidt
    • 2
  • I. Hal Sudborough
    • 3
  1. 1.DIKUUniversity of CopenhagenCopenhagenDenmark
  2. 2.Department of Computing and Information SciencesKansas State UniversityManhattanUSA
  3. 3.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-36377-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-00326-7
  • Online ISBN 978-3-540-36377-4
  • Series Print ISSN 0302-9743
  • About this book