Cantitate/Preț
Produs

Compiler Construction: 17th International Conference, CC 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings: Lecture Notes in Computer Science, cartea 4959

Editat de Laurie Hendren
en Limba Engleză Paperback – 18 mar 2008

Din seria Lecture Notes in Computer Science

Preț: 32863 lei

Preț vechi: 41078 lei
-20% Nou

Puncte Express: 493

Preț estimativ în valută:
6289 6533$ 5224£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540787907
ISBN-10: 3540787909
Pagini: 326
Ilustrații: XII, 312 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.5 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Papers from Invited Talks.- Design Choices in a Compiler Course or How to Make Undergraduates Love Formal Notation.- Improved Memory-Access Analysis for x86 Executables.- Analyses and Transformations.- A System for Generating Static Analyzers for Machine Instructions.- IDE Dataflow Analysis in the Presence of Large Object-Oriented Libraries.- An Adaptive Strategy for Inline Substitution.- Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts.- Compiling for Parallel Architectures.- Control Flow Emulation on Tiled SIMD Architectures.- Generating SIMD Vectorized Permutations.- Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model.- Runtime Techniques and Tools.- How to Do a Million Watchpoints: Efficient Debugging Using Dynamic Instrumentation.- Compiler-Guaranteed Safety in Code-Copying Virtual Machines.- Hardware JIT Compilation for Off-the-Shelf Dynamically Reconfigurable FPGAs.- Visualization of Program Dependence Graphs.- Analyses.- On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis.- Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method.- Java Bytecode Verification for @NonNull Types.- Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models.- Atomicity and Transactions.- Coqa: Concurrent Objects with Quantized Atomicity.- Keep Off the Grass: Locking the Right Path for Atomicity.- Supporting Legacy Binary Code in a Software Transaction Compiler with Dynamic Binary Translation and Optimization.