An integrated framework for the diagnosis and correction of rule-based programs

We present a generic scheme for the declarative debugging of programs that are written in rewriting-based languages that are equipped with narrowing. Our aim is to provide an integrated development environment in which it is possible to debug a program and then correct it automatically. Our methodol...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 411; H. 47; S. 4055 - 4101
Hauptverfasser: Alpuente, M., Ballis, D., Correa, F., Falaschi, M.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Elsevier B.V 29.10.2010
Elsevier
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
C (programming language)
Computation
Computer science; control theory; systems
Computer simulation
Debugging
Diagnosis
Exact sciences and technology
Functional logic programming
Language theory and syntactical analysis
Mathematical models
Methodology
Miscellaneous
Narrowing
Program transformation
Programming theory
Semantics
Theoretical computing
Workability
Narrowing
Debugging
Program transformation
Functional logic programming
Evaluation
Approximate method
User
Error estimation
Computer theory
Methodology
Induction
Rewriting
Check
Unfolding
Program correctness
Program specification
Implementation
Environment
Diagnosis
Functional programming
Repair
Symptoms
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We present a generic scheme for the declarative debugging of programs that are written in rewriting-based languages that are equipped with narrowing. Our aim is to provide an integrated development environment in which it is possible to debug a program and then correct it automatically. Our methodology is based on the combination (in a single framework) of a semantics-based diagnoser that identifies those parts of the code that contain errors and an inductive learner that tries to repair them, once the bugs have been located in the program. We develop our methodology in several steps. First, we associate with our programs a semantics that is based on a (continuous) immediate consequence operator, T R , which models the answers computed by narrowing and is parametric w.r.t. the evaluation strategy, which can be eager or lazy. Then, we show that, given the intended specification of a program R , it is possible to check the correctness of R by a single step of T R . In order to develop an effective debugging method, we approximate the computed answers semantics of R and derive a finitely terminating bottom-up abstract diagnosis method, which can be used statically. Finally, a bug-correction program synthesis methodology attempts to correct the erroneous components of the wrong code. We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), correction approach that is driven by a set of evidence examples which are automatically produced as an outcome by the diagnoser. The resulting program is proven to be correct and complete w.r.t. the considered example sets. Our debugging framework does not require the user to provide error symptoms in advance or to answer difficult questions concerning program correctness. An implementation of our debugging system has been undertaken which demonstrates the workability of our approach.
AbstractList We present a generic scheme for the declarative debugging of programs that are written in rewriting-based languages that are equipped with narrowing. Our aim is to provide an integrated development environment in which it is possible to debug a program and then correct it automatically. Our methodology is based on the combination (in a single framework) of a semantics-based diagnoser that identifies those parts of the code that contain errors and an inductive learner that tries to repair them, once the bugs have been located in the program. We develop our methodology in several steps. First, we associate with our programs a semantics that is based on a (continuous) immediate consequence operator, T R , which models the answers computed by narrowing and is parametric w.r.t. the evaluation strategy, which can be eager or lazy. Then, we show that, given the intended specification of a program R , it is possible to check the correctness of R by a single step of T R . In order to develop an effective debugging method, we approximate the computed answers semantics of R and derive a finitely terminating bottom-up abstract diagnosis method, which can be used statically. Finally, a bug-correction program synthesis methodology attempts to correct the erroneous components of the wrong code. We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), correction approach that is driven by a set of evidence examples which are automatically produced as an outcome by the diagnoser. The resulting program is proven to be correct and complete w.r.t. the considered example sets. Our debugging framework does not require the user to provide error symptoms in advance or to answer difficult questions concerning program correctness. An implementation of our debugging system has been undertaken which demonstrates the workability of our approach.
We present a generic scheme for the declarative debugging of programs that are written in rewriting-based languages that are equipped with narrowing. Our aim is to provide an integrated development environment in which it is possible to debug a program and then correct it automatically. Our methodology is based on the combination (in a single framework) of a semantics-based diagnoser that identifies those parts of the code that contain errors and an inductive learner that tries to repair them, once the bugs have been located in the program. We develop our methodology in several steps. First, we associate with our programs a semantics that is based on a (continuous) immediate consequence operator, T R , which models the answers computed by narrowing and is parametric w.r.t.aathe evaluation strategy, which can be eager or lazy. Then, we show that, given the intended specification of a program R , it is possible to check the correctness of R by a single step of T R . In order to develop an effective debugging method, we approximate the computed answers semantics of R and derive a finitely terminating bottom-up abstract diagnosis method, which can be used statically. Finally, a bug-correction program synthesis methodology attempts to correct the erroneous components of the wrong code. We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), correction approach that is driven by a set of evidence examples which are automatically produced as an outcome by the diagnoser. The resulting program is proven to be correct and complete w.r.t.aathe considered example sets. Our debugging framework does not require the user to provide error symptoms in advance or to answer difficult questions concerning program correctness. An implementation of our debugging system has been undertaken which demonstrates the workability of our approach.
Author Correa, F.
Ballis, D.
Falaschi, M.
Alpuente, M.
Author_xml – sequence: 1
  givenname: M.
  surname: Alpuente
  fullname: Alpuente, M.
  email: alpuente@dsic.upv.es
  organization: ELP-DSIC, Universidad Politécnica de Valencia, Valencia, Spain
– sequence: 2
  givenname: D.
  surname: Ballis
  fullname: Ballis, D.
  email: demis.ballis@dimi.uniud.it
  organization: Università di Udine, Udine, Italy
– sequence: 3
  givenname: F.
  surname: Correa
  fullname: Correa, F.
  email: fcorrea@eafit.edu.co
  organization: U. EAFIT, Medellin, Colombia
– sequence: 4
  givenname: M.
  surname: Falaschi
  fullname: Falaschi, M.
  email: moreno.falaschi@unisi.it
  organization: Università di Siena, Siena, Italy
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23347183$$DView record in Pascal Francis
BookMark eNp9kEtPAyEYRYnRxPr4Ae7YGFdTecwMQ1w1xlfSpBtdE8p8VOoUKlCN_16a1o2LsiEk91xyzxk69sEDQleUjCmh7e1ynE0aM1LeRIwJkUdoRDshK8ZkfYxGhJO64lI0p-gspSUppxHtCM0mHjufYRF1hh7bqFfwHeIHtiHi_A64d3rhQ3IJa99jE2IEk13wOFgcNwNUc50KuI6hVKzSBTqxekhwub_P0dvjw-v9czWdPb3cT6aV4Y3M1ZwJq3sjSMdoK0QvKe3mvSW8NR01VFNjZW1bLuasBkYks0zbptGs7aADZvg5utn1lo8_N5CyWrlkYBi0h7BJqqtlXebStiSv90mdjB7KQm9cUuvoVjr-KMZ5LWjHS07sciaGlCJYZVzW26k5ajcoStTWtFqqYlptTSsiVDFdSPqP_Cs_xNztGCiSvhxElYwDb6B3W8GqD-4A_QuHIZif
CODEN TCSCDI
CitedBy_id crossref_primary_10_1016_j_scico_2015_06_011
crossref_primary_10_1016_j_advengsoft_2011_05_024
Cites_doi 10.1016/0304-3975(96)00043-6
10.1145/512950.512973
10.1093/logcom/13.2.287
10.1016/0304-3975(88)90095-3
10.1007/BF03037089
10.1016/S0304-3975(99)00207-8
10.1145/274930.274933
10.1016/S0743-1066(98)10033-X
10.1145/357766.351266
10.1016/0743-1066(92)90024-W
10.1016/j.tcs.2010.05.012
10.1016/j.entcs.2009.07.013
10.1016/0743-1066(87)90001-X
10.1007/BF03038307
10.1016/0743-1066(94)00024-Z
10.1016/j.jlap.2009.08.001
10.1007/s002000100063
10.1007/s10990-007-9000-6
10.1016/S1571-0661(05)80538-9
10.1016/0743-1066(94)90028-0
10.1017/S0956796899003330
10.1016/0743-1066(94)90026-4
10.1016/0304-3975(89)90070-4
10.1145/1721654.1721675
10.1006/inco.1993.1015
10.1016/S0747-7171(06)80002-7
10.1016/0743-1066(94)90035-3
10.1016/S1571-0661(05)82552-6
10.1145/321850.321859
10.1016/S0743-1066(99)00017-5
10.1016/S0304-3975(01)00358-9
10.1145/347476.347484
10.1016/0022-0000(91)90009-T
10.1016/j.tcs.2003.10.033
10.1016/0743-1066(94)90034-5
10.1145/291891.291896
ContentType Journal Article
Copyright 2010 Elsevier B.V.
2015 INIST-CNRS
Copyright_xml – notice: 2010 Elsevier B.V.
– notice: 2015 INIST-CNRS
DBID 6I.
AAFTH
AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.tcs.2010.07.009
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
Applied Sciences
EISSN 1879-2294
EndPage 4101
ExternalDocumentID 23347183
10_1016_j_tcs_2010_07_009
S0304397510003956
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TAE
TN5
WH7
WUQ
XJT
YNT
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c359t-b27fadc70821677d9118bdf036c81c1a1cf94f637b24e2092f2af55a268e8e2c3
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000283695700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Wed Oct 01 14:18:50 EDT 2025
Mon Jul 21 09:15:10 EDT 2025
Tue Nov 18 21:46:37 EST 2025
Sat Nov 29 05:15:03 EST 2025
Fri Feb 23 02:16:38 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 47
Keywords Narrowing
Debugging
Program transformation
Functional logic programming
Evaluation
Approximate method
User
Error estimation
Computer theory
Methodology
Induction
Rewriting
Check
Unfolding
Program correctness
Program specification
Implementation
Environment
Diagnosis
Functional programming
Repair
Symptoms
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c359t-b27fadc70821677d9118bdf036c81c1a1cf94f637b24e2092f2af55a268e8e2c3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://dx.doi.org/10.1016/j.tcs.2010.07.009
PQID 849439716
PQPubID 23500
PageCount 47
ParticipantIDs proquest_miscellaneous_849439716
pascalfrancis_primary_23347183
crossref_citationtrail_10_1016_j_tcs_2010_07_009
crossref_primary_10_1016_j_tcs_2010_07_009
elsevier_sciencedirect_doi_10_1016_j_tcs_2010_07_009
PublicationCentury 2000
PublicationDate 2010-10-29
PublicationDateYYYYMMDD 2010-10-29
PublicationDate_xml – month: 10
  year: 2010
  text: 2010-10-29
  day: 29
PublicationDecade 2010
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle Theoretical computer science
PublicationYear 2010
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Naish, Barbour (br000545) 1996; 18
Hölldobler (br000445) 1989; vol. 353
Borovanský, Kirchner, Kirchner, Moreau, Ringeissen (br000180) 1998; 15
Reps, Turnidge (br000575) 1996; vol. 1110
M. Hanus, H. Kuchen, J.J. Moreno-Navarro, Curry: a truly functional logic language, in: Proc. ILPS’95 Workshop on Visions for the Future of Logic Programming, 1995, pp. 95–107.
Bostrom, Idestam-Alquist (br000200) 1999; 40
Padawitz (br000550) 1988; vol. 16
Caballero-Roldán, Rodríquez Artalejo (br000225) 2001; vol. 57
Bert, Echahed (br000160) 1995; vol. 906
Meseguer, Thati (br000515) 2007; 20
Bert, Echahed, Adi (br000165) 1996; vol. 1101
Escobar, Meseguer, Sasse (br000315) 2008
Giesl, Arts (br000365) 2001; 12
J. Hernández, M.J. Ramírez, Induction of functional logic programs, in: Proc. of the JICSLP’98 CompulogNet Area Meeting on Computational Logic and Machine Learning, 1998, pp. 49–55.
Maher (br000485) 1988
Hanus, Prehofer (br000420) 1999; 9
Alpuente, Falaschi, Vidal (br000095) 1998; 20
Codish, Falaschi, Marriott (br000260) 1991
Hanus (br000395) 2007; vol. 4670
Marlow, Iborra, Pope, Gill (br000500) 2007
.
Alpuente, Correa, Falaschi (br000040) 2001; vol. 57
Borovanský, Kirchner, Kirchner, Moreau (br000175) 2002; 285
P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proc. Fourth ACM Symp. on Principles of Programming Languages, 1977, pp. 238–252.
Alpuente, Comini, Escobar, Falaschi, Lucas (br000035) 2003; vol. 2664
Comini, Gori, Levi (br000265) 2001; vol. 40
Gill (br000370) 2001; 41
Bosco, Giovannetti, Moiso (br000185) 1988; 59
Dershowitz, Reddy (br000295) 1993; 15
Middeldorp, Hamoen (br000520) 1992; vol. 632
Caballero, Rodríguez-Artalejo, del Vado Vírseda (br000220) 2008; vol. 4989
Tamaki (br000595) 1984
Alpuente, Falaschi, Manzo (br000075) 1995; 22
Alpuente, Falaschi, Ramis, Vidal (br000085) 1994
Antoy (br000105) 2001; vol. 57
Hanus (br000390) 1994; 19, 20
Bockmayr, Werner (br000170) 1995; vol. 968
Ajiro, Ueda, Cho (br000010) 1998; vol. 1520
October 2008.
S. Hölldobler, From paramodulation to narrowing, in: Proc. 5th Int’l Conf. on Logic Programming, Seattle, 1988, pp. 327–342.
Frutos-Escrig, Fernández-Camacho (br000360) 1991; vol. 493
Cameron, García de la Banda, Marriott, Moulder (br000240) 2003
Falaschi, Levi, Martelli, Palamidessi (br000330) 1993; 103
Gramlich (br000380) 1993; vol. 656
M. Hanus, J. Koj, An integrated development environment for declarative multi-paradigm programming, in: Proc. WLPE’01, Paphos, Cyprus, 2001, pp. 1–14.
Klop (br000460) 1992
Wadler (br000605) 1998; 33
Echahed (br000300) 1988; vol. 299
Fribourg (br000355) 1985
Antoy, Echahed, Hanus (br000110) 2000; 47
M. Alpuente, F. Correa, M. Falaschi, S. Marson, The debugging system buggy. Technical report, DSIC-II/1/01, UPV, 2001. Available at URL
Antoy (br000100) 1992; vol. 632
Clavel, Durán, Eker, Escobar, Lincoln, Martí-Oliet, Meseguer, Talcott (br000250) 2009; vol. 5595
Levi, Palamidessi, Bosco, Giovannetti, Moiso (br000465) 1987
Hullot (br000450) 1980; vol. 87
Alpuente, Falaschi, Julián, Vidal (br000065) 2003; 13
Bert, Echahed (br000150) 1994; vol. 906
Meseguer (br000510) 1992; vol. 632
Slagle (br000590) 1974; 21
Haskell debugging technologies. At
Ueda, Morita (br000600) 1994; 13
Alexin, Gyimóthy, Bostrom (br000015) 1996
Caballero-Roldán, López-Fraguas, Rodríquez Artalejo (br000230) 2001; vol. 2024
Arts, Giesl (br000130) 2000; 236
Deransart, Hermenegildo, Maluszynski (br000290) 2000; vol. 1870
Pettorossi, Proietti (br000555) 1994; 19, 20
Ajiro, Ueda (br000005) 2002; vol. 19
Echahed (br000305) 1992; vol. 632
P. Arenas, A. Gil, A debugging model for lazy functional languages, Technical Report DIA 94/6, Universidad Complutense de Madrid, April 1994.
Alpuente, Falaschi, Manzo (br000070) 1992; vol. 631
Shaphiro (br000585) 1982
Maher (br000490) 1988
Caballero, Martí-Oliet, Riesco, Verdejo (br000215) 2008
C. Ferri, J. Hernández, M.J. Ramírez, The FLIP system homepage, 2000. Available at
Alpuente, Ballis, Falaschi (br000025) 2010; vol. 6125
Bert, Echahed (br000155) 1995
Hanus (br000385) 1990; vol. 456
M.J. Maher, On parameterized substitutions, Technical Report RC 16042, IBM - T.J. Watson Research Center, Yorktown Heights, NY, 1990.
Clavel, Durán, Eker, Lincoln, Martí-Oliet, Meseguer, Talcott (br000255) 2007
Falaschi, Levi, Martelli, Palamidessi (br000325) 1989; 69
M. Alpuente, S. Escobar, J. Iborra, Termination of narrowing with dependency pairs, in: Maria Garcia de la Banda, Enrico Pontelli (Eds.), Proceedings of the 24th International Conference on Logic Programming, ICLP’08, in: Lecture Notes in Computer Science, vol. 5366, 2008, pp. 317–331.
Ferrand (br000340) 1987; 4
Lloyd (br000470) 1998; 15
Baader, Nipkow (br000135) 1998
Alpuente, Escobar, Meseguer, Ojeda (br000060) 2009; 246
F. Schernhammer, B. Gramlich, Characterizing and proving operational termination of deterministic conditional term rewriting systems, Journal of Logic and Algebraic Programming, 2010 (in press).
Alpuente, Falaschi, Moreno, Vidal (br000080) 2004; 311
Muggleton, de Raedt (br000535) 1994; 19, 20
Bossi, Gabbrielli, Levi, Martelli (br000190) 1994; 19–20
Comini, Levi, Vitiello (br000275) 1995
Hernández, Ramírez (br000435) 1999; vol. 1634
Moreno-Navarro, Rodríguez-Artalejo (br000525) 1992; 12
Muggleton (br000530) 1991; 8
Hanus (br000400) 2008
Zartmann (br000610) 1997; vol. 1302
Reddy (br000565) 1985
Alpuente, Comini, Escobar, Falaschi (br000030) 2010; 411
H. Bostrom, P. Idestam-Alquist, Specialization of logic programs by pruning sld-trees, in: Proc of 4th Int’l Workshop on Inductive Logic Programming, ILP-94, 1994, pp. 31–47.
Lloyd (br000475) 1984
N. Martí-Oliet, A. Riesco, A. Verdejo, Declarative debugging of missing answers for Maude specifications, in: Proc. RTA 2010, in: Leibniz International Proceedings in Informatics, vol. 6, 2010, pp. 277–294.
Falaschi, Levi, Martelli, Palamidessi (br000320) 1988
M. Fay, First order unification in an equational theory, in: Proc of 4th Int’l Conf. on Automated Deduction, CADE’79, 1979, pp. 161–167.
Claessen, Hughes (br000245) 2000; 35
S. Antoy, S. Johnson, TeaBag: a functional logic debugger, in: H. Kuchen (Eds.), Proc. 13th Int’l Workshop on Functional and (Constraint) Logic Programming, WFLP 2004, 2004, pp. 4–18.
Pettorossi, Proietti (br000560) 1998; vol. 5
López-Fraguas, Sánchez Hernández (br000480) 1999
F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M Hermenegildo, J. Maluszyński, G. Puebla, On the role of semantic approximations in validation and diagnosis of constraint logic programs, in: Proc. 3rd. Int’l Workshop on Automated Debugging, AADEBUG’97, U. of Linkoping, 1997, pp. 155–170.
Kirchner, Kirchner, de Oliveira (br000455) 2008
Antoy, Hanus (br000115) 2010; 53
S. Escobar, J. Meseguer, R. Sasse, Effectively checking or disproving the finite variant property, in: Proc. RTA’08. Springer LNCS, vol. 5117, 2008, pp. 79–93.
Comini, Levi, Meo, Vitiello (br000270) 1999; 39
(br000285) 1986
Alpuente, Ballis, Correa, Falaschi (br000020) 2003; vol. 2618
Caballero-Roldán, López-Fraguas, Rodríquez Artalejo (br000235) 2002; vol. 76
Alpuente, Falaschi, Vidal (br000090) 1996; 165
Giovannetti, Levi, Moiso, Palamidessi (br000375) 1991; 42
Hanus, Josephs (br000405) 1993; vol. 714
Ferri, Hernández, Ramírez (br000350) 2001; vol. 2024
Braßel, Chitil, Hanus, Huch (br000205) 2004; vol. 3057
G. Bacci, M. Comini, Abstract diagnosis of first order functional logic programs, in: M. Alpuente (Eds.), Pre-Proc. LOPSTR 2010, RISC Technical Report 10–14, 2010, pp. 58–72.
Naish (br000540) 1997; 1997
Reddy (br000570) 1995
Bert, Echahed (br000145) 1986; vol. 213
Alpuente, Correa, Falaschi (br000045) 2002; vol. 64
Giovannetti (10.1016/j.tcs.2010.07.009_br000375) 1991; 42
Clavel (10.1016/j.tcs.2010.07.009_br000255) 2007
Alpuente (10.1016/j.tcs.2010.07.009_br000075) 1995; 22
Ferri (10.1016/j.tcs.2010.07.009_br000350) 2001; vol. 2024
10.1016/j.tcs.2010.07.009_br000425
Hanus (10.1016/j.tcs.2010.07.009_br000400) 2008
Pettorossi (10.1016/j.tcs.2010.07.009_br000555) 1994; 19, 20
Maher (10.1016/j.tcs.2010.07.009_br000485) 1988
10.1016/j.tcs.2010.07.009_br000140
Moreno-Navarro (10.1016/j.tcs.2010.07.009_br000525) 1992; 12
Echahed (10.1016/j.tcs.2010.07.009_br000300) 1988; vol. 299
Hernández (10.1016/j.tcs.2010.07.009_br000435) 1999; vol. 1634
Ajiro (10.1016/j.tcs.2010.07.009_br000005) 2002; vol. 19
Clavel (10.1016/j.tcs.2010.07.009_br000250) 2009; vol. 5595
Lloyd (10.1016/j.tcs.2010.07.009_br000475) 1984
Meseguer (10.1016/j.tcs.2010.07.009_br000510) 1992; vol. 632
Antoy (10.1016/j.tcs.2010.07.009_br000100) 1992; vol. 632
Reddy (10.1016/j.tcs.2010.07.009_br000565) 1985
Alpuente (10.1016/j.tcs.2010.07.009_br000045) 2002; vol. 64
Middeldorp (10.1016/j.tcs.2010.07.009_br000520) 1992; vol. 632
Antoy (10.1016/j.tcs.2010.07.009_br000105) 2001; vol. 57
10.1016/j.tcs.2010.07.009_br000415
Alpuente (10.1016/j.tcs.2010.07.009_br000020) 2003; vol. 2618
Fribourg (10.1016/j.tcs.2010.07.009_br000355) 1985
Bert (10.1016/j.tcs.2010.07.009_br000150) 1994; vol. 906
Caballero-Roldán (10.1016/j.tcs.2010.07.009_br000235) 2002; vol. 76
10.1016/j.tcs.2010.07.009_br000410
10.1016/j.tcs.2010.07.009_br000495
Reddy (10.1016/j.tcs.2010.07.009_br000570) 1995
Alexin (10.1016/j.tcs.2010.07.009_br000015) 1996
Borovanský (10.1016/j.tcs.2010.07.009_br000175) 2002; 285
Bosco (10.1016/j.tcs.2010.07.009_br000185) 1988; 59
Tamaki (10.1016/j.tcs.2010.07.009_br000595) 1984
Falaschi (10.1016/j.tcs.2010.07.009_br000330) 1993; 103
Muggleton (10.1016/j.tcs.2010.07.009_br000535) 1994; 19, 20
Alpuente (10.1016/j.tcs.2010.07.009_br000035) 2003; vol. 2664
Caballero (10.1016/j.tcs.2010.07.009_br000215) 2008
Hanus (10.1016/j.tcs.2010.07.009_br000385) 1990; vol. 456
Padawitz (10.1016/j.tcs.2010.07.009_br000550) 1988; vol. 16
Naish (10.1016/j.tcs.2010.07.009_br000545) 1996; 18
Dershowitz (10.1016/j.tcs.2010.07.009_br000295) 1993; 15
10.1016/j.tcs.2010.07.009_br000440
Bockmayr (10.1016/j.tcs.2010.07.009_br000170) 1995; vol. 968
10.1016/j.tcs.2010.07.009_br000280
Bert (10.1016/j.tcs.2010.07.009_br000155) 1995
Comini (10.1016/j.tcs.2010.07.009_br000265) 2001; vol. 40
Braßel (10.1016/j.tcs.2010.07.009_br000205) 2004; vol. 3057
López-Fraguas (10.1016/j.tcs.2010.07.009_br000480) 1999
Comini (10.1016/j.tcs.2010.07.009_br000270) 1999; 39
Alpuente (10.1016/j.tcs.2010.07.009_br000030) 2010; 411
Caballero-Roldán (10.1016/j.tcs.2010.07.009_br000230) 2001; vol. 2024
Bossi (10.1016/j.tcs.2010.07.009_br000190) 1994; 19–20
Antoy (10.1016/j.tcs.2010.07.009_br000110) 2000; 47
Bert (10.1016/j.tcs.2010.07.009_br000145) 1986; vol. 213
Baader (10.1016/j.tcs.2010.07.009_br000135) 1998
10.1016/j.tcs.2010.07.009_br000310
10.1016/j.tcs.2010.07.009_br000430
Meseguer (10.1016/j.tcs.2010.07.009_br000515) 2007; 20
Marlow (10.1016/j.tcs.2010.07.009_br000500) 2007
Alpuente (10.1016/j.tcs.2010.07.009_br000085) 1994
Caballero-Roldán (10.1016/j.tcs.2010.07.009_br000225) 2001; vol. 57
(10.1016/j.tcs.2010.07.009_br000285) 1986
Escobar (10.1016/j.tcs.2010.07.009_br000315) 2008
Gramlich (10.1016/j.tcs.2010.07.009_br000380) 1993; vol. 656
10.1016/j.tcs.2010.07.009_br000345
Shaphiro (10.1016/j.tcs.2010.07.009_br000585) 1982
Hullot (10.1016/j.tcs.2010.07.009_br000450) 1980; vol. 87
Zartmann (10.1016/j.tcs.2010.07.009_br000610) 1997; vol. 1302
Alpuente (10.1016/j.tcs.2010.07.009_br000040) 2001; vol. 57
Bert (10.1016/j.tcs.2010.07.009_br000160) 1995; vol. 906
10.1016/j.tcs.2010.07.009_br000580
Alpuente (10.1016/j.tcs.2010.07.009_br000095) 1998; 20
Echahed (10.1016/j.tcs.2010.07.009_br000305) 1992; vol. 632
Pettorossi (10.1016/j.tcs.2010.07.009_br000560) 1998; vol. 5
Bostrom (10.1016/j.tcs.2010.07.009_br000200) 1999; 40
Lloyd (10.1016/j.tcs.2010.07.009_br000470) 1998; 15
Kirchner (10.1016/j.tcs.2010.07.009_br000455) 2008
Borovanský (10.1016/j.tcs.2010.07.009_br000180) 1998; 15
Deransart (10.1016/j.tcs.2010.07.009_br000290) 2000; vol. 1870
Alpuente (10.1016/j.tcs.2010.07.009_br000060) 2009; 246
Alpuente (10.1016/j.tcs.2010.07.009_br000090) 1996; 165
10.1016/j.tcs.2010.07.009_br000335
Claessen (10.1016/j.tcs.2010.07.009_br000245) 2000; 35
10.1016/j.tcs.2010.07.009_br000055
10.1016/j.tcs.2010.07.009_br000210
Falaschi (10.1016/j.tcs.2010.07.009_br000325) 1989; 69
Alpuente (10.1016/j.tcs.2010.07.009_br000070) 1992; vol. 631
Arts (10.1016/j.tcs.2010.07.009_br000130) 2000; 236
10.1016/j.tcs.2010.07.009_br000050
Wadler (10.1016/j.tcs.2010.07.009_br000605) 1998; 33
Antoy (10.1016/j.tcs.2010.07.009_br000115) 2010; 53
Comini (10.1016/j.tcs.2010.07.009_br000275) 1995
Hanus (10.1016/j.tcs.2010.07.009_br000405) 1993; vol. 714
Klop (10.1016/j.tcs.2010.07.009_br000460) 1992
Hanus (10.1016/j.tcs.2010.07.009_br000390) 1994; 19, 20
Reps (10.1016/j.tcs.2010.07.009_br000575) 1996; vol. 1110
10.1016/j.tcs.2010.07.009_br000125
Codish (10.1016/j.tcs.2010.07.009_br000260) 1991
Alpuente (10.1016/j.tcs.2010.07.009_br000025) 2010; vol. 6125
Bert (10.1016/j.tcs.2010.07.009_br000165) 1996; vol. 1101
Falaschi (10.1016/j.tcs.2010.07.009_br000320) 1988
10.1016/j.tcs.2010.07.009_br000120
Hölldobler (10.1016/j.tcs.2010.07.009_br000445) 1989; vol. 353
Slagle (10.1016/j.tcs.2010.07.009_br000590) 1974; 21
Maher (10.1016/j.tcs.2010.07.009_br000490) 1988
Hanus (10.1016/j.tcs.2010.07.009_br000420) 1999; 9
Ferrand (10.1016/j.tcs.2010.07.009_br000340) 1987; 4
Gill (10.1016/j.tcs.2010.07.009_br000370) 2001; 41
Ajiro (10.1016/j.tcs.2010.07.009_br000010) 1998; vol. 1520
Frutos-Escrig (10.1016/j.tcs.2010.07.009_br000360) 1991; vol. 493
Giesl (10.1016/j.tcs.2010.07.009_br000365) 2001; 12
Hanus (10.1016/j.tcs.2010.07.009_br000395) 2007; vol. 4670
Cameron (10.1016/j.tcs.2010.07.009_br000240) 2003
Alpuente (10.1016/j.tcs.2010.07.009_br000080) 2004; 311
10.1016/j.tcs.2010.07.009_br000505
Alpuente (10.1016/j.tcs.2010.07.009_br000065) 2003; 13
Levi (10.1016/j.tcs.2010.07.009_br000465) 1987
Caballero (10.1016/j.tcs.2010.07.009_br000220) 2008; vol. 4989
Muggleton (10.1016/j.tcs.2010.07.009_br000530) 1991; 8
Ueda (10.1016/j.tcs.2010.07.009_br000600) 1994; 13
10.1016/j.tcs.2010.07.009_br000195
Naish (10.1016/j.tcs.2010.07.009_br000540) 1997; 1997
References_xml – start-page: 1
  year: 1992
  end-page: 112
  ident: br000460
  article-title: Term Rewriting Systems
  publication-title: Handbook of Logic in Computer Science, vol. I
– volume: 21
  start-page: 622
  year: 1974
  end-page: 642
  ident: br000590
  article-title: Automated theorem-proving for theories with simplifiers, commutativity and associativity
  publication-title: Journal of the ACM
– volume: vol. 1520
  start-page: 40
  year: 1998
  end-page: 54
  ident: br000010
  article-title: Error correcting source code
  publication-title: Proc. Int’l Conf. on Principle and Practice of Constraint Programming
– reference: M. Alpuente, S. Escobar, J. Iborra, Termination of narrowing with dependency pairs, in: Maria Garcia de la Banda, Enrico Pontelli (Eds.), Proceedings of the 24th International Conference on Logic Programming, ICLP’08, in: Lecture Notes in Computer Science, vol. 5366, 2008, pp. 317–331.
– start-page: 162
  year: 1995
  end-page: 176
  ident: br000155
  article-title: Abstraction of conditional term rewriting systems
  publication-title: Proc. ILPS’95
– volume: vol. 632
  start-page: 259
  year: 1992
  end-page: 275
  ident: br000305
  article-title: Uniform narrowing strategies
  publication-title: Proc. ICALP’92
– volume: vol. 456
  start-page: 387
  year: 1990
  end-page: 401
  ident: br000385
  article-title: Compiling logic programs with equality
  publication-title: Proc. 2nd Int’l Workshop on Programming Language Implementation and Logic Programming
– volume: vol. 906
  start-page: 132
  year: 1994
  end-page: 152
  ident: br000150
  article-title: On the operational semantics of the algebraic and logic programming language LPG
  publication-title: COMPASS/ADT
– volume: vol. 631
  start-page: 443
  year: 1992
  end-page: 457
  ident: br000070
  article-title: Analyses of inconsistency for incremental equational logic programming
  publication-title: Proc. PLILP’92, Leuven (Belgium)
– reference: P. Arenas, A. Gil, A debugging model for lazy functional languages, Technical Report DIA 94/6, Universidad Complutense de Madrid, April 1994.
– volume: 35
  start-page: 268
  year: 2000
  end-page: 279
  ident: br000245
  article-title: QuickCheck: a lightweight tool for random testing of haskell programs
  publication-title: ACM SIGPLAN Notices
– volume: vol. 2024
  start-page: 233
  year: 2001
  end-page: 247
  ident: br000350
  article-title: Incremental learning of functional logic programs
  publication-title: 5th Int’l Symp. on Functional and Logic Programming
– volume: 15
  start-page: 467
  year: 1993
  end-page: 494
  ident: br000295
  article-title: Deductive and inductive synthesis of equational programs
  publication-title: Journal of Symbolic Computation
– reference: , October 2008.
– year: 2008
  ident: br000455
  article-title: Analysis of rewrite-based access control policies
  publication-title: Proc. 3rd Int’l Workshop on Security and Rewriting Techniques
– start-page: 627
  year: 1988
  end-page: 658
  ident: br000490
  article-title: Equivalences of logic programs
  publication-title: Foundations of Deductive Databases and Logic Programming
– reference: S. Escobar, J. Meseguer, R. Sasse, Effectively checking or disproving the finite variant property, in: Proc. RTA’08. Springer LNCS, vol. 5117, 2008, pp. 79–93.
– reference: C. Ferri, J. Hernández, M.J. Ramírez, The FLIP system homepage, 2000. Available at:
– reference: M. Alpuente, F. Correa, M. Falaschi, S. Marson, The debugging system buggy. Technical report, DSIC-II/1/01, UPV, 2001. Available at URL:
– volume: 41
  start-page: 1
  year: 2001
  ident: br000370
  article-title: Debugging haskell by observing intermediate data structures
  publication-title: Proceedings 2000 ACM SIGPLAN Haskell Workshop
– volume: vol. 4670
  start-page: 45
  year: 2007
  end-page: 75
  ident: br000395
  article-title: Multi-paradigm declarative languages (invited tutorial)
  publication-title: Proc. of International Conference on Logic Programming
– volume: 8
  start-page: 295
  year: 1991
  end-page: 318
  ident: br000530
  article-title: Inductive logic programming
  publication-title: New Generation Computing
– volume: 19, 20
  start-page: 583
  year: 1994
  end-page: 628
  ident: br000390
  article-title: The integration of functions into logic programming: from theory to practice
  publication-title: Journal of Logic Programming
– reference: Haskell debugging technologies. At
– volume: 13
  start-page: 287
  year: 2003
  end-page: 312
  ident: br000065
  article-title: Uniform lazy narrowing
  publication-title: Journal of Logic and Computation
– volume: 285
  start-page: 155
  year: 2002
  end-page: 185
  ident: br000175
  article-title: ELAN from a rewriting logic point of view
  publication-title: Theoretical Computer Science
– volume: vol. 19
  start-page: 67
  year: 2002
  end-page: 94
  ident: br000005
  article-title: Kima — an automated error correction system for concurrent logic programs
  publication-title: Automated Software Engineering
– start-page: 627
  year: 1995
  end-page: 628
  ident: br000570
  article-title: Bridging the gap between logic and functional programming
  publication-title: Proc. ILPS’95
– start-page: 138
  year: 1985
  end-page: 151
  ident: br000565
  article-title: Narrowing as the operational semantics of functional languages
  publication-title: Proc. Second IEEE Int’l Symp. on Logic Programming
– volume: vol. 3057
  start-page: 193
  year: 2004
  end-page: 208
  ident: br000205
  article-title: Observing functional logic computations
  publication-title: Proc. PADL’04
– reference: .
– year: 1982
  ident: br000585
  article-title: Algorithmic Program Debugging
– volume: vol. 656
  start-page: 128
  year: 1993
  end-page: 142
  ident: br000380
  article-title: Sufficient conditions for modular termination of conditional term rewriting systems
  publication-title: Conditional Term Rewriting Systems, Third International Workshop
– volume: 4
  start-page: 177
  year: 1987
  end-page: 198
  ident: br000340
  article-title: Error diagnosis in logic programming, and adaptation of E.Y.Shapiro’s method
  publication-title: Journal of Logic Programming
– volume: vol. 1110
  start-page: 409
  year: 1996
  end-page: 429
  ident: br000575
  article-title: Program specialization via program slicing
  publication-title: Partial Evaluation, International Seminar
– volume: 20
  start-page: 768
  year: 1998
  end-page: 844
  ident: br000095
  article-title: Partial evaluation of functional logic programs
  publication-title: ACM Transactions on Programming Languages and Systems
– reference: M. Fay, First order unification in an equational theory, in: Proc of 4th Int’l Conf. on Automated Deduction, CADE’79, 1979, pp. 161–167.
– reference: M. Hanus, J. Koj, An integrated development environment for declarative multi-paradigm programming, in: Proc. WLPE’01, Paphos, Cyprus, 2001, pp. 1–14.
– volume: vol. 632
  start-page: 143
  year: 1992
  end-page: 157
  ident: br000100
  article-title: Definitional trees
  publication-title: Proc. the 3rd Int’l Conf. on Algebraic and Logic Programming
– volume: vol. 632
  start-page: 244
  year: 1992
  end-page: 258
  ident: br000520
  article-title: Counterexamples to completeness results for basic narrowing
  publication-title: Proc. Third Int’l Conf. on Algebraic and Logic Programming
– volume: vol. 16
  year: 1988
  ident: br000550
  publication-title: Computing in Horn Clause Theories
– volume: 411
  start-page: 3348
  year: 2010
  end-page: 3371
  ident: br000030
  article-title: A compact fixpoint semantics for term rewriting systems
  publication-title: Theoretical Computer Science
– volume: 15
  year: 1998
  ident: br000470
  article-title: Debugging for a declarative programming language
  publication-title: Machine Intelligence
– volume: vol. 5
  start-page: 697
  year: 1998
  end-page: 787
  ident: br000560
  article-title: Transformation of logic programs
  publication-title: Handbook of Logic in Artificial Intelligence
– volume: 22
  start-page: 221
  year: 1995
  end-page: 252
  ident: br000075
  article-title: Analyses of unsatisfiability for equational logic programming
  publication-title: Journal of Logic Programming
– volume: 69
  start-page: 289
  year: 1989
  end-page: 318
  ident: br000325
  article-title: Declarative modeling of the operational behavior of logic languages
  publication-title: Theoretical Computer Science
– volume: 12
  start-page: 191
  year: 1992
  end-page: 224
  ident: br000525
  article-title: Logic programming with functions and predicates: the language Babel
  publication-title: Journal of Logic Programming
– reference: H. Bostrom, P. Idestam-Alquist, Specialization of logic programs by pruning sld-trees, in: Proc of 4th Int’l Workshop on Inductive Logic Programming, ILP-94, 1994, pp. 31–47.
– start-page: 259
  year: 1984
  end-page: 264
  ident: br000595
  article-title: Semantics of a logic programming language with a reducibility predicate
  publication-title: Proc. First IEEE Int’l Symp. on Logic Programming
– volume: vol. 2618
  start-page: 54
  year: 2003
  end-page: 68
  ident: br000020
  article-title: Automated correction of functional logic programs
  publication-title: Proc. European Symp. on Programming ESOP 2003
– volume: vol. 64
  year: 2002
  ident: br000045
  article-title: A debugging scheme for functional logic programs
  publication-title: Proc. 10th Int’l Workshop on Functional and (Constraint) Logic Programming
– volume: 236
  start-page: 133
  year: 2000
  end-page: 178
  ident: br000130
  article-title: Termination of Term Rewriting using Dependency Pairs
  publication-title: Theoretical Computer Science
– year: 1996
  ident: br000015
  article-title: Integrating algorithmic debugging and unfolding transformation in an interactive learner
  publication-title: Proc. European Conf. on Artificial Intelligence
– reference: M. Hanus, H. Kuchen, J.J. Moreno-Navarro, Curry: a truly functional logic language, in: Proc. ILPS’95 Workshop on Visions for the Future of Logic Programming, 1995, pp. 95–107.
– volume: vol. 2024
  start-page: 170
  year: 2001
  end-page: 184
  ident: br000230
  article-title: Theoretical foundations for the declarative debugging of lazy functional logic programs
  publication-title: Fifth Int’l Symp. on Functional and Logic Programming
– volume: vol. 40
  year: 2001
  ident: br000265
  article-title: Assertion based inductive verification methods for logic programs
  publication-title: Proc. MFCSIT’2000
– volume: vol. 57
  year: 2001
  ident: br000040
  article-title: Declarative debugging of functional logic programs
  publication-title: Proc. Int’l Workshop on Reduction Strategies in Rewriting and Programming
– volume: vol. 5595
  start-page: 380
  year: 2009
  end-page: 390
  ident: br000250
  article-title: Unification and narrowing in Maude 2.4
  publication-title: Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29–July 1, 2009, Proceedings
– year: 2008
  ident: br000315
  article-title: Variant narrowing and equational unification
  publication-title: Proc. 7th Int’l Workshop on Rewriting Logic and its Applications
– start-page: 67
  year: 2008
  end-page: 78
  ident: br000400
  article-title: Call pattern analysis for functional logic programs
  publication-title: Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming
– volume: vol. 1101
  start-page: 629
  year: 1996
  end-page: 632
  ident: br000165
  article-title: Resolution of goals with the functional and logic programming language LPG: impact of abstract interpretation
  publication-title: Proc. AMAST’96
– volume: 20
  start-page: 123
  year: 2007
  end-page: 160
  ident: br000515
  article-title: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
  publication-title: Higher-Order and Symbolic Computation
– volume: vol. 57
  year: 2001
  ident: br000105
  article-title: Evaluation strategies for functional logic programming
  publication-title: Int’l Workshop on Reduction Strategies in Rewriting and Programming WRS’01
– reference: F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M Hermenegildo, J. Maluszyński, G. Puebla, On the role of semantic approximations in validation and diagnosis of constraint logic programs, in: Proc. 3rd. Int’l Workshop on Automated Debugging, AADEBUG’97, U. of Linkoping, 1997, pp. 155–170.
– volume: 1997
  year: 1997
  ident: br000540
  article-title: A declarative debugging scheme
  publication-title: Journal of Functional and Logic Programming
– volume: 13
  start-page: 3
  year: 1994
  end-page: 43
  ident: br000600
  article-title: Moded flat GHC and its message-oriented implementation technique
  publication-title: New Generation Computing
– volume: 19, 20
  start-page: 629
  year: 1994
  end-page: 679
  ident: br000535
  article-title: Inductive logic programming: theory and methods
  publication-title: Journal of Logic Programming
– volume: 18
  start-page: 401
  year: 1996
  end-page: 408
  ident: br000545
  article-title: Towards a portable lazy functional declarative debugger
  publication-title: Australian Computer Science Communications
– start-page: 275
  year: 1995
  end-page: 287
  ident: br000275
  article-title: Declarative diagnosis revisited
  publication-title: Proc. 1995 Int’l Symp. on Logic Programming
– reference: G. Bacci, M. Comini, Abstract diagnosis of first order functional logic programs, in: M. Alpuente (Eds.), Pre-Proc. LOPSTR 2010, RISC Technical Report 10–14, 2010, pp. 58–72.
– start-page: 993
  year: 1988
  end-page: 1005
  ident: br000320
  article-title: A new declarative semantics for logic languages
  publication-title: Proc. Fifth Int’l Conf. on Logic Programming
– year: 1998
  ident: br000135
  article-title: Term Rewriting and All That
– volume: 19, 20
  start-page: 261
  year: 1994
  end-page: 320
  ident: br000555
  article-title: Transformation of logic programs: foundations and techniques
  publication-title: Journal of Logic Programming
– reference: M.J. Maher, On parameterized substitutions, Technical Report RC 16042, IBM - T.J. Watson Research Center, Yorktown Heights, NY, 1990.
– volume: 15
  year: 1998
  ident: br000180
  article-title: An overview of Elan
  publication-title: Electronic Notes in Theoretical Computer Science
– volume: 59
  start-page: 3
  year: 1988
  end-page: 23
  ident: br000185
  article-title: Narrowing vs. SLD-resolution
  publication-title: Theoretical Computer Science
– year: 2008
  ident: br000215
  article-title: A declarative debugger for Maude functional modules
  publication-title: Proc. WRLA 2008
– volume: 53
  start-page: 74
  year: 2010
  end-page: 85
  ident: br000115
  article-title: Functional logic programming
  publication-title: Communications of the ACM
– reference: F. Schernhammer, B. Gramlich, Characterizing and proving operational termination of deterministic conditional term rewriting systems, Journal of Logic and Algebraic Programming, 2010 (in press).
– start-page: 56
  year: 2003
  end-page: 66
  ident: br000240
  article-title: Vimer: a visual debugger for mercury
  publication-title: Proc. 5th ACM SIGPLAN Int’l Conf. on Principles and Practice of Declaritive Programming
– volume: vol. 299
  start-page: 89
  year: 1988
  end-page: 101
  ident: br000300
  article-title: On completeness of narrowing strategies
  publication-title: Proc. CAAP’88
– start-page: 348
  year: 1988
  end-page: 357
  ident: br000485
  article-title: Complete axiomatizations of the algebras of finite, rational and infinite trees
  publication-title: Proc. Third IEEE Symp. on Logic In Computer Science
– volume: vol. 493
  start-page: 416
  year: 1991
  end-page: 437
  ident: br000360
  article-title: On narrowing strategies for partial non-strict functions
  publication-title: Proc. TAPSOFT’01
– volume: vol. 1302
  start-page: 141
  year: 1997
  end-page: 159
  ident: br000610
  article-title: Denotational abstract interpretation of functional logic programs
  publication-title: Proc. SAS’97
– start-page: 171
  year: 1994
  end-page: 182
  ident: br000085
  article-title: A compositional semantics for conditional term rewriting systems
  publication-title: Proc. 6th IEEE Int’l Conf. on Computer Languages
– volume: vol. 213
  start-page: 119
  year: 1986
  end-page: 132
  ident: br000145
  article-title: Design and implementation of a generic, logic and functional programming language
  publication-title: Proc. ESOP’86
– volume: 12
  start-page: 39
  year: 2001
  end-page: 72
  ident: br000365
  article-title: Verification of erlang processes by dependency pairs
  publication-title: Applicable Algebra in Engineering, Communication and Computing
– start-page: 331
  year: 1991
  end-page: 345
  ident: br000260
  article-title: Suspension analysis for concurrent logic programs
  publication-title: Proc. Eighth Int’l Conf. on Logic Programming
– volume: 19–20
  start-page: 149
  year: 1994
  end-page: 197
  ident: br000190
  article-title: The s-semantics approach: theory and applications
  publication-title: Journal of Logic Programming
– volume: vol. 632
  start-page: 158
  year: 1992
  end-page: 200
  ident: br000510
  article-title: Multiparadigm logic programming
  publication-title: Algebraic and Logic Programming, Proc. the Third Int’l Conf
– volume: 165
  start-page: 97
  year: 1996
  end-page: 131
  ident: br000090
  article-title: A compositional semantic basis for the analysis of equational horn programs
  publication-title: Theoretical Computer Science
– volume: 9
  start-page: 33
  year: 1999
  end-page: 75
  ident: br000420
  article-title: Higher-order narrowing with definitional trees
  publication-title: Journal of Functional Programming
– volume: vol. 76
  year: 2002
  ident: br000235
  article-title: Declarative Debugging for Encapsulated search
  publication-title: Proc. 11th Int’l Workshop on Functional and (Constraint) Logic Programming
– year: 2007
  ident: br000255
  article-title: All About Maude — A High-Performance Logical Framework
– volume: vol. 87
  start-page: 318
  year: 1980
  end-page: 334
  ident: br000450
  article-title: Canonical forms and unification
  publication-title: Proc of 5th Int’l Conf. on Automated Deduction
– reference: S. Antoy, S. Johnson, TeaBag: a functional logic debugger, in: H. Kuchen (Eds.), Proc. 13th Int’l Workshop on Functional and (Constraint) Logic Programming, WFLP 2004, 2004, pp. 4–18.
– volume: 103
  start-page: 86
  year: 1993
  end-page: 113
  ident: br000330
  article-title: A model-theoretic reconstruction of the operational semantics of logic programs
  publication-title: Information and Computation
– volume: vol. 57
  year: 2001
  ident: br000225
  article-title: A declarative debugging system for lazy functional logic programs
  publication-title: Proc. WFLP 2001
– start-page: 318
  year: 1987
  end-page: 327
  ident: br000465
  article-title: A complete semantics caracterization of K-LEAF, a logic language with partial functions
  publication-title: Proc. Second IEEE Symp. on Logic In Computer Science
– volume: 42
  start-page: 363
  year: 1991
  end-page: 377
  ident: br000375
  article-title: Kernel leaf: a logic plus functional language
  publication-title: Journal of Computer and System Sciences
– volume: 246
  start-page: 27
  year: 2009
  end-page: 38
  ident: br000060
  article-title: Order-sorted generalization
  publication-title: Electronic Notes in Theoretical Computer Science
– volume: 39
  start-page: 43
  year: 1999
  end-page: 93
  ident: br000270
  article-title: Abstract diagnosis
  publication-title: Journal of Logic Programming
– volume: vol. 714
  start-page: 28
  year: 1993
  end-page: 43
  ident: br000405
  article-title: A debugging model for functional logic programs
  publication-title: Proc. PLILP’93
– volume: 33
  start-page: 25
  year: 1998
  end-page: 30
  ident: br000605
  article-title: An angry half-dozen
  publication-title: SIGPLAN Notices
– start-page: 172
  year: 1985
  end-page: 185
  ident: br000355
  article-title: SLOG: a logic programming language interpreter based on clausal superposition and rewriting
  publication-title: Proc. Second IEEE Int’l Symp. on Logic Programming
– reference: S. Hölldobler, From paramodulation to narrowing, in: Proc. 5th Int’l Conf. on Logic Programming, Seattle, 1988, pp. 327–342.
– volume: 47
  start-page: 776
  year: 2000
  end-page: 822
  ident: br000110
  article-title: A needed narrowing strategy
  publication-title: Journal of the ACM
– year: 1984
  ident: br000475
  article-title: Foundations of Logic Programming
– volume: vol. 353
  year: 1989
  ident: br000445
  publication-title: Foundations of Equational Logic Programming
– start-page: 13
  year: 2007
  end-page: 24
  ident: br000500
  article-title: A lightweight interactive debugger for haskell
  publication-title: Proceedings of the ACM SIGPLAN Workshop on Haskell
– volume: vol. 4989
  start-page: 305
  year: 2008
  end-page: 321
  ident: br000220
  article-title: Declarative diagnosis of missing answers in constraint functional-logic programming
  publication-title: Functional and Logic Programming, 9th International Symposium, FLOPS 2008, Ise, Japan, April 14–16, 2008. Proceedings
– reference: J. Hernández, M.J. Ramírez, Induction of functional logic programs, in: Proc. of the JICSLP’98 CompulogNet Area Meeting on Computational Logic and Machine Learning, 1998, pp. 49–55.
– volume: 311
  start-page: 479
  year: 2004
  end-page: 525
  ident: br000080
  article-title: Rules + strategies for transforming lazy functional logic programs
  publication-title: Theoretical Computer Science
– volume: vol. 1634
  start-page: 116
  year: 1999
  end-page: 127
  ident: br000435
  article-title: A strong complete schema for inductive functional logic programming
  publication-title: Proc. Ninth Int’l Workshop on Inductive Logic Programming
– year: 1986
  ident: br000285
  publication-title: Logic Programming, Functions, Relations and Equations
– reference: P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proc. Fourth ACM Symp. on Principles of Programming Languages, 1977, pp. 238–252.
– volume: vol. 1870
  start-page: 1
  year: 2000
  end-page: 20
  ident: br000290
  article-title: Debugging of constraint programs: the DiSCiPl methodology and tools
  publication-title: Analysis and Visualization Tools for Constraint Programming
– volume: vol. 6125
  start-page: 271
  year: 2010
  end-page: 299
  ident: br000025
  article-title: Transformation and debugging of functional logic programs
  publication-title: 25 Years of Logic Programming in Italy
– reference: N. Martí-Oliet, A. Riesco, A. Verdejo, Declarative debugging of missing answers for Maude specifications, in: Proc. RTA 2010, in: Leibniz International Proceedings in Informatics, vol. 6, 2010, pp. 277–294.
– volume: 40
  start-page: 159
  year: 1999
  end-page: 183
  ident: br000200
  article-title: Induction of logic programs by example-guided unfolding
  publication-title: Journal of Logic Programming
– volume: vol. 906
  start-page: 132
  year: 1995
  end-page: 152
  ident: br000160
  article-title: On the operational semantics of the algebraic and logic programming language LPG
  publication-title: Recent Trends in Data Type Specifications
– volume: vol. 968
  year: 1995
  ident: br000170
  article-title: LSE narrowing for decreasing conditional term rewrite systems
  publication-title: Conditional Term Rewriting Systems, CTRS’94, Jerusalem
– volume: vol. 2664
  start-page: 1
  year: 2003
  end-page: 16
  ident: br000035
  article-title: Abstract diagnosis of functional programs
  publication-title: Proc. LOPSTR 2002
– start-page: 244
  year: 1999
  end-page: 247
  ident: br000480
  article-title: Toy: a multiparadigm declarative system
  publication-title: Proc. 10th Int’l Conf. on Rewriting Techniques and Applications
– ident: 10.1016/j.tcs.2010.07.009_br000140
– volume: vol. 40
  year: 2001
  ident: 10.1016/j.tcs.2010.07.009_br000265
  article-title: Assertion based inductive verification methods for logic programs
– start-page: 318
  year: 1987
  ident: 10.1016/j.tcs.2010.07.009_br000465
  article-title: A complete semantics caracterization of K-LEAF, a logic language with partial functions
– volume: 165
  start-page: 97
  issue: 1
  year: 1996
  ident: 10.1016/j.tcs.2010.07.009_br000090
  article-title: A compositional semantic basis for the analysis of equational horn programs
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(96)00043-6
– ident: 10.1016/j.tcs.2010.07.009_br000280
  doi: 10.1145/512950.512973
– start-page: 162
  year: 1995
  ident: 10.1016/j.tcs.2010.07.009_br000155
  article-title: Abstraction of conditional term rewriting systems
– volume: vol. 456
  start-page: 387
  year: 1990
  ident: 10.1016/j.tcs.2010.07.009_br000385
  article-title: Compiling logic programs with equality
– start-page: 348
  year: 1988
  ident: 10.1016/j.tcs.2010.07.009_br000485
  article-title: Complete axiomatizations of the algebras of finite, rational and infinite trees
– ident: 10.1016/j.tcs.2010.07.009_br000195
– year: 1982
  ident: 10.1016/j.tcs.2010.07.009_br000585
– volume: 13
  start-page: 287
  issue: 2
  year: 2003
  ident: 10.1016/j.tcs.2010.07.009_br000065
  article-title: Uniform lazy narrowing
  publication-title: Journal of Logic and Computation
  doi: 10.1093/logcom/13.2.287
– volume: vol. 4989
  start-page: 305
  year: 2008
  ident: 10.1016/j.tcs.2010.07.009_br000220
  article-title: Declarative diagnosis of missing answers in constraint functional-logic programming
– volume: 59
  start-page: 3
  year: 1988
  ident: 10.1016/j.tcs.2010.07.009_br000185
  article-title: Narrowing vs. SLD-resolution
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(88)90095-3
– volume: vol. 87
  start-page: 318
  year: 1980
  ident: 10.1016/j.tcs.2010.07.009_br000450
  article-title: Canonical forms and unification
– volume: vol. 632
  start-page: 244
  year: 1992
  ident: 10.1016/j.tcs.2010.07.009_br000520
  article-title: Counterexamples to completeness results for basic narrowing
– volume: 8
  start-page: 295
  issue: 3
  year: 1991
  ident: 10.1016/j.tcs.2010.07.009_br000530
  article-title: Inductive logic programming
  publication-title: New Generation Computing
  doi: 10.1007/BF03037089
– volume: 236
  start-page: 133
  issue: 1–2
  year: 2000
  ident: 10.1016/j.tcs.2010.07.009_br000130
  article-title: Termination of Term Rewriting using Dependency Pairs
  publication-title: Theoretical Computer Science
  doi: 10.1016/S0304-3975(99)00207-8
– volume: 33
  start-page: 25
  issue: 2
  year: 1998
  ident: 10.1016/j.tcs.2010.07.009_br000605
  article-title: An angry half-dozen
  publication-title: SIGPLAN Notices
  doi: 10.1145/274930.274933
– volume: vol. 299
  start-page: 89
  year: 1988
  ident: 10.1016/j.tcs.2010.07.009_br000300
  article-title: On completeness of narrowing strategies
– volume: vol. 906
  start-page: 132
  year: 1995
  ident: 10.1016/j.tcs.2010.07.009_br000160
  article-title: On the operational semantics of the algebraic and logic programming language LPG
– volume: vol. 493
  start-page: 416
  year: 1991
  ident: 10.1016/j.tcs.2010.07.009_br000360
  article-title: On narrowing strategies for partial non-strict functions
– volume: vol. 6125
  start-page: 271
  year: 2010
  ident: 10.1016/j.tcs.2010.07.009_br000025
  article-title: Transformation and debugging of functional logic programs
– volume: 39
  start-page: 43
  issue: 1–3
  year: 1999
  ident: 10.1016/j.tcs.2010.07.009_br000270
  article-title: Abstract diagnosis
  publication-title: Journal of Logic Programming
  doi: 10.1016/S0743-1066(98)10033-X
– year: 1998
  ident: 10.1016/j.tcs.2010.07.009_br000135
– volume: vol. 1520
  start-page: 40
  year: 1998
  ident: 10.1016/j.tcs.2010.07.009_br000010
  article-title: Error correcting source code
– volume: 35
  start-page: 268
  issue: 9
  year: 2000
  ident: 10.1016/j.tcs.2010.07.009_br000245
  article-title: QuickCheck: a lightweight tool for random testing of haskell programs
  publication-title: ACM SIGPLAN Notices
  doi: 10.1145/357766.351266
– volume: vol. 1302
  start-page: 141
  year: 1997
  ident: 10.1016/j.tcs.2010.07.009_br000610
  article-title: Denotational abstract interpretation of functional logic programs
– volume: vol. 76
  year: 2002
  ident: 10.1016/j.tcs.2010.07.009_br000235
  article-title: Declarative Debugging for Encapsulated search
– volume: vol. 57
  year: 2001
  ident: 10.1016/j.tcs.2010.07.009_br000105
  article-title: Evaluation strategies for functional logic programming
– volume: 12
  start-page: 191
  issue: 3
  year: 1992
  ident: 10.1016/j.tcs.2010.07.009_br000525
  article-title: Logic programming with functions and predicates: the language Babel
  publication-title: Journal of Logic Programming
  doi: 10.1016/0743-1066(92)90024-W
– volume: vol. 2024
  start-page: 170
  year: 2001
  ident: 10.1016/j.tcs.2010.07.009_br000230
  article-title: Theoretical foundations for the declarative debugging of lazy functional logic programs
– volume: 411
  start-page: 3348
  issue: 37
  year: 2010
  ident: 10.1016/j.tcs.2010.07.009_br000030
  article-title: A compact fixpoint semantics for term rewriting systems
  publication-title: Theoretical Computer Science
  doi: 10.1016/j.tcs.2010.05.012
– volume: 1997
  issue: 3
  year: 1997
  ident: 10.1016/j.tcs.2010.07.009_br000540
  article-title: A declarative debugging scheme
  publication-title: Journal of Functional and Logic Programming
– volume: 246
  start-page: 27
  year: 2009
  ident: 10.1016/j.tcs.2010.07.009_br000060
  article-title: Order-sorted generalization
  publication-title: Electronic Notes in Theoretical Computer Science
  doi: 10.1016/j.entcs.2009.07.013
– volume: vol. 2618
  start-page: 54
  year: 2003
  ident: 10.1016/j.tcs.2010.07.009_br000020
  article-title: Automated correction of functional logic programs
– volume: vol. 968
  year: 1995
  ident: 10.1016/j.tcs.2010.07.009_br000170
  article-title: LSE narrowing for decreasing conditional term rewrite systems
– volume: 4
  start-page: 177
  issue: 3
  year: 1987
  ident: 10.1016/j.tcs.2010.07.009_br000340
  article-title: Error diagnosis in logic programming, and adaptation of E.Y.Shapiro’s method
  publication-title: Journal of Logic Programming
  doi: 10.1016/0743-1066(87)90001-X
– year: 2008
  ident: 10.1016/j.tcs.2010.07.009_br000215
  article-title: A declarative debugger for Maude functional modules
– ident: 10.1016/j.tcs.2010.07.009_br000430
– ident: 10.1016/j.tcs.2010.07.009_br000415
– volume: 13
  start-page: 3
  issue: 1
  year: 1994
  ident: 10.1016/j.tcs.2010.07.009_br000600
  article-title: Moded flat GHC and its message-oriented implementation technique
  publication-title: New Generation Computing
  doi: 10.1007/BF03038307
– start-page: 275
  year: 1995
  ident: 10.1016/j.tcs.2010.07.009_br000275
  article-title: Declarative diagnosis revisited
– volume: vol. 714
  start-page: 28
  year: 1993
  ident: 10.1016/j.tcs.2010.07.009_br000405
  article-title: A debugging model for functional logic programs
– volume: 22
  start-page: 221
  issue: 3
  year: 1995
  ident: 10.1016/j.tcs.2010.07.009_br000075
  article-title: Analyses of unsatisfiability for equational logic programming
  publication-title: Journal of Logic Programming
  doi: 10.1016/0743-1066(94)00024-Z
– ident: 10.1016/j.tcs.2010.07.009_br000410
– start-page: 138
  year: 1985
  ident: 10.1016/j.tcs.2010.07.009_br000565
  article-title: Narrowing as the operational semantics of functional languages
– ident: 10.1016/j.tcs.2010.07.009_br000580
  doi: 10.1016/j.jlap.2009.08.001
– year: 2007
  ident: 10.1016/j.tcs.2010.07.009_br000255
– volume: 12
  start-page: 39
  issue: 1/2
  year: 2001
  ident: 10.1016/j.tcs.2010.07.009_br000365
  article-title: Verification of erlang processes by dependency pairs
  publication-title: Applicable Algebra in Engineering, Communication and Computing
  doi: 10.1007/s002000100063
– volume: 20
  start-page: 123
  issue: 1–2
  year: 2007
  ident: 10.1016/j.tcs.2010.07.009_br000515
  article-title: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
  publication-title: Higher-Order and Symbolic Computation
  doi: 10.1007/s10990-007-9000-6
– start-page: 627
  year: 1988
  ident: 10.1016/j.tcs.2010.07.009_br000490
  article-title: Equivalences of logic programs
– volume: vol. 632
  start-page: 143
  year: 1992
  ident: 10.1016/j.tcs.2010.07.009_br000100
  article-title: Definitional trees
– volume: vol. 632
  start-page: 259
  year: 1992
  ident: 10.1016/j.tcs.2010.07.009_br000305
  article-title: Uniform narrowing strategies
– start-page: 1
  year: 1992
  ident: 10.1016/j.tcs.2010.07.009_br000460
  article-title: Term Rewriting Systems
– volume: vol. 632
  start-page: 158
  year: 1992
  ident: 10.1016/j.tcs.2010.07.009_br000510
  article-title: Multiparadigm logic programming
– volume: vol. 19
  start-page: 67
  year: 2002
  ident: 10.1016/j.tcs.2010.07.009_br000005
  article-title: Kima — an automated error correction system for concurrent logic programs
– start-page: 259
  year: 1984
  ident: 10.1016/j.tcs.2010.07.009_br000595
  article-title: Semantics of a logic programming language with a reducibility predicate
– volume: vol. 3057
  start-page: 193
  year: 2004
  ident: 10.1016/j.tcs.2010.07.009_br000205
  article-title: Observing functional logic computations
– volume: vol. 57
  year: 2001
  ident: 10.1016/j.tcs.2010.07.009_br000225
  article-title: A declarative debugging system for lazy functional logic programs
– ident: 10.1016/j.tcs.2010.07.009_br000050
– volume: vol. 906
  start-page: 132
  year: 1994
  ident: 10.1016/j.tcs.2010.07.009_br000150
  article-title: On the operational semantics of the algebraic and logic programming language LPG
– ident: 10.1016/j.tcs.2010.07.009_br000310
– volume: 41
  start-page: 1
  issue: 1
  year: 2001
  ident: 10.1016/j.tcs.2010.07.009_br000370
  article-title: Debugging haskell by observing intermediate data structures
  publication-title: Electronic Notes in Theoretical Computer Science
  doi: 10.1016/S1571-0661(05)80538-9
– volume: vol. 213
  start-page: 119
  year: 1986
  ident: 10.1016/j.tcs.2010.07.009_br000145
  article-title: Design and implementation of a generic, logic and functional programming language
– volume: vol. 1870
  start-page: 1
  year: 2000
  ident: 10.1016/j.tcs.2010.07.009_br000290
  article-title: Debugging of constraint programs: the DiSCiPl methodology and tools
– ident: 10.1016/j.tcs.2010.07.009_br000210
– volume: vol. 64
  year: 2002
  ident: 10.1016/j.tcs.2010.07.009_br000045
  article-title: A debugging scheme for functional logic programs
– volume: vol. 1101
  start-page: 629
  year: 1996
  ident: 10.1016/j.tcs.2010.07.009_br000165
  article-title: Resolution of goals with the functional and logic programming language LPG: impact of abstract interpretation
– volume: vol. 2664
  start-page: 1
  year: 2003
  ident: 10.1016/j.tcs.2010.07.009_br000035
  article-title: Abstract diagnosis of functional programs
– volume: 19, 20
  start-page: 261
  year: 1994
  ident: 10.1016/j.tcs.2010.07.009_br000555
  article-title: Transformation of logic programs: foundations and techniques
  publication-title: Journal of Logic Programming
  doi: 10.1016/0743-1066(94)90028-0
– volume: 9
  start-page: 33
  issue: 1
  year: 1999
  ident: 10.1016/j.tcs.2010.07.009_br000420
  article-title: Higher-order narrowing with definitional trees
  publication-title: Journal of Functional Programming
  doi: 10.1017/S0956796899003330
– volume: vol. 4670
  start-page: 45
  year: 2007
  ident: 10.1016/j.tcs.2010.07.009_br000395
  article-title: Multi-paradigm declarative languages (invited tutorial)
– volume: 18
  start-page: 401
  issue: 1
  year: 1996
  ident: 10.1016/j.tcs.2010.07.009_br000545
  article-title: Towards a portable lazy functional declarative debugger
  publication-title: Australian Computer Science Communications
– volume: vol. 16
  year: 1988
  ident: 10.1016/j.tcs.2010.07.009_br000550
– ident: 10.1016/j.tcs.2010.07.009_br000055
– volume: 19–20
  start-page: 149
  year: 1994
  ident: 10.1016/j.tcs.2010.07.009_br000190
  article-title: The s-semantics approach: theory and applications
  publication-title: Journal of Logic Programming
  doi: 10.1016/0743-1066(94)90026-4
– volume: 69
  start-page: 289
  issue: 3
  year: 1989
  ident: 10.1016/j.tcs.2010.07.009_br000325
  article-title: Declarative modeling of the operational behavior of logic languages
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(89)90070-4
– volume: 53
  start-page: 74
  issue: 4
  year: 2010
  ident: 10.1016/j.tcs.2010.07.009_br000115
  article-title: Functional logic programming
  publication-title: Communications of the ACM
  doi: 10.1145/1721654.1721675
– volume: 103
  start-page: 86
  issue: 1
  year: 1993
  ident: 10.1016/j.tcs.2010.07.009_br000330
  article-title: A model-theoretic reconstruction of the operational semantics of logic programs
  publication-title: Information and Computation
  doi: 10.1006/inco.1993.1015
– volume: vol. 5595
  start-page: 380
  year: 2009
  ident: 10.1016/j.tcs.2010.07.009_br000250
  article-title: Unification and narrowing in Maude 2.4
– year: 2008
  ident: 10.1016/j.tcs.2010.07.009_br000315
  article-title: Variant narrowing and equational unification
– start-page: 244
  year: 1999
  ident: 10.1016/j.tcs.2010.07.009_br000480
  article-title: Toy: a multiparadigm declarative system
– volume: 15
  start-page: 467
  year: 1993
  ident: 10.1016/j.tcs.2010.07.009_br000295
  article-title: Deductive and inductive synthesis of equational programs
  publication-title: Journal of Symbolic Computation
  doi: 10.1016/S0747-7171(06)80002-7
– volume: vol. 57
  year: 2001
  ident: 10.1016/j.tcs.2010.07.009_br000040
  article-title: Declarative debugging of functional logic programs
– volume: 19, 20
  start-page: 629
  year: 1994
  ident: 10.1016/j.tcs.2010.07.009_br000535
  article-title: Inductive logic programming: theory and methods
  publication-title: Journal of Logic Programming
  doi: 10.1016/0743-1066(94)90035-3
– volume: 15
  year: 1998
  ident: 10.1016/j.tcs.2010.07.009_br000180
  article-title: An overview of Elan
  publication-title: Electronic Notes in Theoretical Computer Science
  doi: 10.1016/S1571-0661(05)82552-6
– ident: 10.1016/j.tcs.2010.07.009_br000345
– volume: vol. 631
  start-page: 443
  year: 1992
  ident: 10.1016/j.tcs.2010.07.009_br000070
  article-title: Analyses of inconsistency for incremental equational logic programming
– start-page: 331
  year: 1991
  ident: 10.1016/j.tcs.2010.07.009_br000260
  article-title: Suspension analysis for concurrent logic programs
– volume: 21
  start-page: 622
  issue: 4
  year: 1974
  ident: 10.1016/j.tcs.2010.07.009_br000590
  article-title: Automated theorem-proving for theories with simplifiers, commutativity and associativity
  publication-title: Journal of the ACM
  doi: 10.1145/321850.321859
– volume: vol. 656
  start-page: 128
  year: 1993
  ident: 10.1016/j.tcs.2010.07.009_br000380
  article-title: Sufficient conditions for modular termination of conditional term rewriting systems
– volume: vol. 2024
  start-page: 233
  year: 2001
  ident: 10.1016/j.tcs.2010.07.009_br000350
  article-title: Incremental learning of functional logic programs
– start-page: 13
  year: 2007
  ident: 10.1016/j.tcs.2010.07.009_br000500
  article-title: A lightweight interactive debugger for haskell
– volume: 40
  start-page: 159
  year: 1999
  ident: 10.1016/j.tcs.2010.07.009_br000200
  article-title: Induction of logic programs by example-guided unfolding
  publication-title: Journal of Logic Programming
  doi: 10.1016/S0743-1066(99)00017-5
– volume: 285
  start-page: 155
  issue: 2
  year: 2002
  ident: 10.1016/j.tcs.2010.07.009_br000175
  article-title: ELAN from a rewriting logic point of view
  publication-title: Theoretical Computer Science
  doi: 10.1016/S0304-3975(01)00358-9
– volume: 47
  start-page: 776
  issue: 4
  year: 2000
  ident: 10.1016/j.tcs.2010.07.009_br000110
  article-title: A needed narrowing strategy
  publication-title: Journal of the ACM
  doi: 10.1145/347476.347484
– year: 1984
  ident: 10.1016/j.tcs.2010.07.009_br000475
– start-page: 993
  year: 1988
  ident: 10.1016/j.tcs.2010.07.009_br000320
  article-title: A new declarative semantics for logic languages
– ident: 10.1016/j.tcs.2010.07.009_br000335
– volume: vol. 5
  start-page: 697
  year: 1998
  ident: 10.1016/j.tcs.2010.07.009_br000560
  article-title: Transformation of logic programs
– year: 1996
  ident: 10.1016/j.tcs.2010.07.009_br000015
  article-title: Integrating algorithmic debugging and unfolding transformation in an interactive learner
– volume: 42
  start-page: 363
  year: 1991
  ident: 10.1016/j.tcs.2010.07.009_br000375
  article-title: Kernel leaf: a logic plus functional language
  publication-title: Journal of Computer and System Sciences
  doi: 10.1016/0022-0000(91)90009-T
– ident: 10.1016/j.tcs.2010.07.009_br000440
– volume: vol. 353
  year: 1989
  ident: 10.1016/j.tcs.2010.07.009_br000445
– ident: 10.1016/j.tcs.2010.07.009_br000495
– ident: 10.1016/j.tcs.2010.07.009_br000505
– year: 2008
  ident: 10.1016/j.tcs.2010.07.009_br000455
  article-title: Analysis of rewrite-based access control policies
– volume: vol. 1634
  start-page: 116
  year: 1999
  ident: 10.1016/j.tcs.2010.07.009_br000435
  article-title: A strong complete schema for inductive functional logic programming
– volume: 311
  start-page: 479
  issue: 1–3
  year: 2004
  ident: 10.1016/j.tcs.2010.07.009_br000080
  article-title: Rules + strategies for transforming lazy functional logic programs
  publication-title: Theoretical Computer Science
  doi: 10.1016/j.tcs.2003.10.033
– start-page: 56
  year: 2003
  ident: 10.1016/j.tcs.2010.07.009_br000240
  article-title: Vimer: a visual debugger for mercury
– volume: 19, 20
  start-page: 583
  year: 1994
  ident: 10.1016/j.tcs.2010.07.009_br000390
  article-title: The integration of functions into logic programming: from theory to practice
  publication-title: Journal of Logic Programming
  doi: 10.1016/0743-1066(94)90034-5
– start-page: 171
  year: 1994
  ident: 10.1016/j.tcs.2010.07.009_br000085
  article-title: A compositional semantics for conditional term rewriting systems
– ident: 10.1016/j.tcs.2010.07.009_br000120
– year: 1986
  ident: 10.1016/j.tcs.2010.07.009_br000285
– volume: vol. 1110
  start-page: 409
  year: 1996
  ident: 10.1016/j.tcs.2010.07.009_br000575
  article-title: Program specialization via program slicing
– start-page: 67
  year: 2008
  ident: 10.1016/j.tcs.2010.07.009_br000400
  article-title: Call pattern analysis for functional logic programs
– volume: 20
  start-page: 768
  issue: 4
  year: 1998
  ident: 10.1016/j.tcs.2010.07.009_br000095
  article-title: Partial evaluation of functional logic programs
  publication-title: ACM Transactions on Programming Languages and Systems
  doi: 10.1145/291891.291896
– start-page: 172
  year: 1985
  ident: 10.1016/j.tcs.2010.07.009_br000355
  article-title: SLOG: a logic programming language interpreter based on clausal superposition and rewriting
– volume: 15
  year: 1998
  ident: 10.1016/j.tcs.2010.07.009_br000470
  article-title: Debugging for a declarative programming language
  publication-title: Machine Intelligence
– ident: 10.1016/j.tcs.2010.07.009_br000425
– ident: 10.1016/j.tcs.2010.07.009_br000125
– start-page: 627
  year: 1995
  ident: 10.1016/j.tcs.2010.07.009_br000570
  article-title: Bridging the gap between logic and functional programming
SSID ssj0000576
Score 1.9682907
Snippet We present a generic scheme for the declarative debugging of programs that are written in rewriting-based languages that are equipped with narrowing. Our aim...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 4055
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
C (programming language)
Computation
Computer science; control theory; systems
Computer simulation
Debugging
Diagnosis
Exact sciences and technology
Functional logic programming
Language theory and syntactical analysis
Mathematical models
Methodology
Miscellaneous
Narrowing
Program transformation
Programming theory
Semantics
Theoretical computing
Workability
Title An integrated framework for the diagnosis and correction of rule-based programs
URI https://dx.doi.org/10.1016/j.tcs.2010.07.009
https://www.proquest.com/docview/849439716
Volume 411
WOSCitedRecordID wos000283695700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pa9swFBZZusPG2I9uY9mPosNOKx62LEfS0QspzcjS0qbQm5FlC1qCE-KkFPbP7ymS7KRl3XbYxQRhyTjf5_eepE_vIfSZh1yGrMzNJIcFVMdRIMFrBYmiSQ7xdRFKtSk2wSYTfnkpTjudn_4szM2MVRW_vRWL_wo1tAHY5ujsP8DdDAoN8BtAhyvADte_Aj6t2hwQxaH24qtGT1hYcd1V7Y60LTc2z4aNy_WsDIxjK7xwq96OXqdbpx6VKwdx6Hxow5zx6cVwMh3urLR-S8fj0fmOwHhwcnY2THe0xUfpOD0fHI_arm45wkg7woC0Rs-fk9kyY7HZexG2Poq3udRZWEsum3PTmVCIIJMtd0wju9hxz9TbVYfrrytVO4WeSUYpWr_m9_LvuLtGhEji2Hjm-BHaIywRvIv20tHw8nvryBNmt7rdC_hN8Y088M5jfxfWPFvIGkDRtkrKPYe_iWKmL9FzN_3AqaXNK9Qpq330wk1FsDP0NTT5ah--bR89_dFk-K1fo5O0wi3NcEMzDDTDcB9uaIaBZrilGZ5r3NIMe5q9QRdHw-ngOHDFOQIVJ2IV5IRpWSgGIWTUZ6wAp8nzQkNApHikIhkpLajuxywntCShIJpInSSS9HnJS6Lit6hbzavyHcIyJwpcLo85kTTRVMAQXGxyHdKyH-keCv1_mymXud4UUJllXqJ4nQEcmYEjC42eQvTQl6bLwqZteehm6gHL3Ddj48kMuPZQt4MdcJsHeWL1EPZoZ2C0zU6crMr5us44FWYiEPXf_2mMD-hJ-5V9RN3Vcl1-Qo_VzeqqXh44xv4ClTezmQ
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+integrated+framework+for+the+diagnosis+and+correction+of+rule-based+programs&rft.jtitle=Theoretical+computer+science&rft.au=ALPUENTE%2C+M&rft.au=BALLIS%2C+D&rft.au=CORREA%2C+F&rft.au=FALASCHI%2C+M&rft.date=2010-10-29&rft.pub=Elsevier&rft.issn=0304-3975&rft.volume=411&rft.issue=47&rft.spage=4055&rft.epage=4101&rft_id=info:doi/10.1016%2Fj.tcs.2010.07.009&rft.externalDBID=n%2Fa&rft.externalDocID=23347183
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon