Sciweavers

26 search results - page 3 / 6
» A Declarative Debugger for Maude
Sort
View
ENTCS
2002
148views more  ENTCS 2002»
13 years 5 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
FMOODS
2007
13 years 6 months ago
Distributed Applications Implemented in Maude with Parameterized Skeletons
Abstract. Algorithmic skeletons are a well-known approach for implementing parallel and distributed applications. Declarative versions typically use higher-order functions in funct...
Adrián Riesco, Alberto Verdejo
PPDP
2007
Springer
13 years 11 months ago
Interactive, scalable, declarative program analysis: from prototype to implementation
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
William C. Benton, Charles N. Fischer
SCAM
2002
IEEE
13 years 10 months ago
Semantics Guided Filtering of Combinatorial Graph Transformations in Declarative Equation-Based Languages
This paper concerns the use of static analysis for debugging purposes of declarative object-oriented equation-based modeling languages. We propose a framework where over- and unde...
Peter Bunus, Peter Fritzson
ENTCS
2007
120views more  ENTCS 2007»
13 years 5 months ago
A Framework for Interpreting Traces of Functional Logic Computations
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
Bernd Braßel