Compiler Construction
Editat de Laurie Hendrenen Limba Engleză Paperback – 18 mar 2008
Preț: 323.39 lei
Preț vechi: 404.23 lei
-20%
Puncte Express: 485
Carte tipărită la comandă
Livrare economică 27 iulie-10 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540787907
ISBN-10: 3540787909
Pagini: 324
Ilustrații: XII, 312 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540787909
Pagini: 324
Ilustrații: XII, 312 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.