LEADER 05874nam 22007935 450 001 9910144205203321 005 20250630164341.0 010 $a1-280-30824-9 010 $a9783540247238 010 $a9786610308248 010 $a3-540-24723-8 024 7 $a10.1007/b95956 035 $a(CKB)1000000000212328 035 $a(DE-He213)978-3-540-24723-4 035 $a(SSID)ssj0000126570 035 $a(PQKBManifestationID)11138604 035 $a(PQKBTitleCode)TC0000126570 035 $a(PQKBWorkID)10047158 035 $a(PQKB)11042597 035 $a(MiAaPQ)EBC3087507 035 $a(PPN)15523028X 035 $a(EXLCZ)991000000000212328 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCompiler Construction $e13th International Conference, CC 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings /$fedited by Evelyn Duesterwald 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (313 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2985 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-21297-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talk -- Developing a Foundation for Code Optimization -- Program Analysis -- Analyzing Memory Accesses in x86 Executables -- The Limits of Alias Analysis for Scalar Optimizations -- Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs -- Data Dependence Profiling for Speculative Optimizations -- Parsing -- Elkhound: A Fast, Practical GLR Parser Generator -- Generalised Parsing: Some Costs -- Loop Analysis -- An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas -- A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization -- Periodic Polyhedra -- Optimization -- Region-Based Partial Dead Code Elimination on Predicated Code -- Value-Based Partial Redundancy Elimination -- Increasing the Applicability of Scalar Replacement -- Reducing the Cost of Object Boxing -- Code Generation and Backend Optimizations -- FFT Compiler Techniques -- Widening Integer Arithmetic -- Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors -- Using Multiple Memory Access Instructions for Reducing Code Size -- Compiler Construction -- Integrating the Soot Compiler Infrastructure into an IDE -- Declarative Composition of Stack Frames. 330 $aThe CC program committee is pleased to present this volume with the proceedings of the 13th International Conference on Compiler Construction (CC 2004). CC continues to provide an exciting forum for researchers, educators, and practitioners to exchange ideas on the latest developments in compiler technology, programming language implementation, and language design. The conference emphasizes practical and experimental work and invites contributions on methods and tools for all aspects of compiler technology and all language paradigms. This volume serves as the permanent record of the 19 papers accepted for presentation at CC 2004 held in Barcelona, Spain, during April 1?2, 2004. The 19 papers in this volume were selected from 58 submissions. Each paper was assigned to three committee members for review. The program committee met for one day in December 2003 to discuss the papers and the reviews. By the end of the meeting, a consensus emerged to accept the 19 papers presented in this volume. However, there were many other quality submissions that could not be accommodated in the program; hopefully they will be published elsewhere. The continued success of the CC conference series would not be possible without the help of the CC community. I would like to gratefully acknowledge and thank all of the authors who submitted papers and the many external reviewers who wrote reviews. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2985 606 $aProgramming languages (Electronic computers) 606 $aSoftware engineering 606 $aComputer logic 606 $aLogic, Symbolic and mathematical 606 $aArtificial intelligence 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aProgramming languages (Electronic computers) 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aLogic, Symbolic and mathematical. 615 0$aArtificial intelligence. 615 14$aProgramming Languages, Compilers, Interpreters. 615 24$aSoftware Engineering. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 676 $a005.453 702 $aDuesterwald$b Evelyn$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCC 2004 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144205203321 996 $aCompiler Construction$9771871 997 $aUNINA