Computer Science – Programming Languages
Scientific paper
2011-09-07
Theory and Practice of Logic Programming 2011, 11(4-5): 487-502 (2011)
Computer Science
Programming Languages
16 pages
Scientific paper
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 semiautomatic 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.
Comini Marco
Titolo Laura
Villanueva Alicia
No associations
LandOfFree
Abstract Diagnosis for Timed Concurrent Constraint programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Abstract Diagnosis for Timed Concurrent Constraint programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstract Diagnosis for Timed Concurrent Constraint programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-474263