BibSLEIGH — Bart

Travelled to:

1 × Estonia
1 × France
1 × India
1 × Japan
1 × Poland
1 × Portugal
1 × Spain
12 × USA
2 × Canada
2 × Denmark
2 × Germany
3 × Belgium
3 × Italy
3 × United Kingdom

Collaborated with:

T.Schrijvers K.F.Sagonas P.Nguyen A.Mariën ∅ M.Codish J.Sneyers R.Moolenaar P.Weemeeuw M.J.G.d.l.Banda B.Desouter L.D.Koninck R.Vandeginste P.Tarau K.Marriott P.J.Stuckey M.Triska P.V.Weert A.Callebaut G.Janssens J.Wielemaker A.Serebrenik E.Börger V.S.Costa M.Bruynooghe W.Harvey G.Engels K.D.Bosschere P.V.Roy Y.D.Willems N.Wu A.Kimmig R.Rocha L.D.Raedt D.Boulanger M.Denecker A.Mulkers D.Overton

Talks about:

prolog (13) program (12) wam (9) garbag (7) logic (7) collect (6) hal (5) chr (5) analysi (4) memori (4)

Person: Bart Demoen

DBLP: Demoen:Bart

Facilitated 1 volumes:

Contributed to:

2014

2013

2012

2014

2008

2007

2006

2005

2004

2003

2002

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

1988

1987

Wrote 48 papers:

PPDP-2014-SchrijversWDD #functional #heuristic #implementation #logic programming #specification: Heuristics Entwined with Handlers Combined: From Functional Specification to Logic Programming Implementation (TS, NW, BD, BD), pp. 259–270.
ICLP-J-2013-SchrijversDDW #continuation #prolog: Delimited continuations for prolog (TS, BD, BD, JW), pp. 533–546.
PPDP-2012-SchrijversTD #named: Tor: extensible search with hookable disjunction (TS, MT, BD), pp. 103–114.
PPDP-J-2012-SchrijversDTD14 #composition #named: Tor: Modular search with hookable disjunction (TS, BD, MT, BD), pp. 101–120.
ICLP-2008-DemoenN #implementation: Two WAM Implementations of Action Rules (BD, PLN), pp. 621–635.
ICLP-2008-DemoenN08a #reuse: Environment Reuse in the WAM (BD, PLN), pp. 698–702.
ICLP-2008-KimmigCRDR #execution #on the #performance #source code: On the Efficient Execution of ProbLog Programs (AK, VSC, RR, BD, LDR), pp. 175–189.
ICLP-2008-SchrijversCWD #prolog #towards: Towards Typed Prolog (TS, VSC, JW, BD), pp. 693–697.
ICLP-2008-SchrijversD #community #prolog: Uniting the Prolog Community (TS, BD), pp. 7–8.
ICLP-2007-KoninckSD #algorithm #logic: The Correspondence Between the Logical Algorithms Language and CHR (LDK, TS, BD), pp. 209–223.
ICLP-2007-SneyersWSD #constraints: Aggregates in Constraint Handling Rules (JS, PVW, TS, BD), pp. 446–448.
LOPSTR-2007-WeertSD #program transformation: Aggregates for CHR through Program Transformation (PVW, JS, BD), pp. 59–73.
PPDP-2007-KoninckSD: User-definable rule priorities for CHR (LDK, TS, BD), pp. 25–36.
ICLP-2006-SneyersSD #memory management #reuse: Memory Reuse for CHR (JS, TS, BD), pp. 72–86.
ICLP-2005-SneyersSD #continuation #optimisation: Guard and Continuation Optimization for Occurrence Representations of CHR (JS, TS, BD), pp. 83–97.
PDCL-2004-DemoenBHMOS #constraints: Herbrand Constraints in HAL (BD, MJGdlB, WH, KM, DO, PJS), pp. 499–538.
ICLP-2003-SerebrenikD #logic programming #refactoring #source code: Refactoring Logic Programs: Extended Abstract (AS, BD), pp. 509–510.
FLOPS-2002-BandaDMS #tutorial: To the Gates of HAL: A HAL Tutorial (MJGdlB, BD, KM, PJS), pp. 47–66.
ICLP-2002-Demoen #garbage collection: A Different Look at Garbage Collection for the WAM (BD), pp. 179–193.
ICLP-2002-DemoenNV #garbage collection #question: Copying Garbage Collection for the WAM: To Mark or Not to Mark? (BD, PLN, RV), pp. 194–208.
ICLP-2002-SchrijversBD #analysis: Trailing Analysis for HAL (TS, MJGdlB, BD), pp. 38–53.
PADL-2002-VandeginsteSD #garbage collection #order #prolog: Segment Order Preserving and Generational Garbage Collection for Prolog (RV, KFS, BD), pp. 299–317.
PPDP-2002-SchrijversD #analysis: Combining an improvement to PARMA trailing with trailing analysis (TS, BD), pp. 88–98.
CL-2000-DemoenN: So Many WAM Variations, So Little Time (BD, PLN), pp. 1240–1254.
LOPSTR-2000-Demoen #abduction #garbage collection #prolog: Prolog and abduction 4 writing garbage collectors (BD).
PADL-2000-DemoenS #experience #garbage collection: Heap Garbage Collection in XSB: Practice and Experience (BD, KFS), pp. 93–108.
ICLP-1999-DemoenBHMS #constraints #theorem proving: Herbrand Constraint Solving in HAL (BD, MJGdlB, WH, KM, PJS), pp. 260–274.
PADL-1999-DemoenS #approach #chat #named: CHAT: The Copy-Hybrid Approach to Tabling (BD, KFS), pp. 106–121.
ALP-PLILP-1998-DemoenS #approach #named: CAT: The Copying Approach to Tabling (BD, KFS), pp. 21–35.
ISMM-1998-DemoenS #memory management #prolog: Memory Management for Prolog with Tabling (BD, KFS), pp. 97–106.
ICLP-1997-CodishDS #program analysis: XSB as the Natural Habitat for General Purpose Program Analysis (MC, BD, KFS), p. 416.
SAC-1996-DemoenET #garbage collection #order #prolog: Segment order preserving copying garbage collection for WAM based Prolog (BD, GE, PT), pp. 380–386.
SAS-1996-BruynoogheDBDM #analysis #logic programming #source code: A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation (MB, BD, DB, MD, AM), pp. 128–142.
SAC-1995-TarauDB #empirical #power of #prolog: The power of partial tanslation: an experiment with the C-ification of binary Prolog (PT, BD, KDB), pp. 152–156.
ICLP-1994-MoolenaarD #hybrid: Hybrid Tree Search in the Andorra Model (RM, BD), pp. 110–123.
SAS-1994-CodishD #dependence #logic programming #multi #polymorphism #source code #using: Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop (MC, BD), pp. 281–296.
ILPS-1993-CodishD #logic programming #source code #using: Analysing Logic Programs Using “Prop”-ositional Logic Programs and a Magic Wand (MC, BD), pp. 114–129.
PLILP-1993-MoolenaarD #implementation #parallel: A Parallel Implementation for AKL (RM, BD), pp. 246–261.
IWMM-1992-WeemeeuwD #garbage collection #overview #perspective: Garbage Collection in Aurora: An Overview (PW, BD), pp. 454–472.
LOPSTR-1992-Demoen #on the #performance #prolog: On the Transformation of a Prolog Program to a More Efficient Binary Program (BD), pp. 242–252.
ISLP-1991-MarienD #unification: A New Scheme for Unification in WAM (AM, BD), pp. 257–271.
PLILP-1991-BorgerD #database #framework #prolog: A Framework to Specify Database Update Views for Prolog (EB, BD), pp. 147–158.
NACLP-1990-WeemeeuwD #memory management #multi: A la Recherche de la Mémoire Perdue OR Memory Compaction for Shard Memory Multiprocessors (PW, BD), pp. 306–320.
NACLP-1989-DemoenMC #prolog: Indexing Prolog Clauses (BD, AM, AC), pp. 1001–1012.
NACLP-1989-MarienD #on the: On the Management of Choicepoint and Environment Frames in the WAM (AM, BD), pp. 1030–1047.
JICSCP-1988-JanssensDM88 #unification: Improving the Register Allocation of WAM by Recording Unification (GJ, BD, AM), pp. 1388–1402.
SLP-1987-BruynoogheJCD87 #abstract interpretation #optimisation #prolog #source code #towards: Abstract Interpretation: Towards the Global Optimization of Prolog Programs (MB, GJ, AC, BD), pp. 192–204.
CFLP-1987-RoyDW #execution #prolog: Improving the Execution Speed of Compiled Prolog with Modes, Clause Selection, and Determinism (PVR, BD, YDW), pp. 111–125.