default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNils Klarlund
Person information
- affiliation: AT&T Inc
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j9]Naghmeh Ghafari, Arie Gurfinkel
, Nils Klarlund, Richard J. Trefler:
Reachability Problems in Piecewise FIFO Systems. ACM Trans. Comput. Log. 13(1): 7:1-7:33 (2012)
2000 – 2009
- 2007
- [c36]Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard J. Trefler:
Algorithmic Analysis of Piecewise FIFO Systems. FMCAD 2007: 45-52 - 2005
- [j8]Nils Klarlund:
Relativizations for the Logic-Automata Connection. High. Order Symb. Comput. 18(1-2): 79-120 (2005) - [c35]Patrice Godefroid, Nils Klarlund:
Software Model Checking: Searching for Computations in the Abstract or the Concrete. IFM 2005: 20-32 - [c34]Patrice Godefroid, Nils Klarlund, Koushik Sen:
DART: directed automated random testing. PLDI 2005: 213-223 - 2004
- [c33]Nils Klarlund, Richard J. Trefler:
Regularity Results for FIFO Channels. AVoCS 2004: 21-36 - 2003
- [c32]Nils Klarlund, Thomas Schwentick, Dan Suciu:
XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases 2003: 1-41 - [c31]Nils Klarlund:
Editing by voice and the role of sequential symbol systems for improved human-to-computer information rates. ICASSP (5) 2003: 728-731 - [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]Nils Klarlund:
An n log n Algorithm for Online BDD Refinement. J. Algorithms 32(2): 133-154 (1999) - [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]Nils Klarlund:
A Theory of Restrictions for Logics and Automata. CAV 1999: 406-417 - [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]Nils Klarlund:
An n log n Algorithm for Online BDD Refinement. CAV 1997: 107-118 - [c21]Nils Klarlund:
Mona & Fido: The Logic-Automaton Connection in Practice. CSL 1997: 311-326 - [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]Nils Klarlund, Dexter Kozen:
Rabin Measures. Chic. J. Theor. Comput. Sci. 1995 (1995) - [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. Log. 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]Nils Klarlund:
The Limit View of Infinite Computations. CONCUR 1994: 351-366 - [c9]Nils Klarlund:
A Homomorphism Concepts for omega-Regularity. CSL 1994: 471-485 - [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]Nils Klarlund, Michael I. Schwartzbach:
Graph Types. POPL 1993: 196-205 - 1992
- [c5]Nils Klarlund:
Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. LICS 1992: 382-393 - [c4]Nils Klarlund:
Progress Measures and Stack Assertions for Fair Termination. PODC 1992: 229-240 - 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]Nils Klarlund:
Liminf Progress Measures. MFPS 1991: 477-491 - 1990
- [b1]Nils Klarlund:
Progress Measures and Finite Arguments for Infinite Computations. Cornell University, USA, 1990
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
