Titlebook: Static Analysis; 5th International Sy Giorgio Levi Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 1998 Analysis.Concurrency.

Munificent

medium

Bidirectional Data Flow Analysis in Code Motion: Myth and Realityconceptual understanding of the phenomena caused by critical edges, this also settles the foundation for a new and efficient hybrid iteration strategy that intermixes conventional round-robin iteration with the exhaustive iteration on critical subparts.

esculent

Improving Control in Functional Logic Program Specializationre reduced during specialization. We also present a novel abstraction operator which extends some partitioning techniques defined in the framework of .. We provide experimental results obtained from an implementation using the I. system which demonstrate that the control refinements produce better specializations.

谷类

Finite Subtype Inference with Explicit Polymorphismrsively constrained types. Some motivation for this work, particularly for finite types and explicit polymorphism, is in providing subtype inference for first-class container objects with polymorphic methods.

即席

Assessing the Effects of Flow-Sensitivity on Pointer Alias Analyseseach function; a variant of this algorithm that uses precomputed kill information; and a flow-sensitive algorithm. In addition to contrasting the precision and efficiency of these analyses, we describe implementation techniques and quantify their analysis-time speed-up.

MOAT

Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicingansformation combined with deforestation. A static analyser can then be derived by abstract interpretation of the dynamic analyser. We apply our framework to the derivation of a dynamic backward slicing analysis for a logic programming language.

Anthropoid

财主

Automatic Determination of Communication Topologies in Mobile Systemsf a mobile system specified in the . calculus. For this purpose, we use a nonstandard semantics of the . calculus which allows us to describe precisely the linkage of agents. The analysis algorithm is then derived by abstract interpretation of this semantics.

节约

伙伴

A First-Order Language for Expressing Aliasing and Type Properties of Logic Programsoof procedure, is shown to have interesting applications in validation and debugging of logic programs. An interesting parallel is pointed out between the language of aliasing properties and the first order theories of Boolean algebras.