Skip to main content
Springer Nature Link
Log in

The Essence of Computation

Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones

  • Book
  • © 2002
Save book
View saved research

Overview

Editors:
  1. Torben Æ. Mogensen

    1. DIKU, University of Copenhagen, Copenhagen, Denmark

  2. David A. Schmidt

    1. Department of Computing and Information Sciences, Kansas State University, Manhattan, USA

  3. I. Hal Sudborough

    1. Department of Computer Science, University of Texas at Dallas, Richardson, USA

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook EUR 42.79
Price includes VAT (Netherlands)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 54.49
Price includes VAT (Netherlands)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (20 chapters)

  1. Front Matter

    Pages I-XIV
    Download chapter PDF

  2. Computational Complexity

    1. General Size-Change Termination and Lexicographic Descent

      • Amir M. Ben-Amram
      Pages 3-17

    2. Comparing Star and Pancake Networks

      • Linda Morales, I. Hal Sudborough
      Pages 18-36

    3. Synchronization of Finite Automata: Contributions to an Old Problem

      • Arto Salomaa
      Pages 37-59

    4. Lambda Calculi and Linear Speedups

      • David Sands, Jörgen Gustavsson, Andrew Moran
      Pages 60-82

  3. Program Analysis

    1. Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software

      • Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné et al.
      Pages 85-108

    2. Meta-circular Abstract Interpretation in Prolog

      • Michael Codish, Harald Søndergaard
      Pages 109-134

    3. Flow Analysis: Games and Nets

      • Chris Hankin, Rajagopal Nagarajan, Prahladavaradan Sampath
      Pages 135-156

    4. On Extracting Static Semantics

      • John Hannan
      Pages 157-171

    5. Foundations of the Bandera Abstraction Tools

      • John Hatcliff, Matthew B. Dwyer, Corina S. Păsăreanu, Robby
      Pages 172-203

    6. Types in Program Analysis

      • Thomas Jensen
      Pages 204-222

    7. Flow Logic: A Multi-paradigmatic Approach to Static Analysis

      • Hanne Riis Nielson, Flemming Nielson
      Pages 223-244

    8. Structure-Preserving Binary Relations for Program Abstraction

      • David A. Schmidt
      Pages 245-265

  4. Program Transformation

    1. Principles of Inverse Computation and the Universal Resolving Algorithm

      • Sergei Abramov, Robert Glück
      Pages 269-295

    2. A Symmetric Approach to Compilation and Decompilation

      • Mads Sig Ager, Olivier Danvy, Mayer Goldberg
      Pages 296-331

    3. The Abstraction and Instantiation of String-Matching Programs

      • Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær
      Pages 332-357

    4. WSDFU: Program Transformation System Based on Generalized Partial Computation

      • Yoshihiko Futamura, Zenjiro Konishi, Robert Glück2
      Pages 358-378

    5. Homeomorphic Embedding for Online Termination of Symbolic Methods

      • Michael Leuschel
      Pages 379-403

    6. Simple Driving Techniques

      • Mads Rosendahl
      Pages 404-419

    7. Demonstrating Lambda Calculus Reduction

      • Peter Sestoft
      Pages 420-435
Back to top

Editors and Affiliations

  • DIKU, University of Copenhagen, Copenhagen, Denmark

    Torben Æ. Mogensen

  • Department of Computing and Information Sciences, Kansas State University, Manhattan, USA

    David A. Schmidt

  • Department of Computer Science, University of Texas at Dallas, Richardson, USA

    I. Hal Sudborough

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top