Search the dblp DataBase
Nils Klarlund :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Nils Klarlund Mona & Fido: The Logic-Automaton Connection in Practice. [Citation Graph (1, 0)][DBLP ] CSL, 1997, pp:311-326 [Conf ] Nils Klarlund , Michael I. Schwartzbach Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CAAP, 1994, pp:187-201 [Conf ] David A. Basin , Nils Klarlund Hardware Verification using Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP ] CAV, 1995, pp:31-41 [Conf ] Jacob Elgaard , Nils Klarlund , Anders Møller MONA 1.x: New Techniques for WS1S and WS2S. [Citation Graph (0, 0)][DBLP ] CAV, 1998, pp:516-520 [Conf ] Nils Klarlund An n log n Algorithm for Online BDD Refinement. [Citation Graph (0, 0)][DBLP ] CAV, 1997, pp:107-118 [Conf ] Nils Klarlund A Theory of Restrictions for Logics and Automata. [Citation Graph (0, 0)][DBLP ] CAV, 1999, pp:406-417 [Conf ] Nils Klarlund The Limit View of Infinite Computations. [Citation Graph (0, 0)][DBLP ] CONCUR, 1994, pp:351-366 [Conf ] Nils Klarlund A Homomorphism Concepts for omega-Regularity. [Citation Graph (0, 0)][DBLP ] CSL, 1994, pp:471-485 [Conf ] Nils Klarlund , Mogens Nielsen , Kim Sunesen A Case Study in Verification Based on Trace Abstractions. [Citation Graph (0, 0)][DBLP ] Formal Systems Specification, 1994, pp:341-373 [Conf ] Nils Klarlund , Thomas Schwentick , Dan Suciu XML: Model, Schemas, Types, Logics, and Queries. [Citation Graph (0, 0)][DBLP ] Logics for Emerging Applications of Databases, 2003, pp:1-41 [Conf ] Nils Klarlund , Niels Damgaard , Michael I. Schwartzbach Yakyak: parsing with logical side constraints. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1999, pp:286-301 [Conf ] Nils Klarlund , Michael I. Schwartzbach A Domain-Specific Language for Regular Sets of Strings and Trees. [Citation Graph (0, 0)][DBLP ] DSL, 1997, pp:- [Conf ] Nils Klarlund , Anders Møller , Michael I. Schwartzbach DSD: A schema language for XML. [Citation Graph (0, 0)][DBLP ] FMSP, 2000, pp:101-111 [Conf ] Nils Klarlund Progress Measures for Complementation of omega-Automata with Applications to Temporal Logic [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:358-367 [Conf ] Mark A. Smith , Nils Klarlund Verification of a Sliding Window Protocol Using IOA and MONA. [Citation Graph (0, 0)][DBLP ] FORTE, 2000, pp:19-34 [Conf ] Nils Klarlund , Madhavan Mukund , Milind A. Sohoni Determinizing Büchi Asnchronous Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:456-470 [Conf ] Morten Biehl , Nils Klarlund , Theis Rauhe Mona: Decidable Arithmetic in Practice. [Citation Graph (0, 0)][DBLP ] FTRTFT, 1996, pp:459-462 [Conf ] Nils Klarlund , Madhavan Mukund , Milind A. Sohoni Determinizing Asynchronous Automata. [Citation Graph (0, 0)][DBLP ] ICALP, 1994, pp:130-141 [Conf ] Patrice Godefroid , Nils Klarlund Software Model Checking: Searching for Computations in the Abstract or the Concrete. [Citation Graph (0, 0)][DBLP ] IFM, 2005, pp:20-32 [Conf ] Nils Klarlund Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata [Citation Graph (0, 0)][DBLP ] LICS, 1992, pp:382-393 [Conf ] Nils Klarlund , Dexter Kozen Rabin Measures and Their Applications to Fairness and Automata Theory [Citation Graph (0, 0)][DBLP ] LICS, 1991, pp:256-265 [Conf ] Nils Klarlund Liminf Progress Measures. [Citation Graph (0, 0)][DBLP ] MFPS, 1991, pp:477-491 [Conf ] Nils Klarlund , Jari Koistinen , Michael I. Schwartzbach Formal Design Constraints. [Citation Graph (0, 0)][DBLP ] OOPSLA, 1996, pp:370-383 [Conf ] Patrice Godefroid , Nils Klarlund , Koushik Sen DART: directed automated random testing. [Citation Graph (0, 0)][DBLP ] PLDI, 2005, pp:213-223 [Conf ] Jakob L. Jensen , Michael E. Jørgensen , Nils Klarlund , Michael I. Schwartzbach Automatic Verification of Pointer Programs using Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP ] PLDI, 1997, pp:226-236 [Conf ] Nils Klarlund Progress Measures and Stack Assertions for Fair Termination. [Citation Graph (0, 0)][DBLP ] PODC, 1992, pp:229-240 [Conf ] Nils Klarlund , Mogens Nielsen , Kim Sunesen Automated Logical Verification Based on Trace Abstractions. [Citation Graph (0, 0)][DBLP ] PODC, 1996, pp:101-110 [Conf ] Nils Klarlund , Michael I. Schwartzbach Graph Types. [Citation Graph (0, 0)][DBLP ] POPL, 1993, pp:196-205 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] TACAS, 1995, pp:89-110 [Conf ] Morten Biehl , Nils Klarlund , Theis Rauhe Algorithms for Guided Tree Automata. [Citation Graph (0, 0)][DBLP ] Workshop on Implementing Automata, 1996, pp:6-25 [Conf ] Nils Klarlund , Anders Møller , Michael I. Schwartzbach MONA Implementation Secrets. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:182-194 [Conf ] Nils Klarlund Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1994, v:69, n:2-3, pp:243-268 [Journal ] Nils Klarlund , Anders Møller , Michael I. Schwartzbach The DSD Schema Language. [Citation Graph (0, 0)][DBLP ] Autom. Softw. Eng., 2002, v:9, n:3, pp:285-319 [Journal ] Nils Klarlund , Dexter Kozen Rabin Measures. [Citation Graph (0, 0)][DBLP ] Chicago J. Theor. Comput. Sci., 1995, v:1995, n:, pp:- [Journal ] Nils Klarlund , Richard J. Trefler Regularity Results for FIFO Channels. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:128, n:6, pp:21-36 [Journal ] Nils Klarlund , Fred B. Schneider Proving Nondeterministically Specified Safety Properties Using Progress Measures [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1993, v:107, n:1, pp:151-170 [Journal ] Nils Klarlund , Anders Møller , Michael I. Schwartzbach MONA Implementation Secrets. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2002, v:13, n:4, pp:571-586 [Journal ] Nils Klarlund An n log n Algorithm for Online BDD Refinement. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1999, v:32, n:2, pp:133-154 [Journal ] Nils Klarlund Relativizations for the Logic-Automata Connection. [Citation Graph (0, 0)][DBLP ] Higher-Order and Symbolic Computation, 2005, v:18, n:1-2, pp:79-120 [Journal ] Nils Klarlund , Michael I. Schwartzbach A Domain-Specific Language for Regular Sets of Strings and Trees. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Software Eng., 1999, v:25, n:3, pp:378-386 [Journal ] Algorithmic Analysis of Piecewise FIFO Systems. [Citation Graph (, )][DBLP ] Search in 0.007secs, Finished in 0.009secs