Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Type Analysis for CHIP
| |
|
Włodzimierz Drabent5, 6  and Paweł Pietrzak6
| (5) |
IPI PAN, Polish Academy of Sciences, Ordona 21, Pl - 01-237 Warszawa |
| (6) |
IDA, Linköpings universitet, S-581 83 Link#x00F6;ping, Sweden |
Abstract
This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers
a specification 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 specifications, 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 finite domains. Our prototype program analyzer works for the programming
language CHIP.
This work has been supported by the ESPRIT 4 Project 22532 DiSCiPl.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|