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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Hendren, Laurie (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 4959
• Θέματα: Computer science.; Software engineering.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Artificial intelligence.; Computer Science.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; Software Engineering.; Artificial Intelligence (incl. Robotics).

Πίνακας περιεχομένων:

• 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.