Maurice Bruynooghe

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Dmitri Boulanger

> Home > Persons > Maurice Bruynooghe

Publications

1996
[c60]
- view
  authority control:
- export record
  dblp key:
  - conf/sas/BruynoogheDBDM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sas/BruynoogheDBDM96
Maurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers:
A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation. SAS 1996: 128-142
1994
[c57]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/iclp/BoulangerB94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclp/BoulangerB94
Dmitri Boulanger, Maurice Bruynooghe:
Abstract Domains: a Model-Theoretic approach. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994
[c55]
- view
  authority control:
- export record
  dblp key:
  - conf/lopstr/BoulangerB94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lopstr/BoulangerB94
Dmitri Boulanger, Maurice Bruynooghe:
Using Call/Exit Analysis for Logic Program Transformation. LOPSTR 1994: 36-50
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/plilp/BoulangerBD94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/plilp/BoulangerBD94
Dmitri Boulanger, Maurice Bruynooghe, Marc Denecker:
Abstracting s-semantincs Using A Model-Theoretic Approach. PLILP 1994: 432-446
[c51]
- view
  authority control:
- export record
  dblp key:
  - conf/sas/BoulangerB94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sas/BoulangerB94
Dmitri Boulanger, Maurice Bruynooghe:
A Systematic Construction of Abstract Domains. SAS 1994: 61-77
1993
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jsc/BoulangerB93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/BoulangerB93
Dmitri Boulanger, Maurice Bruynooghe:
Deriving Fold/Unfold Transformations of Logic Programs Using Extended OLDT-Based Abstract Interpretation. J. Symb. Comput. 15(5/6): 495-521 (1993)
[c47]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/lopstr/BoulangerB93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lopstr/BoulangerB93
Dmitri Boulanger, Maurice Bruynooghe:
Using Abstract Interpretation for Goal Replacement. LOPSTR 1993: 210-228
[c46]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/lpe/BoulangerBS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lpe/BoulangerBS93
Dmitri Boulanger, Maurice Bruynooghe, Danny De Schreye:
Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. LPE 1993: 39-51
[c45]
- view
  authority control:
- export record
  dblp key:
  - conf/nato/BruynoogheB93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nato/BruynoogheB93
Maurice Bruynooghe, Dmitri Boulanger:
Abstract Interpretation for (Constraint) Logic Programming. NATO ASI CP 1993: 228-260
1992
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/lopstr/BoulangerB92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lopstr/BoulangerB92
Dmitri Boulanger, Maurice Bruynooghe:
Deriving Transformations for Logic Programs Using Abstract Interpretation. LOPSTR 1992: 99-117

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.