Titlebook: Compiler Construction; 10th International C Reinhard Wilhelm Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Attribut.Co

Nibble

Interprocedural Shape Analysis for Recursive Programs subset of C. The algorithm is significantly more precise than existing algorithms. For example, it can verify the absence of memory leaks in many recursive programs; this is beyond the capabilities of existing algorithms.

反復(fù)無常

Optimal Live Range Merge for Address Register Allocation in Embedded Programss work, which is based on a heuristic that merges address register live ranges. We prove, for the first time, that the merge operation is NP-hard in general, and show the existence of an optimal linear-time algorithm, based on dynamic programming, for a special case of the problem.

分解

向下

Soft Modes and Localization in Spin Glassesfor probabilistic data flow problems. In contrast to other approaches, we utilize execution history for calculating the probabilities of data flow facts. In this way we achieve significantly better results. Effectiveness and efficiency of our approach are shown by compiling and running the SPECint95 benchmark suite.

四海為家的人

Energy Landscape of ,-Component Spin Glassesbility of these rewrites we add temporal logic side conditions. The combination of these features allows a flexible, high level, yet executable specification of many of the transformations found in optimising compilers.

乞丐

Obverse

EVICT

Itinerant

Directly-Executable Earley Parsingscribe how to narrow the performance gap between general and deterministic parsers, constructing a directly-executable Earley parser that can reach speeds comparable to deterministic methods even on grammars for commonly-used programming languages.

follicular-unit