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

PATRI

Automatic Determination of Communication Topologies in Mobile Systems dynamically changes that structure. In this paper we design an automatic analysis for statically determining all potential links between the agents of a mobile system specified in the . calculus. For this purpose, we use a nonstandard semantics of the . calculus which allows us to describe precisel

立即

积习难改

A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs and their types. The class of true formulas is proven to be decidable through a procedure of elimination of quantifiers and the language, with its proof procedure, is shown to have interesting applications in validation and debugging of logic programs. An interesting parallel is pointed out between

焦虑

无动于衷

放气

单独

Analysis of Imperative Programs through Analysis of Constraint Logic Programsrative program (a constraint logic program, in the approach shown here). We propose an effective style of writing operational semantics suitable for analysis which we call . semantics. Through controlled partial evaluation we are able to generate residual programs where the relationship between impe

名义上

Improving Control in Functional Logic Program Specializationgic programs and . of functional programs. Although it is possible to treat complex terms containing primitive functions (e.g. conjunctions or equations) in the NPE framework, its basic control mechanisms do not allow for effective polygenetic specialization of these complex expressions. We introduc

CHIP

Directional Type Inference for Logic Programsis sound and complete for given discriminative types. We characterize directional types in model-theoretic terms. We present an algorithm for . directional types. The directional type that we derive from a logic program . is uniformly at least as precise as any discriminative directional type of .,

CHANT