Using Semantic Approximations in Validation and Diagnosis of Constraint Logic Programs
نویسندگان
چکیده
During program development and debugging, several tools may be used which deal with (approximations of the) program semantics in one way or the other. Examples of such tools are automatic validation tools, declarative debuggers, program analyzers, etc. These tools also have in common that the semantics of the current program and the semantics of the intended program are often compared. In this paper we rst propose a uniform formulation of the \problems" which have to be dealt with in a wide collection of such tools. The formulation is very general with the only assumption that the program semantics used is in the class of xpoint semantics. We then analyze the e ect of using approximations rather than the exact program semantics when solving such problems, with particular emphasis on the case of using abstract interpretation in order to approximate program semantics. In doing this, we clarify some of the possibilities and the limits inherent to the use of approximations. We also propose a tool architecture for program development and debugging using approximations of program semantics, and report on three debugging environment prototypes developed as particular instances of such an architecture.
منابع مشابه
On the Role of Semantic Approximations on Validation and Diagnosis of Contraint Logic Programs
متن کامل
Program Debugging and Validation Using Semantic Approximations and Partial Specifications
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...
متن کاملTowards Verification of Java Bytecode using Logic Programming Tools
State of the art analyzers in the (Constraint) Logic Programming paradigm (or (C)LP for short) are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, run-time error freeness, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verificatio...
متن کاملJ. Logic Programming 1995:25, 3:191{248 Generalized Semantics Andabstract Interpretation for Constraint Logic Programs
We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any|possibly non-standard| semantic deenition. In constraint logic programming, this corresponds to a suitable deenition of the c...
متن کاملGeneralized Semantics and Abstract Interpretation for Constraint Logic Programs
We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any|possibly non-standard| semantic deenition. In constraint logic programming, this corresponds to a suitable deenition of the c...
متن کامل