Nils Klarlund

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 Michael I. Schwartzbach

> Home > Persons > Nils Klarlund

Publications

2002
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ase/KlarlundMS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ase/KlarlundMS02
Nils Klarlund, Anders Møller, Michael I. Schwartzbach:
The DSD Schema Language. Autom. Softw. Eng. 9(3): 285-319 (2002)
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/ijfcs/KlarlundMS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/KlarlundMS02
Nils Klarlund, Anders Møller, Michael I. Schwartzbach:
MONA Implementation Secrets. Int. J. Found. Comput. Sci. 13(4): 571-586 (2002)
2000
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/fmsp/KlarlundMS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fmsp/KlarlundMS00
Nils Klarlund, Anders Møller, Michael I. Schwartzbach:
DSD: A schema language for XML. FMSP 2000: 101-111
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/wia/KlarlundMS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wia/KlarlundMS00
Nils Klarlund, Anders Møller, Michael I. Schwartzbach:
MONA Implementation Secrets. CIAA 2000: 182-194
1999
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tse/KlarlundS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tse/KlarlundS99
Nils Klarlund, Michael I. Schwartzbach:
A Domain-Specific Language for Regular Sets of Strings and Trees. IEEE Trans. Software Eng. 25(3): 378-386 (1999)
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/dlt/KlarlundDS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/KlarlundDS99
Nils Klarlund, Niels Damgaard, Michael I. Schwartzbach:
Yakyak: parsing with logical side constraints. Developments in Language Theory 1999: 286-301
1997
[c20]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dsl/KlarlundS97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dsl/KlarlundS97
Nils Klarlund, Michael I. Schwartzbach:
A Domain-Specific Language for Regular Sets of Strings and Trees. DSL 1997
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/pldi/JensenJKS97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pldi/JensenJKS97
Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Michael I. Schwartzbach:
Automatic Verification of Pointer Programs using Monadic Second-Order Logic. PLDI 1997: 226-236
1996
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/oopsla/KlarlundKS96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/oopsla/KlarlundKS96
Nils Klarlund, Jari Koistinen, Michael I. Schwartzbach:
Formal Design Constraints. OOPSLA 1996: 370-383
1994
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/caap/KalrlundS94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/caap/KalrlundS94
Nils Klarlund, Michael I. Schwartzbach:
Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract). CAAP 1994: 187-201
1993
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/popl/KlarlundS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/popl/KlarlundS93
Nils Klarlund, Michael I. Schwartzbach:
Graph Types. POPL 1993: 196-205

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.