Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nils Klarlund
2010 – today
- 2012
[j10]Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard J. Trefler: Reachability Problems in Piecewise FIFO Systems. ACM Trans. Comput. Log. 13(1): 7 (2012)
2000 – 2009
- 2007
- [c34]Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard J. Trefler: Algorithmic Analysis of Piecewise FIFO Systems. FMCAD 2007: 45-52
- 2005
- [j9]Nils Klarlund, Richard J. Trefler: Regularity Results for FIFO Channels. Electr. Notes Theor. Comput. Sci. 128(6): 21-36 (2005)
- [j8]Nils Klarlund: Relativizations for the Logic-Automata Connection. Higher-Order and Symbolic Computation 18(1-2): 79-120 (2005)
- [c33]Patrice Godefroid, Nils Klarlund: Software Model Checking: Searching for Computations in the Abstract or the Concrete. IFM 2005: 20-32
- [c32]Patrice Godefroid, Nils Klarlund, Koushik Sen: DART: directed automated random testing. PLDI 2005: 213-223
- 2003
- [c31]Nils Klarlund, Thomas Schwentick, Dan Suciu: XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases 2003: 1-41
- [c30]Nils Klarlund: Editing by voice and the role of sequential symbol systems for improved human-to-computer information rates. ICME 2003: 553-556
- 2002
- [j7]Nils Klarlund, Anders Møller, Michael I. Schwartzbach: The DSD Schema Language. Autom. Softw. Eng. 9(3): 285-319 (2002)
- [j6]Nils Klarlund, Anders Møller, Michael I. Schwartzbach: MONA Implementation Secrets. Int. J. Found. Comput. Sci. 13(4): 571-586 (2002)
- 2001
- [c29]Jennifer L. Beckham, Giuseppe Di Fabbrizio, Nils Klarlund: Towards SMIL as a foundation for multimodal, multimedia applications. INTERSPEECH 2001: 1363-1366
- 2000
- [c28]Nils Klarlund, Anders Møller, Michael I. Schwartzbach: DSD: A schema language for XML. FMSP 2000: 101-111
- [c27]Mark A. Smith, Nils Klarlund: Verification of a Sliding Window Protocol Using IOA and MONA. FORTE 2000: 19-34
- [c26]Nils Klarlund, Anders Møller, Michael I. Schwartzbach: MONA Implementation Secrets. CIAA 2000: 182-194
1990 – 1999
- 1999
- [j5]
- [j4]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)
- [c25]
- [c24]Nils Klarlund, Niels Damgaard, Michael I. Schwartzbach: Yakyak: parsing with logical side constraints. Developments in Language Theory 1999: 286-301
- 1998
- [c23]Jacob Elgaard, Nils Klarlund, Anders Møller: MONA 1.x: New Techniques for WS1S and WS2S. CAV 1998: 516-520
- 1997
- [c22]
- [c21]
- [c20]Nils Klarlund, Michael I. Schwartzbach: A Domain-Specific Language for Regular Sets of Strings and Trees. DSL 1997
- [c19]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
- [c18]Morten Biehl, Nils Klarlund, Theis Rauhe: Mona: Decidable Arithmetic in Practice. FTRTFT 1996: 459-462
- [c17]Nils Klarlund, Jari Koistinen, Michael I. Schwartzbach: Formal Design Constraints. OOPSLA 1996: 370-383
- [c16]Nils Klarlund, Mogens Nielsen, Kim Sunesen: Automated Logical Verification Based on Trace Abstractions. PODC 1996: 101-110
- [c15]Morten Biehl, Nils Klarlund, Theis Rauhe: Algorithms for Guided Tree Automata. Workshop on Implementing Automata 1996: 6-25
- 1995
- [j3]
- [c14]David A. Basin, Nils Klarlund: Hardware Verification using Monadic Second-Order Logic. CAV 1995: 31-41
- [c13]Nils Klarlund, Madhavan Mukund, Milind A. Sohoni: Determinizing Büchi Asnchronous Automata. FSTTCS 1995: 456-470
- [c12]Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, Anders Sandholm: Mona: Monadic Second-Order Logic in Practice. TACAS 1995: 89-110
- 1994
- [j2]Nils Klarlund: Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. Ann. Pure Appl. Logic 69(2-3): 243-268 (1994)
- [c11]Nils Klarlund, Michael I. Schwartzbach: Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract). CAAP 1994: 187-201
- [c10]
- [c9]
- [c8]Nils Klarlund, Mogens Nielsen, Kim Sunesen: A Case Study in Verification Based on Trace Abstractions. Formal Systems Specification 1994: 341-373
- [c7]Nils Klarlund, Madhavan Mukund, Milind A. Sohoni: Determinizing Asynchronous Automata. ICALP 1994: 130-141
- 1993
- [j1]Nils Klarlund, Fred B. Schneider: Proving Nondeterministically Specified Safety Properties Using Progress Measures. Inf. Comput. 107(1): 151-170 (1993)
- [c6]
- 1992
- [c5]Nils Klarlund: Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. LICS 1992: 382-393
- [c4]
- 1991
- [c3]Nils Klarlund: Progress Measures for Complementation of omega-Automata with Applications to Temporal Logic. FOCS 1991: 358-367
- [c2]Nils Klarlund, Dexter Kozen: Rabin Measures and Their Applications to Fairness and Automata Theory. LICS 1991: 256-265
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:51 CET by the dblp team