A debugging model for functional logic programs

Hanus, Michael; Josephs, Berthold

doi:10.1007/3-540-57186-8_69

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some declarative languages (e.g. ALF [61], Babel [84], Curry [64], and Haskell [106]) are equipped with tracing tools which are based on suitable extended box models which help to display the run-time execution [63,21]. Unfortunately, these diagnosis systems do not enforce program correctness adequately as they do not provide means for finding nor repairing bugs in the source code w.r.t.…”

Section: Verifying and Correcting Programsmentioning

confidence: 99%

Rule-Based Software Verification and Correction.

Ballis¹

View full text Add to dashboard Cite

The increasing complexity of software systems has led to the development of sophisticated formal methodologies for verifying and correcting data and programs. In general, establishing whether a program behaves correctly w.r.t. the original programmer's intention or checking the consistency and the correctness of a large set of data are not trivial tasks as witnessed by many case studies which occur in the literature.In this dissertation, we face two challenging problems of verification and correction. Specifically, the verification and correction of declarative programs, and the verification and correction of Web sites (i.e. large collections of semistructured data).Firstly, we propose a general correction scheme for automatically correcting declarative, rule-based programs which exploits a combination of bottom-up as well as topdown inductive learning techniques. Our hybrid methodology is able to infer program corrections that are hard, or even impossible, to obtain with a simpler, automatic top-down or bottom-up learner. Moreover, the scheme will be also particularized to some well-known declarative programming paradigm: that is, the functional logic and the functional programming paradigm.Secondly, we formalize a framework for the automated verification of Web sites which can be used to specify integrity conditions for a given Web site, and then automatically check whether these conditions are fulfilled. We provide a rule-based, formal specification language which allows us to define syntactic as well as semantic properties of the Web site. Then, we formalize a verification technique which detects both incorrect/forbidden patterns as well as lack of information, that is, incomplete/missing Web pages. Useful information is gathered during the verification process which can be used to repair the Web site. So, after a verification phase, one can semi-automatically infer some possible corrections in order to fix the Web site. The methodology is based on a novel rewriting-like technique, called partial rewriting, in which the traditional pattern matching mechanism is replaced by a more suitable technique (tree simulation) for recognizing patterns inside semistructured documents. SommarioLa crescente complessità dei sistemi software ha reso necessario lo sviluppo di sofisticate metodologie formali per la verifica e la correzione di dati e programmi. In generale, stabilire se un programma si comporta correttamente rispetto alle intenzioni originali del programmatore o controllare la consistenza e la correttezza di grandi insiemi di dati non sono compiti triviali, comeè testimoniato dai numerosi casi di studio presenti in letteratura.In questa tesi affrontiamo due interessanti problemi di verifica e correzione: la verifica e correzione di programmi dichiarativi e la verifica e correzione di siti Web (i.e. collezioni di dati semistrutturati).In primo luogo, proponiamo uno schema generale per la correzione automatica di programmi dichiarativi rule-based, il quale sfrutta una combinazione di tecniche di inductiv...

show abstract

Section: Verifying and Correcting Programsmentioning

confidence: 99%

Rule-Based Software Verification and Correction.

Ballis¹

View full text Add to dashboard Cite

show abstract

“…Several debuggers based on tracing have been defined for different declarative programming languages. For instance [11] in the context of integrated languages. To improve understandability, a graphic debugger for the multi-paradigm concurrent language Curry is provided within the graphical environment CIDER [12] which visualizes the evaluation of expressions and is based on tracing.…”

Section: Introductionmentioning

confidence: 99%

Declarative Diagnosis of Temporal Concurrent Constraint Programs

et al.

View full text Add to dashboard Cite

Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check the correctness of D by a single step of TD. In order to develop an effective debugging method, we approximate the denotational semantics of D. We formalize this method by abstract interpretation techniques, and we derive a finitely terminating abstract diagnosis method, which can be used statically. We define an abstract domain which allows us to approximate the infinite sequences by a finite 'cut'. As a further development we show how to use a specific linear temporal logic for deriving automatically the debugging sequences. Our debugging framework does not require the user to either provide error symptoms in advance or answer questions concerning program correctness. Our method is compositional, that may allow to master the complexity of the debugging methodology.

show abstract