Titlebook: Static Analysis; First International Baudouin Charlier Conference proceedings 1994 Springer-Verlag Berlin Heidelberg 1994 Abstract Interpr

Discrete

Mode analysis of functional logic programs,om logic programming. Such implementations can be largely improved if information about the run-time behavior, in particular the modes of function calls, is available at compile time. In this paper we present a framework to derive such globed information. The concrete operational semantics considere

VERT

ironic

Constraint-based type inference and parametric polymorphism,lain it in a different and more intuitive way as a flow problem. The intuition is facilitated by a direct correspondence between run-time and analysis-time concepts..Precise analysis of polymorphism is hard; several algorithms have been developed to cope with it. Focusing on parametric polymorphism

Osteons

Efficient on-the-fly analysis of program behavior and static cache simulation,sis, . for program behavior analysis during execution using a small number of instrumentation points. The formal model is further refined for certain analyses by transforming a program‘s call graph into a function-instance graph. Performance evaluations show that the number of measurement points can

SNEER

From processor timing specifications to static instruction scheduling,m used is SCCS, a synchronous process algebra for specifying timed, concurrent systems. We illustrate the technique by specifying a hypothetical processor that shares many properties of commercial processors (such as the MIPS or SuperSparc) including delayed loads and branches, interlocked floating-

ICLE

喪失

Generalized boxings, congruences and partial inlining,Peyton-Jones‘ techniques for optimizing boxings (allocations) and unboxings (field selection) away in strongly-typed functional programs. Our techniques achieve this goal, while not needing types any more (so it applies to Lisp as well as to ML), and providing a finer analysis; moreover, our techniq

micronutrients

殘廢的火焰

Uniqueness and completeness analysis of array comprehensions,defines each array element at most once. Uniqueness is a necessary condition for correctness in single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data dependence problem, which in itself can be reformulated as an integer linear programming problem.

惡臭

Extent analysis of data fields,s functions explicitly restricted to a finite set. Data parallel functional languages based on this view would reach a very high level of abstraction. Here we consider two static analyses that, when successful, give information about the . of a data field with recursively defined elements, in the fo