FEEDBACK Smiley face
Normal view MARC view ISBD view

Compiler Construction [electronic resource] :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 /

Contributor(s): Hendren, Laurie [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 4959Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.Description: XII, 312 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540787914.Subject(s): 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)Online resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in