My Account Log in

1 option

The Essence of Computation : Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones / edited by Torben Mogensen, David Schmidt, I. Hal Sudborough.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Mogensen, Torben, editor.
Schmidt, David, editor.
Sudborough, Hal, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2566.
Lecture Notes in Computer Science, 0302-9743 ; 2566
Language:
English
Subjects (All):
Computers.
Computer logic.
Software engineering.
Theory of Computation.
Logics and Meanings of Programs.
Software Engineering.
Computation by Abstract Devices.
Local Subjects:
Theory of Computation.
Logics and Meanings of Programs.
Software Engineering.
Computation by Abstract Devices.
Physical Description:
1 online resource (XIV, 478 pages).
Edition:
First edition 2002.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
System Details:
text file PDF
Summary:
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.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-36377-4
9783540363774
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account