BibSLEIGH — Maurice

Travelled to:

1 × Australia
1 × China
1 × Israel
1 × Japan
1 × Latvia
1 × Sweden
10 × USA
2 × Cyprus
2 × Denmark
2 × Germany
2 × Hungary
2 × Portugal
3 × Belgium
4 × Spain
4 × United Kingdom
6 × France
6 × Italy

Collaborated with:

G.Janssens W.Vanhoof M.Denecker D.Boulanger D.D.Schreye ∅ M.Codish T.Schrijvers J.P.Gallagher V.Dumortier L.D.Raedt F.Catthoor A.Mulkers J.Vennekens M.Leuschel N.Pelov B.d.Cat B.Martens K.Verschaetse S.Verdoolaege R.Tronçon N.Mazur K.C.Shashidhar A.Cortés-Calabuig O.Arieli M.Mariën J.Wittocx B.Demoen P.Pilozzi W.V.Humbeeck S.Verbaeten K.F.Sagonas A.Kågedal V.Englebert W.H.Winsborough P.Weemeeuw M.D.Haondt B.Krekels E.Pittomvils Y.D.Willems B.Bogaerts H.Vlaeminck K.Beyls S.Craig S.Genaim P.Ross H.Vandecasteele D.A.d.Waal W.Simoens D.Dams G.Filé D.Pollet J.Ronsyn A.Callebaut B.Gutmann I.Thon A.Kimmig B.V.Nuffelen M.J.G.d.l.Banda M.V.Hermenegildo J.Jansen H.Blockeel S.D.Pooter A.Labarre J.Ramon S.Verwer

Talks about:

program (24) logic (21) analysi (14) abstract (12) interpret (10) use (9) time (8) constraint (6) transform (6) prolog (6)

Person: Maurice Bruynooghe

DBLP: Bruynooghe:Maurice

Facilitated 5 volumes:

Contributed to:

2014

2013

2012

2011

2009

2008

2006

2005

2004

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

1988

1987

1986

1985

1982

1980

Wrote 64 papers:

ICLP-J-2014-BogaertsJBCVD #calculus #linear #simulation #using: Simulating Dynamic Systems Using Linear Time Calculus Theories (BB, JJ, MB, BdC, JV, MD), pp. 477–492.
ICLP-J-2013-CatB #dependence #detection #functional #generative: Detection and exploitation of functional dependencies for model generation (BdC, MB), pp. 471–485.
ICLP-2012-BlockeelBBCP #data mining #machine learning #mining #modelling #problem: Modeling Machine Learning and Data Mining Problems with FO(·) (HB, BB, MB, BdC, SDP, MD, AL, JR, SV), pp. 14–25.
KR-2012-VlaeminckVBD #complexity #logic #order #semantics: Ordered Epistemic Logic: Semantics, Complexity and Applications (HV, JV, MB, MD).
ICLP-J-2011-GutmannTKBR #logic #probability #programming: The magic of logical inference in probabilistic programming (BG, IT, AK, MB, LDR), pp. 663–680.
CAV-2009-VerdoolaegeJB #equivalence #source code #using: Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences (SV, GJ, MB), pp. 599–613.
LOPSTR-2009-PilozziSB #approach #constraints #proving: A Transformational Approach for Proving Properties of the CHR Constraint Store (PP, TS, MB), pp. 22–36.
KR-2008-Cortes-CalabuigDAB #approximate #database #fixpoint #performance #query: Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases (ACC, MD, OA, MB), pp. 81–91.
LOPSTR-2008-SchrijversBG #polymorphism: From Monomorphic to Polymorphic Well-Typings and Beyond (TS, MB, JPG), pp. 152–167.
SAT-2008-MarienWDB #induction #logic #satisfiability: SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (MM, JW, MD, MB), pp. 211–224.
ICLP-2006-WittocxVMDB #semantics: Predicate Introduction Under Stable and Well-Founded Semantics (JW, JV, MM, MD, MB), pp. 242–256.
PPDP-2006-SchrijversB #algebra #data type #polymorphism #re-engineering: Polymorphic algebraic data type reconstruction (TS, MB), pp. 85–96.
CC-2005-ShashidharBCJ #equivalence #program transformation #source code #verification: Verification of Source Code Transformations by Program Equivalence Checking (KCS, MB, FC, GJ), pp. 221–236.
CC-2005-VerdoolaegeBBC #case study #experience #integer #parametricity: Experiences with Enumeration of Integer Projections of Parametric Polytopes (SV, KB, MB, FC), pp. 91–105.
DATE-2005-ShashidharBCJ #algebra #equivalence #functional #source code #verification: Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code (KCS, MB, FC, GJ), pp. 1310–1315.
SAS-2005-BruynoogheGH #analysis #logic programming #source code #termination: Inference of Well-Typings for Logic Programs with Application to Termination Analysis (MB, JPG, WVH), pp. 35–51.
CAiSE-2004-NuffelenCDAB #integration #using: Data Integration Using ID-Logic (BVN, ACC, MD, OA, MB), pp. 67–81.
ICLP-2004-VennekensVB #logic programming #source code: Logic Programs with Annotated Disjunctions (JV, SV, MB), pp. 431–445.
PDCL-2004-LeuschelCBV #deduction #using: Specialising Interpreters Using Offline Partial Deduction (ML, SJC, MB, WV), pp. 340–375.
PDCL-2004-VanhoofBL #analysis: Binding-Time Analysis for Mercury (WV, MB, ML), pp. 189–232.
LOPSTR-2002-VanhoofTB #fixpoint #logic programming #semantics #source code: A Fixed Point Semantics for Logic Programs Extended with Cuts (WV, RT, MB), pp. 238–257.
SAS-2002-BruynoogheCGV #analysis #logic programming #reuse #source code #termination #using: Reuse of Results in Termination Analysis of Typed Logic Programs (MB, MC, SG, WV), pp. 477–492.
VMCAI-2002-TronconBJC #array #reduction: Storage Size Reduction by In-place Mapping of Arrays (RT, MB, GJ, FC), pp. 167–181.
ICLP-2001-DeneckerPB #logic programming #semantics #source code: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates (MD, NP, MB), pp. 212–226.
ICLP-2001-MazurRJB #aspect-oriented #garbage collection: Practical Aspects for a Working Compile Time Garbage Collection System for Mercury (NM, PR, GJ, MB), pp. 105–119.
LOPSTR-2001-VanhoofB #matter: When Size Does Matter (WV, MB), pp. 129–147.
CL-2000-MazurJB #analysis #memory management #reuse: A Module Based Analysis for Memory Reuse in Mercury (NM, GJ, MB), pp. 1255–1269.
LOPSTR-2000-VanhoofB #analysis #composition #higher-order #towards: Towards a modular binding-time analysis for higher-order Mercury (WV, MB).
PPDP-2000-PelovB #constraints #logic programming: Extending constraint logic programming with open functions (NP, MB), pp. 235–244.
ICLP-1999-VanhoofB #analysis: Binding-time Analysis for Mercury (WV, MB), pp. 500–514.
ALP-PLILP-1998-BruynoogheVWD #detection #logic programming #query #source code: Detecting Unsolvable Queries for Definite Logic Programs (MB, HV, DAdW, MD), pp. 118–133.
ESOP-1998-BruynoogheLS #analysis #deduction: A Polyvariant Binding-Time Analysis for Off-line Partial Deduction (MB, ML, KFS), pp. 27–41.
ICLP-1997-BruynoogheJK #analysis #logic programming #programming language: Live-Structure Analysis for Logic Programming Languages with Declarations (MB, GJ, AK), pp. 33–47.
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.
ICLP-1995-MulkersSJB #equation #on the: On the Practicality of Abstract Equation Systems (AM, WS, GJ, MB), pp. 781–795.
ILPS-1995-JanssensBD #abstract interpretation #automaton #constraints #logic programming #source code: A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs (GJ, MB, VD), pp. 336–350.
LOPSTR-1994-BoulangerB #analysis #logic programming #program transformation #using: Using Call/Exit Analysis for Logic Program Transformation (DB, MB), pp. 36–50.
PLILP-1994-BoulangerBD #approach #using: Abstracting s-semantincs Using A Model-Theoretic Approach (DB, MB, MD), pp. 432–446.
PLILP-1994-JanssensBE: Abstracting Numerical Values in CLP(H, N) (GJ, MB, VE), pp. 400–414.
SAS-1994-BoulangerB #abstract domain: A Systematic Construction of Abstract Domains (DB, MB), pp. 61–77.
ICLP-1993-CodishDFB #analysis #correctness #logic programming #question #source code: Freeness Analysis for Logic Programs — And Correctness? (MC, DD, GF, MB), pp. 116–131.
ICLP-1993-DumortierJBC #analysis #constraints: Freeness Analysis in the Presence of Numerical Constraints (VD, GJ, MB, MC), pp. 100–115.
LOPSTR-1993-BoulangerB #abstract interpretation #using: Using Abstract Interpretation for Goal Replacement (DB, MB), pp. 210–228.
PEPM-1993-CodishMBBH #abstract interpretation: Improving Abstract Interpretations by Combining Domains (MC, AM, MB, MJGdlB, MVH), pp. 194–205.
WSA-1993-BruynoogheC #correctness: Freeness, Sharing, Linearity and Correctness — All at Once (MB, MC), pp. 153–164.
LOPSTR-1992-BoulangerB #abstract interpretation #logic programming #source code #using: Deriving Transformations for Logic Programs Using Abstract Interpretation (DB, MB), pp. 99–117.
ISLP-1991-BruynoogheSM #deduction #infinity #logic programming #source code: A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.
ML-1991-RaedtBM #concept #constraints #interactive: Integrity Constraints and Interactive Concept-Learning (LDR, MB, BM), pp. 394–398.
CLP-1990-GallagherB90 #algorithm: The Derivation of an Algorithm for Program Specialisation (JPG, MB), pp. 732–746.
CLP-1990-MulkersWB90 #analysis #data type: Analysis of Shared Data Structures for Compile-Time Garbage (AM, WHW, MB), pp. 747–762.
CLP-1990-SchreyeVB90 #detection #graph #horn clause #query #strict #using: A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs (DDS, KV, MB), pp. 649–663.
CLP-1990-VerschaetseSB90 #compilation #generative #performance: Generation and Compilation of Efficient Computation Rules (KV, DDS, MB), pp. 700–714.
ESOP-1990-SchreyePRB #constraints #implementation #logic programming #prolog: Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism (DDS, DP, JR, MB), pp. 106–117.
PLILP-1990-DumortierB #automation #generative #on the #prolog: On the Automatic Generation of Events in Delta Prolog (VD, MB), pp. 324–339.
ML-1989-RaedtB #induction: Constructive Induction by Analogy (LDR, MB), pp. 476–477.
ESOP-1988-WeemeeuwBH #architecture #data flow #implementation #logic programming #on the #programming language: On Implementing Logic Programming Languages on a Dataflow Architecture (PW, MB, MDH), pp. 359–372.
JICSCP-1988-BruynoogheJ88 #abstract interpretation: An Instance of Abstract Interpretation Integrating Type and Mode Inferencing (MB, GJ), pp. 669–683.
PLILP-1988-SchreyeB #abstract interpretation #program transformation: An Application of Abstract Interpretation in Source Level Program Transformation (DDS, MB), pp. 35–57.
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.
SLP-1986-BruynoogheSK86 #compilation: Compiling Control (MB, DDS, BK), pp. 70–77.
SLP-1985-PittomvilsBW85 #garbage collection #prolog #realtime #towards: Towards a Real-Time Garbage Collector for Prolog (EP, MB, YDW), pp. 185–198.
ILPC-1982-Bruynooghe82 #garbage collection #prolog: A Note on Garbage-Collection in Prolog Interpreters (MB), pp. 52–55.
ILPC-1982-Bruynooghe82a #prolog #reliability #source code: Adding Redundancy to Obtain more Reliable and Readable Prolog Programs (MB), pp. 129–133.
CADE-1980-Bruynooghe #analysis #behaviour #dependence #logic programming #source code: Analysis of Dependencies to Improve the Behaviour of Logic Programs (MB), pp. 293–305.