A COMMON INTERMEDIATE LANGUAGE AND ITS USE IN PARTITIONING CONCURRENTDECLARATIVE PROGRAMS

The plethora of concurrent declarative language families, each with su btly different semantics, makes the design and implementation of stati c analyses for these languages a demanding task. However, many of the languages share underlying structure, and if this structure can be exp loited, static analysis techniques can be shared across language famil ies. These techniques can thus provide a common kernel for the impleme ntation of quality compilers for this entire language class. The purpo se of this paper is to exploit the similarities of non-strict function al and concurrent logic languages in the design of a common intermedia te language (CIL). The CIL is introduced incrementally, giving at each step the rationale for its extension. As an application, we present, in CIL form, some state-of-the-art static partitioning algorithms from the literature. This allows us to ''uncover'' the relative advantages and disadvantages of the analyses, and determine promising directions for improving static partitioning.