000 03697nam a22005655i 4500
001 978-3-540-36377-4
003 DE-He213
005 20160624101934.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540363774
_9978-3-540-36377-4
024 7 _a10.1007/3-540-36377-7
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 4 _aThe Essence of Computation
_h[electronic resource] :
_bComplexity, Analysis, Transformation /
_cedited by Torben Æ. Mogensen, David A. Schmidt, I. Hal Sudborough.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
300 _aXIV, 478 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2566
505 0 _aComputational 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.
520 _aBy 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputation by Abstract Devices.
700 1 _aMogensen, Torben Æ.
_eeditor.
700 1 _aSchmidt, David A.
_eeditor.
700 1 _aSudborough, I. Hal.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540003267
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2566
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-36377-7
942 _2EBK4270
_cEBK
999 _c33564
_d33564