60. Birthday: Neil D. Jones, 2002

@proceedings{DBLP:conf/birthday/2002jones,
  editor    = {Torben {\AE}. Mogensen and
               David A. Schmidt and
               Ivan Hal Sudborough},
  title     = {The Essence of Computation, Complexity, Analysis, Transformation.
               Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]},
  booktitle = {The Essence of Computation},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2566},
  year      = {2002},
  isbn      = {3-540-00326-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Computational Complexity

• Amir M. Ben-Amram:
  General Size-Change Termination and Lexicographic Descent. 3-17
  
• Linda Morales, Ivan Hal Sudborough:
  Comparing Star and Pancake Networks. 18-36
  
• Arto Salomaa:
  Synchronization of Finite Automata: Contributions to an Old Problem. 37-59
  
• David Sands, Jörgen Gustavsson, Andrew Moran:
  Lambda Calculi and Linear Speedups. 60-84
  

Program Analysis

• Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, Xavier Rival:
  Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software. 85-108
  
• Michael Codish, Harald Søndergaard:
  Meta-circular Abstract Interpretation in Prolog. 109-134
  
• Chris Hankin, Rajagopal Nagarajan, Prahladavaradan Sampath:
  Flow Analysis: Games and Nets. 135-156
  
• John Hannan:
  On Extracting Static Semantics. 157-171
  
• John Hatcliff, Matthew B. Dwyer, Corina S. Pasareanu, Robby:
  Foundations of the Bandera Abstraction Tools. 172-203
  
• Thomas P. Jensen:
  Types in Program Analysis. 204-222
  
• Hanne Riis Nielson, Flemming Nielson:
  Flow Logic: A Multi-paradigmatic Approach to Static Analysis. 223-244
  
• David A. Schmidt:
  Structure-Preserving Binary Relations for Program Abstraction. 245-268
  

Program Transformation

• Sergei M. Abramov, Robert Glück:
  Principles of Inverse Computation and the Universal Resolving Algorithm. 269-295
  
• Mads Sig Ager, Olivier Danvy, Mayer Goldberg:
  A Symmetric Approach to Compilation and Decompilation. 296-331
  
• Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær:
  The Abstraction and Instantiation of String-Matching Programs. 332-357
  
• Yoshihiko Futamura, Zenjiro Konishi, Robert Glück:
  WSDFU: Program Transformation System Based on Generalized Partial Computation. 358-378
  
• Michael Leuschel:
  Homeomorphic Embedding for Online Termination of Symbolic Methods. 379-403
  
• Mads Rosendahl:
  Simple Driving Techniques. 404-419
  
• Peter Sestoft:
  Demonstrating Lambda Calculus Reduction. 420-435
  
• Morten Heine Sørensen, Jens P. Secher:
  From Type Inference to Configuration. 436-472
  

Last update Tue Feb 14 03:49:39 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page