Type Analysis for CHIP [chapter]

Włodzimierz Drabent, Paweł Pietrzak
1998 Lecture Notes in Computer Science  
and IDA, Link opings universitet 2 IDA, Link opings universitet, S -581 83 Link oping, Sweden. fwlodr,pawpig@ida.liu.se. 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
more » ... 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.
doi:10.1007/3-540-49253-4_28 fatcat:f7e7fdbe4nbodgxal2yn3swe2q