Cantitate/Preț
Produs

Compiler Construction: 16th International Conference, CC 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 26-30, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4420

Editat de Shriram Krishnamurthi, Martin Odersky
en Limba Engleză Paperback – 8 mar 2007

Din seria Lecture Notes in Computer Science

Preț: 33042 lei

Preț vechi: 41303 lei
-20% Nou

Puncte Express: 496

Preț estimativ în valută:
6323 6577$ 5220£

Carte tipărită la comandă

Livrare economică 14-28 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540712282
ISBN-10: 3540712283
Pagini: 256
Ilustrații: XIV, 236 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.36 kg
Ediția:2007
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

Architecture.- New Algorithms for SIMD Alignment.- Preprocessing Strategy for Effective Modulo Scheduling on Multi-issue Digital Signal Processors.- An Array Allocation Scheme for Energy Reduction in Partitioned Memory Architectures.- Garbage Collection and Program Analysis.- Using Prefetching to Improve Reference-Counting Garbage Collectors.- Accurate Garbage Collection in Uncooperative Environments with Lazy Pointer Stacks.- Correcting the Dynamic Call Graph Using Control-Flow Constraints.- Obfuscating Java: The Most Pain for the Least Gain.- Register Allocation.- A Fast Cutting-Plane Algorithm for Optimal Coalescing.- Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer Linear Programming Formulation.- Extended Linear Scan: An Alternate Foundation for Global Register Allocation.- Program Analysis.- Program Refactoring, Program Synthesis, and Model-Driven Development.- A Practical Escape and Effect Analysis for Building Lightweight Method Summaries.- Layout Transformations for Heap Objects Using Static Access Patterns.- A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees.- A Declarative Framework for Analysis and Optimization.