|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-71229-9 |
| 003 |
DE-He213 |
| 005 |
20230221053134.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540712299
|9 978-3-540-71229-9
|
| 024 |
7 |
|
|a 10.1007/978-3-540-71229-9
|2 doi
|
| 050 |
|
4 |
|a QA76.76.C65
|
| 072 |
|
7 |
|a UMC
|2 bicssc
|
| 072 |
|
7 |
|a COM051010
|2 bisacsh
|
| 072 |
|
7 |
|a UMC
|2 thema
|
| 082 |
0 |
4 |
|a 005.45
|2 23
|
| 245 |
1 |
0 |
|a Compiler Construction
|h [electronic resource] :
|b 16th 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 /
|c edited by Shriram Krishnamurthi, Martin Odersky.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a XIV, 236 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4420
|
| 505 |
0 |
|
|a Architecture -- 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 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Compilers and Interpreters.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 700 |
1 |
|
|a Krishnamurthi, Shriram.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Odersky, Martin.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540836049
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540712282
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4420
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-71229-9
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
