reine Buchbestellungen ab 5 Euro senden wir Ihnen Portofrei zuDiesen Artikel senden wir Ihnen ohne weiteren Aufpreis als PAKET

Compiler Construction
(Englisch)
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
Gupta, Rajiv

Print on Demand - Dieser Artikel wird für Sie gedruckt!

44,95 €

inkl. MwSt. · Portofrei
Dieses Produkt wird für Sie gedruckt, Lieferzeit ca. 10 Werktage
Menge:

Compiler Construction

Seiten
Erscheinungsdatum
Auflage
Ausstattung
Erscheinungsjahr
Sprache
Serienfolge
alternative Ausgabe
Vertrieb
Kategorie
Buchtyp
Warengruppenindex
Warengruppe
Detailwarengruppe
Redaktion
Laenge
Breite
Hoehe
Gewicht
Hersteller Artikelnummer
Relevanz
Referenznummer
Verantwortlich für dieses Produkt
  • Lauinger, Sonia
    Lauinger Verlag
    Heinrich-Köhler-Platz 8
    DE-76187 Karlsruhe
    +49 721 47037027
    mail@lauinger-verlag.de
    Frau Sonia Lauinger
Moluna-Artikelnummer
  • 5049718

Produktbeschreibung

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 Javaillegalscript 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.
ETAPS 2010 was the 13th instance of the European Joint Conferences on T- oryand Practiceof Software. ETAPS is anannual federatedconference that was establishedin1998bycombininganumberofexistingandnewconferences. This yearitcomprisedtheusual?vesisterconferences(CC,ESOP,FASE,FOSSACS, TACAS), 19 satellite workshops (ACCAT, ARSPA-WITS, Bytecode, CMCS, COCV, DCC, DICE, FBTC, FESCA, FOSS-AMA, GaLoP, GT-VMT, LDTA, MBT, PLACES, QAPL, SafeCert, WGT, and WRLA) and seven invited l- tures (excluding those that were speci?c to the satellite events). The ?ve main conferences this year received 497 submissions (including 31 tool demonstration papers), 130 of which were accepted (10 tool demos), giving an overall acc- tance rate of 26%, with most of the conferences at around 24%. Congratulations thereforetoalltheauthorswhomadeittothe?nalprogramme!Ihopethatmost of the other authors will still have found a way of participating in this exciting event, and that you will all continue submitting to ETAPS and contributing to make of it the best conference on software science and engineering. The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools which support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented,withaninclinationtowardtheorywithapracticalmotivationonthe one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive. ETAPS is a confederation in which each event retains its own identity, with a separate Programme Committee and proceedings.
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 Javaillegalscript 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.

Inhaltsverzeichnis



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 Javaillegalscript 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.


Klappentext



and proceedings.

leseprobe



Datenschutz-Einstellungen