![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
60. Birthday: Neil D. Jones , 2002
- Torben Æ. Mogensen, David A. Schmidt, Ivan Hal Sudborough:
The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]. Lecture Notes in Computer Science 2566, Springer 2002, ISBN 3-540-00326-6
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
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.