Progress Measures and Finite Arguments for Infinite Computations. - Nils Klarlund (1990)

Progress Measures for Complementation of omega-Automata with Applications to Temporal Logic - Nils Klarlund (FOCS, 1991)

Rabin Measures and Their Applications to Fairness and Automata Theory - Nils Klarlund; Dexter Kozen (LICS, 1991)

Liminf Progress Measures. - Nils Klarlund (MFPS, 1991)

Progress Measures and Stack Assertions for Fair Termination. - Nils Klarlund (PODC, 1992)

Graph Types. - Nils Klarlund; Michael I. Schwartzbach (POPL, 1993)

Proving Nondeterministically Specified Safety Properties Using Progress Measures - Nils Klarlund; Fred B. Schneider (Inf. Comput., 1993)

Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract). - Nils Klarlund; Michael I. Schwartzbach (CAAP, 1994)

The Limit View of Infinite Computations. - Nils Klarlund (CONCUR, 1994)

A Homomorphism Concepts for omega-Regularity. - Nils Klarlund (CSL, 1994)

A Case Study in Verification Based on Trace Abstractions. - Nils Klarlund; Mogens Nielsen; Kim Sunesen (Formal Systems Specification, 1994)

Determinizing Asynchronous Automata. - Nils Klarlund; Madhavan Mukund; Milind A. Sohoni (ICALP, 1994)

Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. - Nils Klarlund (Ann. Pure Appl. Log., 1994)

Hardware Verification using Monadic Second-Order Logic. - David A. Basin; Nils Klarlund (CAV, 1995)

Determinizing Büchi Asnchronous Automata. - Nils Klarlund; Madhavan Mukund; Milind A. Sohoni (FSTTCS, 1995)

Mona: Monadic Second-Order Logic in Practice. - Jesper G. Henriksen; Jakob L. Jensen; Michael E. Jørgensen; Nils Klarlund; Robert Paige; Theis Rauhe; Anders Sandholm 001 (TACAS, 1995)

Rabin Measures. - Nils Klarlund; Dexter Kozen (Chic. J. Theor. Comput. Sci., 1995)

Mona: Decidable Arithmetic in Practice. - Morten Biehl; Nils Klarlund; Theis Rauhe (FTRTFT, 1996)

Formal Design Constraints. - Nils Klarlund; Jari Koistinen; Michael I. Schwartzbach (OOPSLA, 1996)

Automated Logical Verification Based on Trace Abstractions. - Nils Klarlund; Mogens Nielsen; Kim Sunesen (PODC, 1996)

Algorithms for Guided Tree Automata. - Morten Biehl; Nils Klarlund; Theis Rauhe (Workshop on Implementing Automata, 1996)

Mona & Fido: The Logic-Automaton Connection in Practice. - Nils Klarlund (CSL, 1997)

Automatic Verification of Pointer Programs using Monadic Second-Order Logic. - Jakob L. Jensen; Michael E. Jørgensen; Nils Klarlund; Michael I. Schwartzbach (PLDI, 1997)

MONA 1.x: New Techniques for WS1S and WS2S. - Jacob Elgaard; Nils Klarlund; Anders Møller (CAV, 1998)

A Theory of Restrictions for Logics and Automata. - Nils Klarlund (CAV, 1999)

Yakyak: parsing with logical side constraints. - Nils Klarlund; Niels Damgaard; Michael I. Schwartzbach (Developments in Language Theory, 1999)

An n log n Algorithm for Online BDD Refinement. - Nils Klarlund (J. Algorithms, 1999)

A Domain-Specific Language for Regular Sets of Strings and Trees. - Nils Klarlund; Michael I. Schwartzbach (IEEE Trans. Software Eng., 1999)

DSD: A schema language for XML. - Nils Klarlund; Anders Møller; Michael I. Schwartzbach (FMSP, 2000)

Verification of a Sliding Window Protocol Using IOA and MONA. - Mark A. Smith; Nils Klarlund (FORTE, 2000)

Towards SMIL as a foundation for multimodal, multimedia applications. - Jennifer L. Beckham; Giuseppe Di Fabbrizio; Nils Klarlund (INTERSPEECH, 2001)

The DSD Schema Language. - Nils Klarlund; Anders Møller; Michael I. Schwartzbach (Autom. Softw. Eng., 2002)

MONA Implementation Secrets. - Nils Klarlund; Anders Møller; Michael I. Schwartzbach (Int. J. Found. Comput. Sci., 2002)

XML: Model, Schemas, Types, Logics, and Queries. - Nils Klarlund; Thomas Schwentick; Dan Suciu (Logics for Emerging Applications of Databases, 2003)

Editing by voice and the role of sequential symbol systems for improved human-to-computer information rates. - Nils Klarlund (ICASSP (5), 2003)

Regularity Results for FIFO Channels. - Nils Klarlund; Richard J. Trefler (AVoCS, 2004)

Software Model Checking: Searching for Computations in the Abstract or the Concrete. - Patrice Godefroid; Nils Klarlund (IFM, 2005)

DART: directed automated random testing. - Patrice Godefroid; Nils Klarlund; Koushik Sen (PLDI, 2005)

Relativizations for the Logic-Automata Connection. - Nils Klarlund (High. Order Symb. Comput., 2005)

Algorithmic Analysis of Piecewise FIFO Systems. - Naghmeh Ghafari; Arie Gurfinkel; Nils Klarlund; Richard J. Trefler (FMCAD, 2007)

Reachability Problems in Piecewise FIFO Systems. - Naghmeh Ghafari; Arie Gurfinkel; Nils Klarlund; Richard J. Trefler (ACM Trans. Comput. Log., 2012)