Cantitate/Preț
Produs

The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones: Lecture Notes in Computer Science, cartea 2566

Editat de Torben Mogensen, David Schmidt, I. Hal Sudborough
en Limba Engleză Paperback – 13 dec 2002
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34344 lei

Preț vechi: 42930 lei
-20% Nou

Puncte Express: 515

Preț estimativ în valută:
6572 6823$ 5480£

Carte tipărită la comandă

Livrare economică 22 martie-05 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540003267
ISBN-10: 3540003266
Pagini: 492
Ilustrații: XIV, 478 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.72 kg
Ediția:2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Computational Complexity.- General Size-Change Termination and Lexicographic Descent.- Comparing Star and Pancake Networks.- Synchronization of Finite Automata: Contributions to an Old Problem.- Lambda Calculi and Linear Speedups.- Program Analysis.- Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software.- Meta-circular Abstract Interpretation in Prolog.- Flow Analysis: Games and Nets.- On Extracting Static Semantics.- Foundations of the Bandera Abstraction Tools.- Types in Program Analysis.- Flow Logic: A Multi-paradigmatic Approach to Static Analysis.- Structure-Preserving Binary Relations for Program Abstraction.- Program Transformation.- Principles of Inverse Computation and the Universal Resolving Algorithm.- A Symmetric Approach to Compilation and Decompilation.- The Abstraction and Instantiation of String-Matching Programs.- WSDFU: Program Transformation System Based on Generalized Partial Computation.- Homeomorphic Embedding for Online Termination of Symbolic Methods.- Simple Driving Techniques.- Demonstrating Lambda Calculus Reduction.- From Type Inference to Configuration.

Caracteristici

Includes supplementary material: sn.pub/extras