This talk is based on preliminary work with Gregory Duck and Peter Stuckey (University of Melbourne). Constraint Handling Rules (CHR) is a rule-based bottom-up language, originally intended for writing constraint solvers, but now used more and more for general purpose programming. Because of its high-level nature, CHR is well-suited for program analysis, to infer behavioral properties such as termination, confluence and time complexity and to drive optimized compilation. Up to now, program analysis of CHR has been done in an ad hoc fashion. In this work we aim to replace this unstructured approach with the general program analysis framework of abstract interpretation. The talk presents our current formulation of the framework for CHR together with two instantations (storage analysis and groundness analysis).
Information on participating / attending:
Date:
11/10/2004 14:30 - 11/10/2004 16:00
Event venue:
Oberer Eselsberg, Universität, Festpunkt O27, Raum 123
89081 Ulm
Baden-Württemberg
Germany
Target group:
Scientists and scholars
Email address:
Relevance:
local
Subject areas:
Information technology
Types of events:
Entry:
10/27/2004
Sender/author:
Peter Pietschmann
Department:
Presse- und Öffentlichkeitsarbeit
Event is free:
unknown
Language of the text:
German
URL of this event: http://idw-online.de/en/event12382
You can combine search terms with and, or and/or not, e.g. Philo not logy.
You can use brackets to separate combinations from each other, e.g. (Philo not logy) or (Psycho and logy).
Coherent groups of words will be located as complete phrases if you put them into quotation marks, e.g. “Federal Republic of Germany”.
You can also use the advanced search without entering search terms. It will then follow the criteria you have selected (e.g. country or subject area).
If you have not selected any criteria in a given category, the entire category will be searched (e.g. all subject areas or all countries).