BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Belgium
1 × Germany
1 × Italy
2 × Denmark
2 × Israel
2 × The Netherlands
3 × Canada
5 × USA
Collaborated with:
M.I.Schwartzbach P.Godefroid A.Møller D.A.Basin D.Kozen T.Rauhe J.L.Jensen M.E.Jørgensen K.Sen N.Damgaard J.Elgaard J.Koistinen M.Biehl M.Mukund M.A.Sohoni J.G.Henriksen R.Paige A.Sandholm
Talks about:
logic (6) automata (5) mona (4) second (3) order (3) monad (3) constraint (2) algorithm (2) practic (2) theori (2)

Person: Nils Klarlund

DBLP DBLP: Klarlund:Nils

Contributed to:

IFM 20052005
PLDI 20052005
CIAA 20002000
CAV 19991999
DLT 19991999
CAV 19981998
CAV 19971997
CSL 19971997
PLDI 19971997
OOPSLA 19961996
WIA 19961996
CAV 19951995
TACAS 19951995
ICALP 19941994
POPL 19931993
LICS 19921992
LICS 19911991

Wrote 17 papers:

IFM-2005-GodefroidK #model checking
Software Model Checking: Searching for Computations in the Abstract or the Concrete (PG, NK), pp. 20–32.
PLDI-2005-GodefroidKS #automation #named #random testing #testing
DART: directed automated random testing (PG, NK, KS), pp. 213–223.
CIAA-2000-KlarlundMS #implementation
MONA Implementation Secrets (NK, AM, MIS), pp. 182–194.
CAV-1999-Klarlund #automaton #formal method #logic #strict
A Theory of Restrictions for Logics and Automata (NK), pp. 406–417.
DLT-1999-KlarlundDS #constraints #logic #named #parsing
Yakyak: parsing with logical side constraints (NK, ND, MIS), pp. 286–301.
CAV-1998-ElgaardKM
MONA 1.x: New Techniques for WS1S and WS2S (JE, NK, AM), pp. 516–520.
CAV-1997-Klarlund #algorithm #online #refinement
An n log n Algorithm for Online BDD Refinement (NK), pp. 107–118.
CSL-1997-Klarlund
Mona & Fido: The Logic-Automaton Connection in Practice (NK), pp. 311–326.
PLDI-1997-JensenJKS #automation #higher-order #logic #monad #pointer #source code #using #verification
Automatic Verification of Pointer Programs using Monadic Second-Order Logic (JLJ, MEJ, NK, MIS), pp. 226–236.
OOPSLA-1996-KlarlundKS #constraints #design
Formal Design Constraints (NK, JK, MIS), pp. 370–383.
WIA-1996-BiehlKR #algorithm #automaton
Algorithms for Guided Tree Automata (MB, NK, TR), pp. 6–25.
CAV-1995-BasinK #hardware #higher-order #logic #monad #using #verification
Hardware Verification using Monadic Second-Order Logic (DAB, NK), pp. 31–41.
TACAS-1995-HenriksenJJKPRS #higher-order #logic #monad #named
Mona: Monadic Second-Order Logic in Practice (JGH, JLJ, MEJ, NK, RP, TR, AS), pp. 89–110.
ICALP-1994-KlarlundMS #automaton
Determinizing Asynchronous Automata (NK, MM, MAS), pp. 130–141.
POPL-1993-KlarlundS #graph
Graph Types (NK, MIS), pp. 196–205.
LICS-1992-Klarlund #automaton #metric #set
Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata (NK), pp. 382–393.
LICS-1991-KlarlundK #automaton #metric
Rabin Measures and Their Applications to Fairness and Automata Theory (NK, DK), pp. 256–265.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.