BibSLEIGH — Danny_De

Travelled to:

1 × Austria
1 × Canada
1 × Israel
2 × Germany
2 × Japan
2 × Spain
2 × Sweden
3 × Denmark
3 × France
4 × Belgium
4 × Italy
5 × United Kingdom
8 × USA

Collaborated with:

B.Martens M.Denecker M.Leuschel M.Bruynooghe P.Pilozzi A.Serebrenik K.Verschaetse S.Decorte D.Voets J.Sneyers M.T.Nguyen K.V.Belleghem S.Verbaeten W.Vanhoof C.J.Nicholson K.F.Sagonas D.Boulanger V.Nys T.W.Frühwirth J.Vennekens D.A.d.Waal M.Fabris B.Krekels J.Giesl P.Schneider-Kamp K.D.Vlaminck D.Pollet J.Ronsyn G.Duchatelet F.Piessens

Talks about:

program (26) termin (24) logic (24) analysi (16) specialis (7) interpret (6) base (6) use (6) non (6) abstract (5)

Person: Danny De Schreye

DBLP: Schreye:Danny_De

Facilitated 3 volumes:

Contributed to:

2014

2013

2011

2010

2009

2008

2007

2006

2005

2003

2002

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1988

1986

Wrote 52 papers:

LOPSTR-2014-SchreyeNN #compilation #deduction: Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction (DDS, VN, CJN), pp. 21–38.
ICLP-J-2013-SneyersSF #probability #reasoning: Probabilistic legal reasoning in CHRiSM (JS, DDS, TWF), pp. 769–781.
ICLP-2011-NicholsonSS #generative #logic #music #probability #using: Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise (CJN, DDS, JS), pp. 231–239.
ICLP-J-2011-VoetsS #analysis #integer #logic programming #source code: Non-termination analysis of logic programs with integer arithmetics (DV, DDS), pp. 521–536.
LOPSTR-2011-PilozziS #analysis #self #termination #using: Improved Termination Analysis of CHR Using Self-sustainability Analysis (PP, DDS), pp. 189–204.
LOPSTR-2011-SneyersS #probability #source code #termination: Probabilistic Termination of CHRiSM Programs (JS, DDS), pp. 221–236.
LOPSTR-2010-VoetsS #analysis #logic programming #source code #using: Non-termination Analysis of Logic Programs Using Types (DV, DDS), pp. 133–148.
ICLP-2009-PilozziS #proving #termination: Proving Termination by Invariance Relations (PP, DDS), pp. 499–503.
ICLP-2009-PilozziS09a #automation #proving #termination: Automating Termination Proofs for CHR (PP, DDS), pp. 504–508.
ICLP-2009-VoetsS #analysis #approach #logic programming #source code: A New Approach to Non-termination Analysis of Logic Programs (DV, DDS), pp. 220–234.
ICLP-2008-PilozziS #analysis #revisited #termination: Termination Analysis of CHR Revisited (PP, DDS), pp. 501–515.
LOPSTR-2007-NguyenGSS #analysis #dependence #graph #logic programming #source code #termination: Termination Analysis of Logic Programs Based on Dependency Graphs (MTN, JG, PSK, DDS), pp. 8–22.
LOPSTR-2006-NguyenS #automation #named #polynomial #proving #termination: Polytool: Proving Termination Automatically Based on Polynomial Interpretations (MTN, DDS), pp. 210–218.
PADL-2006-SneyersVS #modelling #music: Probabilistic-Logical Modeling of Music (JS, JV, DDS), pp. 60–72.
ICLP-2005-NguyenS #analysis #logic programming #polynomial #source code #termination: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs (MTN, DDS), pp. 311–325.
LOPSTR-2003-SerebrenikS #proving #termination: Proving Termination with Adornments (AS, DDS), pp. 108–109.
SAS-2002-SerebrenikS #float #logic programming #on the #source code #termination: On Termination of Logic Programs with Floating Point Computations (AS, DDS), pp. 151–164.
LOPSTR-2000-SerebrenikS #analysis #logic programming #source code #termination: Non-tranformational termination analysis of logic programs, based on general term-orderings (AS, DDS).
LOPSTR-J-2000-SerebrenikS #analysis #logic programming #source code #termination: Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings (AS, DDS), pp. 69–85.
FLOPS-1999-VerbaetenS #analysis #logic programming #source code #termination #using: Termination Analysis of Tabled Logic Programs Using Mode and Type Information (SV, DDS), pp. 163–178.
PPDP-1999-VerbaetenSS #composition #prolog #proving #termination: Modular Termination Proofs for Prolog with Tabling (SV, KFS, DDS), pp. 342–359.
ALP-PLILP-1998-VanhoofSM #bottom-up #framework #logic programming #source code: A Framework for Bottom Up Specialisation of Logic Programs (WV, DDS, BM), pp. 54–72.
JICSLP-1998-DecorteS #analysis #termination: Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space (SD, DDS), pp. 235–249.
JICSLP-1998-VanhoofMSV: Specialising the Other Way Arond (WV, BM, DDS, KDV), pp. 279–293.
LOPSTR-1998-VanhoofSM #bottom-up #logic programming #source code: Bottom-Up Specialisation of Logic Programs (WV, DDS, BM), pp. 325–327.
ICLP-1997-BelleghemDS #logic #logic programming: A Strong Correspondence between Description Logics and Open Logic Programming (KVB, MD, DDS), pp. 346–360.
ICLP-1997-DecorteS #analysis #automation #constraints #logic programming #source code: Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs (SD, DDS), pp. 78–92.
ILPS-1997-VerbaetenDS #composition #logic programming #source code: Compositionality of Normal Open Logic Programs (SV, MD, DDS), pp. 371–385.
LOPSTR-1997-DecorteSLMS #analysis #logic programming #termination: Termination Analysis for Tabled Logic Programming (SD, DDS, ML, BM, KFS), pp. 111–127.
JICSLP-1996-DeneckerBDPS #calculus #empirical #information management #protocol #representation #specification: A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification (MD, KVB, GD, FP, DDS), pp. 170–184.
JICSLP-1996-LeuschelSW #concept #deduction #integration #towards: A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration (ML, DDS, DAdW), pp. 319–332.
LOPSTR-1996-LeuschelS #how #logic programming: Logic Program Specialisation: How to Be More Specific (ML, DDS), p. 58.
PLILP-1996-LeuschelS #how #logic programming: Logic Program Specialisation: How To Be More Specific (ML, DDS), pp. 137–151.
ICLP-1995-BelleghemDS #calculus: Combining Situation Calculus and Event Calculus (KVB, MD, DDS), pp. 83–97.
ILPS-1995-SchreyeLM #tutorial: Tutorial on Program Specialisation (DDS, ML, BM), pp. 615–616.
PEPM-1995-LeuschelS #partial evaluation #towards: Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters (ML, DDS), pp. 253–263.
ICLP-1994-BelleghemDS #abduction #calculus #representation: Representing Continuous Change in the Abductive Event Calculus (KVB, MD, DDS), pp. 225–239.
ICLP-1994-BoulangerS #abstract interpretation #approach #compilation: Compiling Control Revisited: A New Approach based upon Abstract Interpretation (DB, DDS), pp. 699–713.
ILPS-1993-DecorteSF #analysis #automation #termination: Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis (SD, DDS, MF), pp. 420–436.
ILPS-1993-DeneckerS #abduction #information management #logic programming #representation: Representing Incomplete Knowledge in Abductive Logic Programming (MD, DDS), pp. 147–163.
LOPSTR-1993-MartensS #finite: Some Further Issues in Finite Unfolding (BM, DDS), pp. 159–161.
JICSLP-1992-DeneckerS #abduction #named #source code: SLDNFA: An Abductive Procedure for Normal Abductive Programs (MD, DDS), pp. 686–700.
JICSLP-1992-MartensS #metaprogramming #semantics: A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming (BM, DDS), pp. 511–525.
LOPSTR-1992-VerschaetseDS #analysis #automation #termination: Automatic Termination Analysis (KV, SD, DDS), pp. 168–183.
PLILP-1992-VerschaetseS #abstract interpretation #linear: Deriving of Linear Size Relations by Abstract Interpretation (KV, DDS), pp. 296–310.
ICLP-1991-VerschaetseS #logic programming #proving #source code #termination #using: Deriving Termination Proofs for Logic Programs, Using Abstract Procedures (KV, DDS), pp. 301–315.
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.
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-1988-SchreyeB #abstract interpretation #program transformation: An Application of Abstract Interpretation in Source Level Program Transformation (DDS, MB), pp. 35–57.
SLP-1986-BruynoogheSK86 #compilation: Compiling Control (MB, DDS, BK), pp. 70–77.