Titlebook: Compiler Construction; 13th International C Evelyn Duesterwald Conference proceedings 2004 Springer-Verlag Berlin Heidelberg 2004 Compiler.

閃爍

書(shū)目名稱Compiler Construction影響因子(影響力)




書(shū)目名稱Compiler Construction影響因子(影響力)學(xué)科排名




書(shū)目名稱Compiler Construction網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Compiler Construction網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Compiler Construction被引頻次




書(shū)目名稱Compiler Construction被引頻次學(xué)科排名




書(shū)目名稱Compiler Construction年度引用




書(shū)目名稱Compiler Construction年度引用學(xué)科排名




書(shū)目名稱Compiler Construction讀者反饋




書(shū)目名稱Compiler Construction讀者反饋學(xué)科排名

TERRA

我邪惡

The Limits of Alias Analysis for Scalar Optimizationscalar optimizations, including an analysis that assumes no aliases, to establish a very loose upper bound on optimization opportunities. We then measure optimization opportunities on thirty-six C programs. In practice, the optimizations are rarely inhibited due to the precision of the alias analyses

喧鬧

Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs reducing the number of . edges considered while slicing concurrent Java programs. The key idea is to statically detect situations where run-time heap objects are reachable from a single thread and use it to prune spurious interference dependence edges. We also show how this analysis can be extended

insidious

Data Dependence Profiling for Speculative Optimizationslysis algorithms are developed primarily for Fortran-like subscripted array variables. They are not very effective for pointer-based references in C or C++. With more advanced hardware support for speculative execution, such as the advanced load instructions in Intel’s IA64 architecture, some data d

假

Elkhound: A Fast, Practical GLR Parser Generatorrammars, and can parse with any context-free grammar, including ambiguous grammars. However, adoption of GLR has been slowed by high constant-factor overheads and the lack of a general, user-defined action interface..In this paper we present algorithmic and implementation enhancements to GLR to solv

假

Generalised Parsing: Some Costse available approaches in terms of their space and time performance for programming language applications, focusing mainly on GLR style algorithms. It is well known that the original Tomita GLR algorithm fails to terminate on hidden left recursion: here we analyse two approaches to correct GLR parsi

鬼魂

好開(kāi)玩笑

A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimizationave still many limitations. In particular, integer multi-variate polynomials arise in many situations while analyzing programs, and analysis systems are unable to handle such expressions. Although some dedicated methods have already been proposed, they only handle some subsets of such expressions. T

種屬關(guān)系