000 03720nam a22005535i 4500
001 978-3-540-78791-4
003 DE-He213
005 20160624102118.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540787914
_9978-3-540-78791-4
024 7 _a10.1007/978-3-540-78791-4
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aCompiler Construction
_h[electronic resource] :
_b17th 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 /
_cedited by Laurie Hendren.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _aXII, 312 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4959
505 0 _aPapers 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aSoftware Engineering.
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aHendren, Laurie.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540787907
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4959
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-78791-4
942 _2EBK8055
_cEBK
999 _c37349
_d37349