M. Alpuente, F. J. Correa, and M. Falaschi. Debugging Scheme of Functional Logic Programs. In M. Hanus, editor, Proc. of International Workshop on Functional and (Constraint) Logic Programming, WFLP'01, volume 64 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Debugging Scheme for Functional Logic Programs - Alpuente, Correa, Falaschi (2002) (1 citation) Self-citation (Alpuente Correa Falaschi) (Correct)
....framework some preliminary techniques for correcting bugs. A prototype implementation of the method is described in Section 8. Section 9 concludes. We also include an Appendix where we show a debugging session of our prototype implementation, Buggy. More details and missing proofs can be found in [3]. 2 Preliminaries Let us briefly recall some known results about rewrite systems [13,38] and functional logic programming (see [34,37] for extensive surveys) For simplicity, definitions are given in the one sorted case. The extension to many sorted signatures is straightforward, see [45] ....
M. Alpuente, F. Correa, and M. Falaschi. A Debugging Scheme for Functional Logic Programs. Technical Report DSIC-II/10/02, UPV, 2002. Available at URL: http://www.dsic.upv.es/users/elp/papers.html.
Correction of Functional Logic Programs - Alpuente, Ballis, Correa, Falaschi (2003) Self-citation (Alpuente Correa Falaschi) (Correct)
....a program R, we can check the correctness of R w.r.t. I by a single step of a (continuous) immediate consequence operator which we associate to our programs. This speci cation I may be partial or complete, and can be expressed in several ways: for instance, by (another) functional logic program [7, 3], by an assertion language [12] or by equation sets (in the case when it is nite) Our methodology is based on abstract interpretation: we construct over and under speci cations I and I to correctly over (resp. under ) approximate the intended This work has been partially supported by ....
....the immediate consequence operator, and by a simple static test we can determine whether some of the clauses are wrong. The debugging system Buggy[4] is an experimental implementation of the method which allows the user to specify the (concrete) semantics by means of a functional logic program. In [3], we also presented a preliminary correction algorithm based on the deductive synthesis methodology known as example guided unfolding [10] This methodology uses unfolding in order to discriminate positive from negative examples (resp. uncovered and incorrect equations) which are essentially ....
[Article contains additional citation context not shown here]
M. Alpuente, F. J. Correa, and M. Falaschi. Debugging Scheme of Functional Logic Programs. In M. Hanus, editor, Proc. of International Workshop on Functional and (Constraint) Logic Programming, WFLP'01, volume 64 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002.
A Memoizing Semantics for - Functional Logic Languages (Correct)
No context found.
M. Alpuente, F. J. Correa, and M. Falaschi. Debugging Scheme of Functional Logic Programs. In M. Hanus, editor, Proc. of International Workshop on Functional and (Constraint) Logic Programming, WFLP'01, volume 64 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC