MONA 1.x: New techniques for WS1S and WS2S
In this note, we present the first version of the MONA tool to be released in its entirety. The tool now offers decision procedures for both WS1S and WS2S and a completely rewritten front-end. Here, we present some of our techniques, which make calculations couched in WS1S run up to five times faster than with our pre-release tool based on M2L(Str). This suggests that WS1S—with its better semantic properties—is preferable to M2L(Str).
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 2.J. Glenn and W. Gasarch. Implementing WS1S via finite automata. In Automata Implementation, WIA '96, Proceedings, volume 1260 of LNCS, 1997.Google Scholar
- 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.Google Scholar
- 4.P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. Mosel: a flexible toolset for Monadic Second-order Logic. In Computer Aided Verification, CAV '97, Proceedings, LNCS 1217, 1997.Google Scholar
- 5.N. Klarlund. Mona & Fido: the logic-automaton connection in practice. In CSL '97 Proceedings, 1998. To appear in LNCS.Google Scholar
- 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-Universität Tübingen, 1997.Google Scholar