Compiler Construction 19th International Conference, CC 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Gupta, Rajiv (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Lecture Notes in Computer Science, 6011
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03314nam a22005415i 4500
001 978-3-642-11970-5
003 DE-He213
005 20151204185145.0
007 cr nn 008mamaa
008 100308s2010 gw | s |||| 0|eng d
020 |a 9783642119705  |9 978-3-642-11970-5 
024 7 |a 10.1007/978-3-642-11970-5  |2 doi 
040 |d GrThAP 
050 4 |a QA76.758 
072 7 |a UMZ  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Compiler Construction  |h [electronic resource] :  |b 19th International Conference, CC 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings /  |c edited by Rajiv Gupta. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XII, 326 p. 119 illus.  |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 Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6011 
505 0 |a Invited Talk -- Programming Clouds -- Optimization Techniques -- Mining Opportunities for Code Improvement in a Just-In-Time Compiler -- Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values -- Optimizing Matlab through Just-In-Time Specialization -- RATA: Rapid Atomic Type Analysis by Abstract Interpretation – Application to JavaScript Optimization -- Program Transformations -- JReq: Database Queries in Imperative Languages -- Verifying Local Transformations on Relaxed Memory Models -- Program Analysis -- Practical Extensions to the IFDS Algorithm -- Using Ownership to Reason about Inherent Parallelism in Object-Oriented Programs -- Register Allocation -- Punctual Coalescing -- Strategies for Predicate-Aware Register Allocation -- Preference-Guided Register Assignment -- High-Performance Systems -- Validating Register Allocation and Spilling -- Automatic C-to-CUDA Code Generation for Affine Programs -- Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors? -- The Polyhedral Model Is More Widely Applicable Than You Think -- The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Software engineering. 
650 0 |a Computer programming. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Mathematical logic. 
650 1 4 |a Computer Science. 
650 2 4 |a Software Engineering. 
650 2 4 |a Software Engineering/Programming and Operating Systems. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Mathematical Logic and Formal Languages. 
700 1 |a Gupta, Rajiv.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642119699 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6011 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-11970-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)