Modular Analysis of Suspension Free cc Programs

Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback of these semantics is their complexity, which increases as the interactions between different program modules become more sophisticated. As a consequence, the benefits of a compositional approach can be easily overcome by the incurred computational overhead. This observation applies in particular to concurrent constraint (cc) program modules, which can interact in very complicated ways by means of their ization primitive (the ask guard). In this work we provide a modular abstract interpretation framework for cc programs that partially solves this problem. By assuming the whole program suspension free, we show that it is possible to compositionally compute an approximation of its run-time behavior while keeping complexity under control. To this end we translate the cc program into a clp program and analyze the...

• Type: Conference
• Year: 1996
• Where: AGP
• Authors: Enea Zaffanella
• Keywords: AGP 1996, Artificial Intelligence, Cc Program, Modular Data-flow Analyses, Program Modules