A logic programming approach to the verification of functional-logic programs

Proceedings of the Sixth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'04

Volumn , Issue , 2004, Pages 9-19

  Cleva, José Miguel ^a   Leach, Javier ^a   López Fraguas, Francisco J ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Functional logic programming; Logic programming; Verification

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; MATHEMATICAL MODELS; PROGRAM DEBUGGING; SEMANTICS; SOFTWARE ENGINEERING;

ABSTRACT INTERPRETATION; CONSTRUCTOR-BASED REWRITING LOGIC (CRWL); FUNCTIONAL LOGIC PROGRAMMING (FLP); VERIFICATION;

LOGIC PROGRAMMING;

EID: 11244296276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1013963.1013969     Document Type: Conference Paper

References (30)

1. M. Alpuente, F.J. Correa, M. Falaschi. A Debbugging Scheme of Functional Logic Programs, Proc. WFLP'01, Electronic Notes on Theoretical Computer Science, Vol 64, 2002.
2. M. Alpuente, D. Ballis, F.J. Correa, M. Falaschi Automated Correction of Functional Logic Programs, Proc. European Symp. on Programming (ESOP'03), Springer LNCS 2618, pp. 54-68, 2003.
3. S. Antoy. Optimal Non-deterministic Functional Logic Computations, Proc. ALP/HOA 1997, Springer LNCS 1298, pp. 16-30, 1997.
4. S. Antoy Constructor-based Conditional Narrowing. Proc. Principles and Practice of Declarative Programming (PPDP'01), 199-206, ACM Press, 2001.
5. K.R. Apt. Logic Programming. In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, Chapter 10, Elsevier and The MIT Press, pp. 493-574, 1990.
6. D. Bert, R. Echahed. Abstraction of Conditional Term Rewriting Systems. Proc ILPS 1995, pp. 162-176, 1995.
7. R. Caballero, F.J. López-Fraguas and M. Rodríguez-Artalejo. DDT: Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs. Proc. of the 5th International Symposium on Functional and Logic Programming (FLOPS'2001), Springer LNCS 2024, pp. 170-184, 2001.
8. R. Caballero and M. Rodríguez-Artalejo. A Declarative Debugging System for Lazy Functional Logic Programs. Electronic Notes in Theoretical Computer Science 64, 63 pages, 2002.
9. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Marti-Oliet, J. Meseguer, C. Talcott. Maude 2.0 Manual http://maude.cs.uiuc.edu, 2003.
10. M. Clavel. The ITP tool In A. Nepomuceno, J. F. Quesada, and J. Salguero, editors, Logic, Language and Information. Proc. of the 1st Workshop on Logic and Language, Kronos, 55-62, 2001. System available at http://wvw.ucm.es/info/ dsip/clavel/itp
11. H.B. Eriderton. A Mathematical Introduction to Logic, Academic Press, 2001.
12. J.C. González-Moreno, M.T. Hortalá-González, F.J. López-Fraguas and M. Rodrfguez-Artalejo. A Rewriting Logic for Declarative Programming. Proc. European Symp. on Programming (ESOP'96), Springer LNCS 1058, pp. 156-172, 1996.
13. J.C. González-Moreno, M.T. Hortalá-González, F.J. López-Fraguas and M. Rodríguez-Artalejo. An Approach to Declarative Programming Based on a Rewriting Logic. Journal of Logic Programming 40(1), pp. 47-87, 1999.
14. J.C. González-Moreno, M.T. Hortalá-González and M. Rodríguez-Artalejo. A Higher Order Rewriting Logic for Functional Logic Programming. Proc. Int. Conf. on Logic Programming, The MIT Press, pp. 153-167, 1997.
15. J.C. González-Moreno, M.T. Hortalá-González and M. Rodríguez-Artalejo. Polymorphic Types in Functional Logic Programming. FLOPS'99 special issue of the Journal of Functional and Logic Programming, 2001. http://danae.uni-muenster.de/lehre/kuchen/JFLP.
16. M.J.C. Gordon and T.F. Melham. Introduction to HOL, Cambridge Univ. Press, 1993.
17. M. Hanus (ed.), Curry: an Integrated Functional Logic Language. Version 0.8, April 15, 2003. http://www-i2.infornatik.uni-kiel.de/~curry/.
18. H. Hussmann. Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting. Journal of Logic Programming 12, pp. 237-255, 1992.
19. F.J.López Fraguas, J. Sánchez Hernández. TOY: A Multiparadigm Declarative System, Proc. RTA'99, Springer LNCS 1631, pp 244-247, 1999.
20. F.J. Lopez-Fraguas and J. Sánchez-Hernández. A Proof Theoretic Approach to Failure in Functional Logic Programming. Theory and Practice of Logic Programming 4(1), pp. 41-74, 2004.
21. J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 96, pp. 73-155, 1992.
22. T. Nipkow, L.C. Paulson, M. Wenzel. Isabelle/HOL - A Proof Assistant for Higer-Order Logic. Springer LNCS 2283, 2002.
23. P. Padawitz. Inductive Theorem Proving for Design Specifications, J. Symbolic Computation 21, 41-99, 1996.
24. P. Padawitz. Swinging Types = Functions + Relations + Transition Systems, Theoretical Computer Science 243, 93-65, 2000.
25. M. Palomino Tarjuelo. Comparing Meseguer's Rewriting Logic with the Logic CRWL. Electronic Notes in Theoretical Computer Science 64, 22 pages, 2002.
26. L.C. Paulson. Logic and Computation: Interactive Proof with Cambridge LCF, Cambridge Univ. Press, 1987.
27. D. Pedreschi, S. Ruggieri. Verification of Logic Programs. J. Log. Program. 39 (1-3), pp. 125-176, 1999.
28. M. Rodríguez-Artalejo. Functional and Constraint Logic Programming, in H. Comon, C. Marché and R. Treirien (eds.), Constraints in Computational Logics, Theory and Applications, Revised Lectures of the International Summer School CCL'99, Springer LNCS 2002, Chapter 5, pp. 202-270, 2001.
29. Jaime Sánchez-Hernández, Una Aproximación al fallo en programación declarativa multiparadigma. PhD Univ. Complutense Madrid, 2004 (in Spanish).
30. R.F. Säerk. The theoretical foundations of LPTP (A logic program theorem prover). Journal of Logic Programming 36, pp. 241-269, 1998.