Declarative debugging of rewriting logic specifications
نویسندگان
چکیده
منابع مشابه
Declarative Debugging of Rewriting Logic Specifications
Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree representing this computation and guiding the user through it to find the wrong statement. This paper presents the fundamentals for the declarative debugging of rewriting logic specifications, realized in the Maude language, wh...
متن کاملDeclarative Debugging of Membership Equational Logic Specifications
Algorithmic debugging has been applied to many declarative programming paradigms; in this paper, it is applied to the rewriting paradigm embodied in Maude. We introduce a declarative debugger for executable specifications in membership equational logic which correspond to Maude functional modules. Declarative debugging is based on the construction and navigation of a debugging tree which logica...
متن کاملDeclarative Debugging of Missing Answers in Rewriting Logic∗
Rewriting logic is a logic of change, where rewrites correspond to transitions between states. One of the main characteristics of these transitions is that they can be nondeterministic, that is, given an initial state, there is a set of possible reachable states. Thus, an additional problem when debugging rewrite systems is that, although all the terms obtained could be correct, it is possible ...
متن کاملDebugging Logic Programs Using Specifications
Logic programming has gained in popularity" in recent years. This style of programming, using Horn clauses to express procedural information, allows one to reason easily about the effects of executing program statements. We present a methodology for reasoning about the relationship between logic programs and their specifications, to help debug erronneous programs. To Mlow for debugging, the spe...
متن کاملDeclarative Debugging of Functional Logic Programs
We present a general framework for the declarative debugging of functional logic programs, which is valid both for eager as well as lazy programs. We associate with our programs a semantics based on a (continuous) immediate consequence operator which models computed answers. Then we show that, given the intended speciication of a program P, it is possible to check the correctness of P by a sing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2012
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2011.06.004