Buch, Englisch, 277 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 920 g
Buch, Englisch, 277 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 920 g
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-540-33050-9
Verlag: Springer-Verlag GmbH
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
- Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
Weitere Infos & Material
Invited Talk.- Using Dependent Types to Port Type Systems to Low-Level Languages.- Program Analysis.- Interprocedural Dataflow Analysis in the Presence of Large Libraries.- Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers.- Path-Based Reuse Distance Analysis.- Context-Sensitive Points-to Analysis: Is It Worth It?.- Dynamic Analysis.- Selective Runtime Memory Disambiguation in a Dynamic Binary Translator.- Accurately Choosing Execution Runs for Software Fault Localization.- Tool Demonstrations.- Demonstration: On-Line Visualization and Analysis of Real-Time Systems with TuningFork.- Data-Flow Analysis as Model Checking Within the jABC.- The CGiS Compiler—A Tool Demonstration.- Optimization.- Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode.- Hybrid Optimizations: Which Optimization Algorithm to Use?.- A Fresh Look at PRE as a Maximum Flow Problem.- Performance Characterization of the 64-bit x86 Architecture from Compiler Optimizations’ Perspective.- Code Generation.- Lightweight Lexical Closures for Legitimate Execution Stack Access.- Polyhedral Code Generation in the Real World.- Iterative Collective Loop Fusion.- Converting Intermediate Code to Assembly Code Using Declarative Machine Descriptions.- Register Allocation.- SARA: Combining Stack Allocation and Register Allocation.- Register Allocation for Programs in SSA-Form.- Enhanced Bitwidth-Aware Register Allocation.