|
СТ |
A Domain-Specific Language for Regular Sets of Strings and Trees |
1999 |
Klarlund N., Schwartzbach M. I. |
|
|
|
IEEE Trans. on Software Engineering |
29.10.1999 |
|
СТ |
Mona & Fido: The Logic-Automaton Connection in Practice |
1998 |
Klarlund N. |
|
|
|
Lecture Notes in Computer Science |
19.06.1998 |
|
СТ |
Automatic Verification of Pointer Programs using Monadic Second-Order Logic |
1997 |
Jensen J. L., Jorgensen M. E., Klarlund N., Schwartzbach M. I. |
|
|
|
SIGPLAN Notices |
09.07.1997 |
|
СТ |
Formal Design Constraints |
1996 |
Klarlund N., Koistinen J. |
|
|
|
SIGPLAN Notices |
20.02.1997 |
|
СТ |
A Case Study in Verification Based on Trace Abstractions |
1996 |
Klarlund N., Nielsen M., Sunesen K. |
|
|
|
Lecture Notes in Computer Science |
24.12.1996 |
|
СТ |
Determinizing Buchi Asynchronous Automata |
1995 |
Klarlund N., Mukund M., Sohoni M. |
|
|
|
Lecture Notes in Computer Science |
31.01.1996 |
|
СТ |
Mona: Monadic Second-Order Logic in Practice |
1995 |
Henriksen J. G., Jensen J., Jorgensen M., Klarlund N., Paige R., Rauhe T., Sandholm A. |
|
|
|
Lecture Notes in Computer Science |
11.01.1996 |
|
СТ |
A Homomorphism Concept for -Regularity |
1995 |
Klarlund N. |
Lecture Notes in Computer Science |
|
|
Computer Science Logic |
29.08.1995 |
|
СТ |
Hardware Verification using Monadic Second-Order Logic |
1995 |
Basin D. A., Klarlund N. |
|
|
|
Lecture Notes in Computer Science |
26.07.1995 |
|
СТ |
The Limit View of Infinite Computations |
1994 |
Klarlund N. |
|
|
|
Lecture Notes in Computer Science |
26.08.1994 |
|
СТ |
Determinizing Asynchronous Automata |
1994 |
Klarlund N., Mukund M., Sohoni M. |
|
|
|
Lecture Notes in Computer Science |
09.08.1994 |
