1
by Jacob Elgaard, Nils Klarlund, Anders Mller
http://www.brics.dk/~amoeller/papers/mona1x/paper.ps
Add To MetaCart
Abstract:
Abstract. In this note, we present the first version of the Mona tool to be released in its entirety. The tool now o#ers 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). 1
Citations
| 54 | Automatic verification of pointer programs using monadic second order logic – Jensen, Jørgensen, et al. - 1997 |
| 42 | FIDO: The logic-automaton connection in practice – Klarlund - 1997 |
| 21 | MOSEL: A flexible toolset for monadic second-order logic – Kelb, Margaria, et al. - 1997 |
| 8 | On the recognizability of relations over a tree definable in a monadic second order tree description language – Morawietz, Cornell - 1997 |
| 6 | Implementing WS1S via finite automata – Glenn, Gasarch - 1997 |
| 1 | Mona: decidable arithmetic in practice (short contribution – Biehl, Klarlund, et al. - 1996 |

