Nils Klarlund

Affiliations:
  • AT&T Inc


According to our database1, Nils Klarlund authored at least 41 papers between 1990 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Reachability Problems in Piecewise FIFO Systems.
ACM Trans. Comput. Log., 2012

2007
Algorithmic Analysis of Piecewise FIFO Systems.
Proceedings of the Formal Methods in Computer-Aided Design, 7th International Conference, 2007

2005
Relativizations for the Logic-Automata Connection.
High. Order Symb. Comput., 2005

DART: directed automated random testing.
Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation, 2005

Software Model Checking: Searching for Computations in the Abstract or the Concrete.
Proceedings of the Integrated Formal Methods, 5th International Conference, 2005

2004
Regularity Results for FIFO Channels.
Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

2003
Editing by voice and the role of sequential symbol systems for improved human-to-computer information rates.
Proceedings of the 2003 IEEE International Conference on Acoustics, 2003

XML: Model, Schemas, Types, Logics, and Queries.
Proceedings of the Logics for Emerging Applications of Databases [outcome of a Dagstuhl seminar], 2003

2002
MONA Implementation Secrets.
Int. J. Found. Comput. Sci., 2002

The DSD Schema Language.
Autom. Softw. Eng., 2002

2001
Towards SMIL as a foundation for multimodal, multimedia applications.
Proceedings of the EUROSPEECH 2001 Scandinavia, 2001

2000
Verification of a Sliding Window Protocol Using IOA and MONA.
Proceedings of the Formal Techniques for Distributed System Development, 2000

DSD: A schema language for XML.
Proceedings of the Third Workshop on Formal Methods in Software Practice, 2000

1999
A Domain-Specific Language for Regular Sets of Strings and Trees.
IEEE Trans. Software Eng., 1999

An <i>n</i> log <i>n</i> Algorithm for Online BDD Refinement.
J. Algorithms, 1999

Yakyak: parsing with logical side constraints.
Proceedings of the Developments in Language Theory, 1999

A Theory of Restrictions for Logics and Automata.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1998
MONA 1.x: New Techniques for WS1S and WS2S.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997
Automatic Verification of Pointer Programs using Monadic Second-Order Logic.
Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation (PLDI), 1997

Mona & Fido: The Logic-Automaton Connection in Practice.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996
Algorithms for Guided Tree Automata.
Proceedings of the Automata Implementation, 1996

Automated Logical Verification Based on Trace Abstractions.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Formal Design Constraints.
Proceedings of the 1996 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1996

Mona: Decidable Arithmetic in Practice.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

1995
Rabin Measures.
Chic. J. Theor. Comput. Sci., 1995

Mona: Monadic Second-Order Logic in Practice.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1995

Determinizing Büchi Asnchronous Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Hardware Verification using Monadic Second-Order Logic.
Proceedings of the Computer Aided Verification, 1995

1994
Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata.
Ann. Pure Appl. Log., 1994

Determinizing Asynchronous Automata.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

A Case Study in Verification Based on Trace Abstractions.
Proceedings of the Formal Systems Specification, 1994

A Homomorphism Concepts for omega-Regularity.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

The Limit View of Infinite Computations.
Proceedings of the CONCUR '94, 1994

Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract).
Proceedings of the Trees in Algebra and Programming, 1994

1993
Proving Nondeterministically Specified Safety Properties Using Progress Measures
Inf. Comput., November, 1993

Graph Types.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1992
Progress Measures and Stack Assertions for Fair Termination.
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
Liminf Progress Measures.
Proceedings of the Mathematical Foundations of Programming Semantics, 1991

Rabin Measures and Their Applications to Fairness and Automata Theory
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Progress Measures for Complementation of omega-Automata with Applications to Temporal Logic
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Progress Measures and Finite Arguments for Infinite Computations.
PhD thesis, 1990


  Loading...