Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Dahl, Véronica, Niemelä, Ilkka, Falaschi, M., Olarte, C., and Palamidessi, C.
We present a framework for the declarative diagnosis of non-deterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, $T_{{\mathcal{D}}}$, which models the process behaviour associated with a program ${\mathcal{D}}$ given in terms of sequences of constraints. Then, we show that, given the intended specification of ${\mathcal{D}}$, it is possible to check the correctness of ${\mathcal{D}}$ by a single step of $T_{{\mathcal{D}}}$. In order to develop an effective debugging method, we approximate the denotational semantics of ${\mathcal{D}}$. We formalize this method by abstract interpretation techniques, and we derive a finitely terminating abstract diagnosis method, which can be used statically. We define an abstract domain which allows us to approximate the infinite sequences by a finite ‘cut'. As a further development we show how to use a specific linear temporal logic for deriving automatically the debugging sequences. Our debugging framework does not require the user to either provide error symptoms in advance or answer questions concerning program correctness. Our method is compositional, that may allow to master the complexity of the debugging methodology. [ABSTRACT FROM AUTHOR]