Nils Klarlund

Publication Activity (10 Years)

Years Active: 1991-2012
Publications (10 Years): 0

Top Topics

Problems Involving

Complex Systems

Transitive Closure

Top Venues

ACM Trans. Comput. Log.

Publications

Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard J. Trefler
Reachability Problems in Piecewise FIFO Systems. ACM Trans. Comput. Log. 13 (1) (2012)
Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard J. Trefler
Algorithmic Analysis of Piecewise FIFO Systems. FMCAD (2007)
Nils Klarlund, Richard J. Trefler
Regularity Results for FIFO Channels. Electron. Notes Theor. Comput. Sci. 128 (6) (2005)
Patrice Godefroid, Nils Klarlund, Koushik Sen
DART: directed automated random testing. PLDI (2005)
Patrice Godefroid, Nils Klarlund
Software Model Checking: Searching for Computations in the Abstract or the Concrete. IFM (2005)
Nils Klarlund
Relativizations for the Logic-Automata Connection. High. Order Symb. Comput. 18 (1-2) (2005)
Nils Klarlund
Editing by voice and the role of sequential symbol systems for improved human-to-computer information rates. ICASSP (5) (2003)
Nils Klarlund
Editing by voice and the role of sequential symbol systems for improved human-to-computer information rates. ICME (2003)
Nils Klarlund, Thomas Schwentick, Dan Suciu
XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases (2003)
Nils Klarlund, Anders Møller, Michael I. Schwartzbach
The DSD Schema Language. Autom. Softw. Eng. 9 (3) (2002)
Nils Klarlund, Anders Møller, Michael I. Schwartzbach
MONA Implementation Secrets. Int. J. Found. Comput. Sci. 13 (4) (2002)
Jennifer L. Beckham, Giuseppe Di Fabbrizio, Nils Klarlund
Towards SMIL as a foundation for multimodal, multimedia applications. INTERSPEECH (2001)
Nils Klarlund, Anders Møller, Michael I. Schwartzbach
MONA Implementation Secrets. CIAA (2000)
Mark A. Smith, Nils Klarlund
Verification of a Sliding Window Protocol Using IOA and MONA. FORTE (2000)
Nils Klarlund, Anders Møller, Michael I. Schwartzbach
DSD: A schema language for XML. FMSP (2000)
Nils Klarlund, Niels Damgaard, Michael I. Schwartzbach
Yakyak: parsing with logical side constraints. Developments in Language Theory (1999)
Nils Klarlund, Michael I. Schwartzbach
A Domain-Specific Language for Regular Sets of Strings and Trees. IEEE Trans. Software Eng. 25 (3) (1999)
Nils Klarlund
Algorithm for Online BDD Refinement. J. Algorithms 32 (2) (1999)
Nils Klarlund
A Theory of Restrictions for Logics and Automata. CAV (1999)
Jacob Elgaard, Nils Klarlund, Anders Møller
MONA 1.x: New Techniques for WS1S and WS2S. CAV (1998)
Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Michael I. Schwartzbach
Automatic Verification of Pointer Programs using Monadic Second-Order Logic. PLDI (1997)
Nils Klarlund
Algorithm for Online BDD Refinement. CAV (1997)
Nils Klarlund
Mona & Fido: The Logic-Automaton Connection in Practice. CSL (1997)
Nils Klarlund, Michael I. Schwartzbach
A Domain-Specific Language for Regular Sets of Strings and Trees. DSL (1997)
Morten Biehl, Nils Klarlund, Theis Rauhe
Algorithms for Guided Tree Automata. Workshop on Implementing Automata (1996)
Nils Klarlund, Jari Koistinen, Michael I. Schwartzbach
Formal Design Constraints. OOPSLA (1996)
Nils Klarlund, Mogens Nielsen, Kim Sunesen
Automated Logical Verification Based on Trace Abstractions. PODC (1996)
Morten Biehl, Nils Klarlund, Theis Rauhe
Mona: Decidable Arithmetic in Practice. FTRTFT (1996)
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)
Nils Klarlund, Dexter Kozen
Rabin Measures. Chic. J. Theor. Comput. Sci. 1995 (1995)
David A. Basin, Nils Klarlund
Hardware Verification using Monadic Second-Order Logic. CAV (1995)
Nils Klarlund, Madhavan Mukund, Milind A. Sohoni
Determinizing Büchi Asnchronous Automata. FSTTCS (1995)
Nils Klarlund, Michael I. Schwartzbach
Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract). CAAP (1994)
Nils Klarlund, Madhavan Mukund, Milind A. Sohoni
Determinizing Asynchronous Automata. ICALP (1994)
Nils Klarlund
A Homomorphism Concepts for omega-Regularity. CSL (1994)
Nils Klarlund, Mogens Nielsen, Kim Sunesen
A Case Study in Verification Based on Trace Abstractions. Formal Systems Specification (1994)
Nils Klarlund
Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. Ann. Pure Appl. Log. 69 (2-3) (1994)
Nils Klarlund
The Limit View of Infinite Computations. CONCUR (1994)
Nils Klarlund, Fred B. Schneider
Proving Nondeterministically Specified Safety Properties Using Progress Measures Inf. Comput. 107 (1) (1993)
Nils Klarlund, Michael I. Schwartzbach
Graph Types. POPL (1993)
Nils Klarlund
Progress Measures and Stack Assertions for Fair Termination. PODC (1992)
Nils Klarlund
Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata LICS (1992)
Nils Klarlund
Progress Measures for Complementation of omega-Automata with Applications to Temporal Logic FOCS (1991)
Nils Klarlund, Dexter Kozen
Rabin Measures and Their Applications to Fairness and Automata Theory LICS (1991)
Nils Klarlund
Liminf Progress Measures. MFPS (1991)