Nils Klarlund - RankMe

46 papers A* 13A 4B 6C 3Journal 9Unranked 10

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