Filters








92 Hits in 1.6 sec

A Complete Declarative Debugger for Maude [chapter]

Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet
2011 Lecture Notes in Computer Science  
We present a declarative debugger for Maude specifications that allows to debug wrong answers (a wrong result is obtained) and missing answers (a correct but incomplete result is obtained) due to both  ...  The debugger builds a tree representing the computation and guides the user through it to find the bug.  ...  Conclusions We have implemented a declarative debugger of wrong and missing answers for Maude, that is able to detect wrong and missing statements and wrong search conditions.  ... 
doi:10.1007/978-3-642-17796-5_14 fatcat:z3jlwhq36zawldjnabnlml2ltq

Declarative Debugging of Membership Equational Logic Specifications [chapter]

Rafael Caballero, Narciso Martí-Oliet, Adrián Riesco, Alberto Verdejo
2008 Lecture Notes in Computer Science  
We introduce a declarative debugger for executable specifications in membership equational logic which correspond to Maude functional modules.  ...  The reflective features of Maude have been extensively used to develop a prototype implementation of the declarative debugger for Maude functional modules using Maude itself.  ...  Conclusions and future work In this paper we have developed the foundations of declarative debugging of executable MEL specifications, and we have applied them to implement a debugger for Maude functional  ... 
doi:10.1007/978-3-540-68679-8_12 fatcat:6h6swutqyrgy5d4lin6x7qt2we

A Declarative Debugger for Maude Functional Modules

R. Caballero, N. Martí-Oliet, A. Riesco, A. Verdejo
2009 Electronical Notes in Theoretical Computer Science  
A declarative debugger for Maude functional modules, which correspond to executable specifications in membership equational logic, is presented.  ...  The reflective features of Maude allow us to generate and navigate the debugging tree of a Maude computation using operations in Maude itself; even the user interface of the declarative debugger can be  ...  Acknowledgement We thank Santiago Escobar for motivating this research and the anonymous referees for their helpful suggestions to improve this paper.  ... 
doi:10.1016/j.entcs.2009.05.013 fatcat:srfxto2yoffkdnchs4bp4as7gy

Declarative Debugging of Rewriting Logic Specifications [chapter]

Adrian Riesco, Alberto Verdejo, Rafael Caballero, Narciso Martí-Oliet
2009 Lecture Notes in Computer Science  
This paper presents the fundamentals for the declarative debugging of rewriting logic specifications, realized in the Maude language, where a wrong computation can be a reduction, a type inference, or  ...  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  ...  In our opinion, this debugger provides a complement to existing debugging techniques for Maude, such as tracing and term coloring.  ... 
doi:10.1007/978-3-642-03429-9_20 fatcat:omnjiaoebfcibpyuw54wrayhum

Declarative debugging of rewriting logic specifications

Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet, Rafael Caballero
2012 The Journal of Logic and Algebraic Programming  
This paper presents the fundamentals for the declarative debugging of rewriting logic specifications, realized in the Maude language, where a wrong computation can be a reduction, a type inference, or  ...  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  ...  In our opinion, this debugger provides a complement to existing debugging techniques for Maude, such as tracing and term coloring.  ... 
doi:10.1016/j.jlap.2011.06.004 fatcat:vzhunaliazgs3kr2i6wogoxnly

Using Big-Step and Small-Step Semantics in Maude to Perform Declarative Debugging [chapter]

Adrián Riesco
2014 Lecture Notes in Computer Science  
In previous works we have presented a declarative debugger for Maude specifications. Besides a programming language, Maude is a semantic framework where several other languages can be specified.  ...  However, our declarative debugger is only able to find errors in Maude specifications, so it cannot find bugs on the programs written on the languages being specified.  ...  Our declarative debugger for Maude specifications is presented in [14] .  ... 
doi:10.1007/978-3-319-07151-0_4 fatcat:66q6tvif2bexfhim7cdbqn6kx4

An Integration of CafeOBJ into Full Maude [chapter]

Adrián Riesco
2014 Lecture Notes in Computer Science  
We have developed a grammar to parse any CafeOBJ specification, an intermediate language to store it, and a translation from this representation into Maude specifications.  ...  for CafeOBJ that can be easily modified and extended.  ...  It also includes the Inductive Theorem Prover [4] , a tool to prove inductive properties on equational Maude specifications.  ... 
doi:10.1007/978-3-319-12904-4_13 fatcat:gi36xisykrf6jj63oyamzch4yi

Enhancing the Debugging of Maude Specifications [chapter]

Adrian Riesco, Alberto Verdejo, Narciso Martí-Oliet
2010 Lecture Notes in Computer Science  
Declarative debugging is a semi-automatic technique that locates a program fragment responsible for the error by building a tree representing the computation and guiding the user through it to find the  ...  Two different kinds of errors are considered for debugging: wrong answers-a wrong result obtained from an initial value-and missing answers-a term that should be reachable but cannot be obtained from an  ...  We cordially thank Martin Wirsing for encouraging us to investigate the causes for missing answers in a deterministic context, and the referees for their useful comments.  ... 
doi:10.1007/978-3-642-16310-4_15 fatcat:r6rupmkzx5extdmkmci5hpkcam

A Tool for Testing Data Type Implementations from Maude Algebraic Specifications

Isabel Pita, Adrián Riesco
2012 Electronical Notes in Theoretical Computer Science  
This paper presents a tool for testing data types implemented in C++ against formal specifications written in Maude.  ...  Maude is a formal specification language based on rewriting logic that allows the specification of abstract data types in a clear and concise manner.  ...  Acknowledgment We are very grateful to Francisco Durán, Alberto Verdejo, and Narciso Martí for their ideas and comments about new ways to generate test cases and tool interface improvements.  ... 
doi:10.1016/j.entcs.2011.12.006 fatcat:wpy5c7m6bbgibcifhycd5aui6i

To parallelize or not to parallelize, bugs issue [article]

Alaa I. El-Nashar, Nakamura Masaki
2013 arXiv   pre-print
In addition, both nondeterminacy and deadlocks arise in SMPI programs have been verified using Maud system.  ...  Since MPI is not a compiled language, the programmer will be enfaced with several programming bugs.This paper presents the most common programming bugs arise in MPI programs to help the programmer to compromise  ...  between the running processes and the stopped one. d) Once the processes run completes, the programmer has to exit the debugger and re-run the MPI application for another debug session.  ... 
arXiv:1311.0728v1 fatcat:kwjcrseejranbfojhkkvus4fdm

Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees [chapter]

Rafael Caballero, Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet
2012 Lecture Notes in Computer Science  
In this paper we present a transformation for debugging trees for Maude specifications that ensures that any subterm occurring in a question has been previously replaced by the most reduced form that it  ...  Declarative debugging is a debugging technique that abstracts the execution details that in general may be difficult to follow in declarative languages to focus on results.  ...  This idea was implemented in Buddha [13] , a declarative debugger for Haskell, and in the declarative debugger of the functional-logic language Toy [3] .  ... 
doi:10.1007/978-3-642-32211-2_6 fatcat:g2idh2xb5jh2vcgiel7b4yae5e

An Innovative Teaching Tool for the Verification of Abstract Data Type Implementations from Formal Algebraic Specifications

Rafael del Vado Víırseda, Fernando Pérez Morente
2012 Procedia Computer Science  
This paper presents an educational tool for testing abstract data types implemented in C++ against formal algebraic specifications written in Maude, a formal specification language based on rewriting logic  ...  We have developed an Eclipse plug-in that calls the Maude system to generate the test cases and translates them into a sequence of C++ instructions.  ...  I am grateful to Isabel Pita, Adrián Riesco, Alberto Verdejo and Narciso Martí for their ideas and comments about new ways to generate test cases and tool interface improvements.  ... 
doi:10.1016/j.procs.2012.04.192 fatcat:yondn25he5ht5c5nqg6wzwk5uu

Preface

Narciso Martı´-Oliet, Peter Csaba Ölveczky
2012 The Journal of Logic and Algebraic Programming  
The paper "Declarative debugging of rewriting logic specifications" by A. Riesco, A. Verdejo, N. Martí-Oliet, and R. Caballero presents a declarative debugger for Maude and its foundations.  ...  High-level declarative languages such as Maude should benefit from declarative debugging techniques that abstract from execution details.  ...  required by a thorough reviewing process; to the reviewers for kindly contributing their time and effort to ensure the highest quality of each paper; and to Jan A.  ... 
doi:10.1016/j.jlap.2012.09.001 fatcat:4bcsc5pfazezxblx26cw2rfkou

A Survey of Algorithmic Debugging

Rafael Caballero, Adrián Riesco, Josep Silva
2017 ACM Computing Surveys  
From this comparison, we elaborate a summary of desirable characteristics that should be considered when implementing future algorithmic debuggers.  ...  We also review the main algorithmic debugger tools that have been implemented so far and compare their features.  ...  Naveso Cranford for a detailed English revision, and to the anonymous referees for their constructive criticism and suggestions.  ... 
doi:10.1145/3106740 fatcat:4wkixlg3ivb27pngnqpy3f6v44

Using conditional trace slicing for improving Maude programs

María Alpuente, Demis Ballis, Francisco Frechina, Daniel Romero
2014 Science of Computer Programming  
Given a Maude execution trace T and a slicing criterion for the trace (i.e., a piece of information that we want to observe in the final computation state), we traverse T from back to front and the backward  ...  Maude language that seamlessly unifies a wide variety of logics and models of concurrency.  ...  The Maude system currently supports two different approaches for debugging Maude programs: the internal debugger described in [14] (Chap. 22) and the declarative debugger of [32] .  ... 
doi:10.1016/j.scico.2013.09.018 fatcat:pavknj54lndt3fzb7lwypyuz4e
« Previous Showing results 1 — 15 out of 92 results