MONA 1.X: New techniques for WS1S and WS2S

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1427 LNCS, Issue , 1998, Pages 516-520

  Elgaard, Jacob ^a   Klarlund, Nils ^b   Moller, Anders ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

DECISION PROCEDURE; FRONT END; SEMANTIC PROPERTIES;

COMPUTER AIDED ANALYSIS;

EID: 84863894209     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028773     Document Type: Conference Paper

References (6)

1. M. Biehl, N. Klarlund, and T. Rauhe. Mona: decidable arithmetic in practice (short contribution). In Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, LNCS 1135. Springer Verlag, 1996.
2. J. Glenn and W. Gasarch. Implementing WSlS via finite automata. In Automata Implementation, WIA '96, Proceedings, volume 1260 of LNCS, 1997.
3. J.L. Jensen, M.E. Jørgensen, N. Klarlund, and M.I. Schwartzbach. Automatic verification of pointer programs using monadic second-order logic. In SIGPLAN'97 Conference on Programming Language Design and Implementation, pages 226-234. SIGPLAN, 1997. (Pubitemid 127453701)
4. P. Kelb, T. Margaria, M. Mendier, and C. Gsottberger. Mosel: a flexible toolset for Monadic Second-order Logic. In Computer Aided Verification, CAV '97, Proceedings, LNCS 1217, 1997.
5. N. Klarlund. Mona & Fido: the logic-automaton connection in practice. In CSL '97 Proceedings, 1998. To appear in LNCS.
6. F. Morawietz and T. Cornell. On the recognizability of relations over a tree definable in a monadic second order tree description language. Technical Report SFB 340, Seminar für Sprachwissenschaft Eberhard-Karls- Universität Tübingen, 1997.