Type analysis for CHIP
1999 (English)In: Algebraic Methodology and Software Technology: 7th International Conference, AMAST'98 Amazonia, Brazil, January 4-8, 1999 Proceedings / [ed] Armando Martin Haeberer, Encyclopedia of Global Archaeology/Springer Verlag, 1999, 389-405 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Encyclopedia of Global Archaeology/Springer Verlag, 1999. 389-405 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 1548
Research subject Embedded System
IdentifiersURN: urn:nbn:se:ltu:diva-31963DOI: 10.1007/3-540-49253-4_28Local ID: 64ad47a0-c50c-11dd-80bd-000ea68e967bISBN: 3-540-65462-3OAI: oai:DiVA.org:ltu-31963DiVA: diva2:1005197
Algebraic Methodology and Software Technology, AMAST'98 : 04/01/1999 - 08/01/1999
Upprättat; 1999; 20081208 (pawpie)2016-09-302016-09-30