A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Type Analysis for CHIP
[chapter]
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
doi:10.1007/3-540-49253-4_28
fatcat:f7e7fdbe4nbodgxal2yn3swe2q