Abstract diagnosis for timed concurrent constraint programs

作者：Comini Marco^*; Titolo Laura; Villanueva Alicia

来源：Theory and Practice of Logic Programming, 2011, 11: 487-502.

DOI：10.1017/S1471068411000135

• concurrent constraint paradigm
• denotational semantics
• abstract diagnosis
• abstract interpretation

The timed concurrent constraint language (tccp in short) is a concurrent logic language based on the simple but powerful concurrent constraint paradigm of Saraswat. In this paradigm, the notion of store-as-value is replaced by the notion of store-as-constraint, which introduces some differences w.r.t. other approaches to concurrency. In this paper, we provide a general framework for the debugging of tccp programs. To this end, we first present a new compact, bottom-up semantics for the language that is well suited for debugging and verification purposes in the context of reactive systems. We also provide an abstract semantics that allows us to effectively implement debugging algorithms based on abstract interpretation. Given a tccp program and a behavior specification, our debugging approach automatically detects whether the program satisfies the specification. This differs from other semi-automatic approaches to debugging and avoids the need to provide symptoms in advance. We show the efficacy of our approach by introducing two illustrative examples. We choose a specific abstract domain and show how we can detect that a program is erroneous.

• 出版日期2011-7