Person: Baudouin Le Charlier

DBLP: Charlier:Baudouin_Le

Facilitated 1 volumes:

Ed

Contributed to:

2006

2001

1998

1997

1996

1994

1994

1994

1993

1993

1993

1993

1992

1992

1992

1991

1991

1990

Wrote 21 papers:

ITiCSE-2006-DonyC #education #programming

A tool for helping teach a programming method (ID, BLC), pp. 212–216.

ECOOP-2001-PolletCC #java #source code #static analysis

Distinctness and Sharing Domains for Static Analysis of Java Programs (IP, BLC, AC), pp. 77–98.

LOPSTR-1998-BaldanCLP #declarative #semantics #towards

A Step Towards a Methodology for Mercury Program Construction: A Declarative Semantics for Mercury (DB, BLC, CL, IP), pp. 21–40.

SAS-1997-CharlierF #abstract interpretation #on the #theory and practice

On the Desirable Link Between Theory and Practice in Abstract Interpretation (BLC, PF), pp. 379–387.

LOPSTR-1996-CortesiCR #automation #prolog #source code #verification

Specification-Based Automatic Verification of Prolog Programs (AC, BLC, SR), pp. 38–57.

ILPS-1994-BraemCMH #analysis #prolog

Cardinality Analysis of Prolog (CB, BLC, SM, PVH), pp. 457–471.

ILPS-1994-CharlierRH #abstract interpretation #framework #prolog

An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut (BLC, SR, PVH), pp. 157–171.

PLDI-1994-HentenryckCC #analysis #graph #prolog #using

Type Analysis of Prolog Using Type Graphs (PVH, AC, BLC), pp. 337–348.

POPL-1994-CortesiCH #abstract domain #logic programming

Combinations of Abstract Domains for Logic Programming (AC, BLC, PVH), pp. 227–239.

LOPSTR-1993-BoeckC #logic #prolog

Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some Experiments (PDB, BLC), pp. 229–245.

PEPM-1993-CharlierH #analysis #evaluation #implementation #prolog

Groundness Analysis for PROLOG: Implementation and Evaluation of the Domain Prop (BLC, PVH), pp. 99–110.

PLILP-1993-CorsiniMRC #abstract interpretation #bottom-up #constraints #finite #performance #prolog #theorem proving

Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains (MMC, KM, AR, BLC), pp. 75–91.

WSA-1993-CharlierDMH #abstract interpretation #algorithm #fixpoint #optimisation #performance #prolog

Optimization Techniques for General Purpose Fixpoint Algorithms — Practical Efficiency for the Abstract Interpretation of Prolog (BLC, OD, LM, PVH), pp. 15–26.

WSA-1993-HentenryckDCM #abstract interpretation #prolog

The Impact of Granularity in Abstract Interpretation of Prolog (PVH, OD, BLC, LM), pp. 1–14.

JICSLP-1992-CharlierH #abstract interpretation #prolog

Reexecution in Abstract Interpretation of Prolog (BLC, PVH), pp. 750–764.

PLILP-1992-EnglebertCRH #abstract interpretation #algorithm #evaluation #optimisation #prolog

Generic Abstract Interpretation Algorithms For Prolog: Tow Optimization Techniques and Their Experimental Evaluation (VE, BLC, DR, PVH), pp. 310–325.

PLILP-1992-HenrardC #declarative #logic programming #named #source code

FOLON: An Environment for Declarative Construction of Logic Programs (JH, BLC), pp. 217–231.

WSA-1992-CharlierH #abstract interpretation #design #framework #on the

On the Design of Generic Abstract Interpretation Frameworks (BLC, PVH), pp. 229–246.

ICLP-1991-CharlierMH #abstract interpretation #algorithm #analysis #complexity

A Generic Abstract Interpretation Algorithm and its Complexity Analysis (BLC, KM, PVH), pp. 64–78.

WSA-1991-BoeckC #analysis #automation #prolog #type checking

Automatic Construction of Prolog Primitives for Type Checking Analysis (PDB, BLC), pp. 165–172.

PLILP-1990-BoeckC #analysis #correctness #prolog #static typing

Static Type Analysis of Prolog Procedures for Ensuring Correctness (PDB, BLC), pp. 222–237.