Cost-Sensitive Diagnosis of Declarative Programs
نویسندگان
چکیده
منابع مشابه
Cost-sensitive diagnosis of declarative programs
Diagnosis methods in debugging aim at detecting bugs of a program, either by comparing it with a correct specification or by the help of an oracle (typically, the user herself). Debugging techniques for declarative programs usually exploit the semantical properties of programs (and specifications) and generally try to detect one or more “buggy” rules. In this way, rules are split apart in an ab...
متن کاملDeclarative Diagnosis of Temporal Concurrent Constraint Programs
We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check ...
متن کاملDeclarative Incorrectness Diagnosis of Constraint Logic Programs
Our concern in this paper is the declarative debugging of Constraint Logic Programs in the framework of the CLP formalism. Our diagnosis is declarative, this means that there is no need for the programmer to understand the computational behaviour of the system. What is required is the declarative intended semantics of the program. It is not possible to merely adapt to CLP diagnosis techniques o...
متن کاملDeclarative Diagnosis of Constraint Programs an assertion based approach
This paper discusses adaptation of the declarative diagnosis techniques for the use in constraint logic programming The objective is to show how the well known concepts are to be modi ed in this setting In particular the paper outlines basic algorithms for diagnosing incorrectness errors and insu ciency errors for constraint programs over arbitrary domains The main focus is on de ning kinds of ...
متن کاملTowards declarative diagnosis of constraint programs over finite domains
The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical framework for domain reduction, explanations are proof trees explaining value removals. These proof trees are defined by inductive definitions which express the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80695-9