Proving properties of logic programs by abstract diagnosis

Comini, Marco; Levi, Giorgio; Meo, Maria Chiara; Vitiello, Giuliana

doi:10.1007/3-540-62503-8_2

Cited by 13 publications

(17 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The prototype is written in Haskell using the GHC compiler version 6.8.2, and is publicly available. 9 The tool accepts TRSs that can be written either in TPDB format, 10 TTT form, 11 or a subset of the syntax of Maude functional modules.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A compact fixpoint semantics for term rewriting systems

Alpuente

Comini

Escobar

et al. 2010

Theoretical Computer Science

View full text Add to dashboard Cite

This work is motivated by the fact that a ``compact'' semantics for term rewriting systems, which is essential for the development of effective semantics-based program manipulation tools (\eg\ automatic program analyzers and debuggers), does not exist. The big-step rewriting semantics that is most commonly considered in functional programming is the set of values/normal forms that the program is able to compute for any input expression. Such a big-step semantics is unnecessarily oversized, as it contains many ``semantically useless'' elements that can be retrieved from a smaller set of terms. Therefore, in this article, we present a compressed, goal-independent collecting fixpoint semantics that contains the smallest set of terms that are sufficient to describe, by semantic closure, all possible rewritings. We prove soundness and completeness under ascertained conditions. The compactness of the semantics makes it suitable for applications. Actually, our semantics can be finite whereas the big-step semantics is generally not, and even when both semantics are infinite, the fixpoint computation of our semantics produces fewer elements at each step. To support this claim we report several experiments performed with a prototypical implementation

show abstract

Section: Resultsmentioning

confidence: 99%

“…It is important to emphasize that both the goal-independency and compactness of the semantics are necessary for the development of efficient semantics-based program manipulation tools, including abstract analyzers and debuggers that are based on abstract interpretation [2,11,12].…”

Section: Why a New Semanticsmentioning

confidence: 99%

A compact fixpoint semantics for term rewriting systems

Alpuente

Comini

Escobar

et al. 2010

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

Section: (Extended Abstract)mentioning

confidence: 99%

“…The semantic approximations produced by such analyses have been traditionally applied to optimization during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program validation and debugging [3,9,7].We study the case of (Constraint) Logic Programs (CLP), motivated by the comparatively large body of approximation domains, inference techniques, and tools for abstract interpretation-based semantic analysis which have been developed to a powerful and mature level for this programming paradigm (see, e.g., [23,8,18,6,12] and their references). These systems can approximate at compile-time a wide range of properties, from directional types to determinacy or termination, always safely, and with a significant degree of precisión.…”

mentioning

confidence: 99%

Program Debugging and Validation Using Semantic Approximations and Partial Specifications

Hermenegildo

Puebla

Bueno

et al. 2002

Automata, Languages and Programming

View full text Add to dashboard Cite

(Extended Abstract)The technique of Abstract Interpretation [11] has allowed the development of sophisticated program analyses which are provably correct and practical. The semantic approximations produced by such analyses have been traditionally applied to optimization during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program validation and debugging [3,9,7].We study the case of (Constraint) Logic Programs (CLP), motivated by the comparatively large body of approximation domains, inference techniques, and tools for abstract interpretation-based semantic analysis which have been developed to a powerful and mature level for this programming paradigm (see, e.g., [23,8,18,6,12] and their references). These systems can approximate at compile-time a wide range of properties, from directional types to determinacy or termination, always safely, and with a significant degree of precisión. Thus, our approach is to take advantage of these advances in program analysis tools within the context of program validation and debugging, rather than using traditional proof-based methods (e.g., [1,2,13,17,28]), developing new tools and procedures, such as specific concrete [4,15,16] or abstract [9, 10] diagnosers and declarative debuggers, or limiting error detection to run-time checking [28].In this talk we discuss these issues and present a framework for combined static/dynamic validation and debugging using semantic approximations [7,26,21] which is meant to be a part of an advanced program development environment comprising a variety of co-existing tools [14]. Program validation and detection of errors is first performed at compile-time by inferring properties of the program via abstract interpretation-based static analysis and comparing this information against (partial) speciñcations written in terms of assertions. Such assertions are linguistic constructions which allow expressing properties of programs.Classical examples of assertions are type declarations (e.g., in the context of (C)LP those used by [22,27,5]). However, herein we are interested in supporting a more general setting in which assertions can be of a much more general nature, stating additionally other properties, some of which cannot always be determined statically for all programs. These properties may include properties defined by means of user programs and extend beyond the predefined set which may be

show abstract

“…Thus we choose I κ = F κ (I ) as an over-approximation of the values of a program. We can consider any of the sets defined in the works of [4,7] as an under-approximation of I . In concrete, we take the finite abstract sequences of I κ as I c but replacing the constraint false by true after the position κ.…”

Section: Our Case Studymentioning

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

Proving properties of logic programs by abstract diagnosis

Cited by 13 publications

References 34 publications

A compact fixpoint semantics for term rewriting systems

A compact fixpoint semantics for term rewriting systems

Program Debugging and Validation Using Semantic Approximations and Partial Specifications

Declarative Diagnosis of Temporal Concurrent Constraint Programs

Contact Info

Product

Resources

About