Abstract
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).
Chapter PDF
References
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.
J. Glenn and W. Gasarch. Implementing WS1S via finite automata. In Automata Implementation, WIA '96, Proceedings, volume 1260 of LNCS, 1997.
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.
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.
N. Klarlund. Mona & Fido: the logic-automaton connection in practice. In CSL '97 Proceedings, 1998. To appear in LNCS.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elgaard, J., Klarlund, N., Møller, A. (1998). MONA 1.x: New techniques for WS1S and WS2S. In: Hu, A.J., Vardi, M.Y. (eds) Computer Aided Verification. CAV 1998. Lecture Notes in Computer Science, vol 1427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028773
Download citation
DOI: https://doi.org/10.1007/BFb0028773
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64608-2
Online ISBN: 978-3-540-69339-0
eBook Packages: Springer Book Archive