000 | 03361nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-71229-9 | ||
003 | DE-He213 | ||
005 | 20160624102104.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540712299 _9978-3-540-71229-9 |
||
024 | 7 |
_a10.1007/978-3-540-71229-9 _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] : _b16th 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 / _cedited by Shriram Krishnamurthi, Martin Odersky. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007. |
|
300 |
_aXIV, 236 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 ; _v4420 |
|
505 | 0 | _aArchitecture -- 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. | |
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 |
_aKrishnamurthi, Shriram. _eeditor. |
|
700 | 1 |
_aOdersky, Martin. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540712282 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4420 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-71229-9 |
942 |
_2EBK7512 _cEBK |
||
999 |
_c36806 _d36806 |