Type Analysis for CHIP

13 years 11 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics of a given program. The semantics of interest is an operational \call-success" semantics. The main intended application is program debugging. We consider a restricted class of speci cations, which are regular types of constrained atoms. Our type inference approach is based on bottom-up abstract interpretation, which is used to approximate the declarative semantics (c-semantics). By using \magic transformations" we can describe the call-success semantics of a program by the declarative semantics of another program. We are focused on CLP over nite domains. Our prototype program analyzer works for the programming language CHIP.
Wlodzimierz Drabent, Pawel Pietrzak
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Authors Wlodzimierz Drabent, Pawel Pietrzak
Comments (0)