Baudouin Le Charlier

Learn More
Type analysis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types(More)
Abstract interpretation of PROLOG programs has attracted many researchers in recent years, partly because of the potential for optimization in PROLOG compilers and partly because of the declarative nature of logic programming languages that make them more amenable to optimization than procedural languages. Most of the work, however, has remained at the(More)
After a brief survey of the problems related to audit trail analysis and of some approaches to deal with them, the paper outlines the project ASAX which aims at providing an advanced tool to support such analysis. One key feature of ASAX is its elegant architecture build on top of a universal analysis tool allowing any audit trail to be analysed after a(More)
Abstract interpretation [7] is a systematic methodology to designstatic program analysis which has been studied extensively in the logicprogramming community, because of the potential for optimizations inlogic programming compilers and the sophistication of the analyses whichrequire conceptual support. With the emergence of efficient genericabstract(More)
interpretation is a general methodology to obtain, in a systematic way, tools to analyse programs statically (at compile time). The basic idea behind abstract interpretation is to approximate (usually undecidable) properties by using an abstract * This work was done when Vincent Englebert and Didier Roland were visiting Brown University. † Author to whom(More)
The domain <?Pub Fmt italic>Prop<?Pub Fmt /italic> [22,8] is aconceptually simple and elegant abstract domain to compute groundnessinformation for Prolog programs. In particular, abstract substitutionsare represented by Boolean functions built using the logical connectives<inline-equation><f>&hArr;,&#8744;,&#8743;</f><?Pub Caret></inline-equation>.<?Pub Fmt(More)
Two experiments investigated whether profoundly deaf children's rhyming ability was determined by the linguistic input that they were exposed to in their early childhood. Children educated with Cued Speech (CS) were compared to other deaf children, educated orally or with sign language. In CS, speechreading is combined with manual cues that disambiguate it.(More)