MONA implementation secrets

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

Volumn 2088, Issue , 2001, Pages 182-194

  Klarlund, Nils ^a   Møller, Anders ^b   Schwartzbach, Michael I ^b  

^a AT AND T LABS RESEARCH   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS; TREES (MATHEMATICS);

CACHE-CONSCIOUS; DECISION PROCEDURE; ORDERS OF MAGNITUDE; THREE-VALUED LOGIC; TREE AUTOMATA; WORST-CASE COMPLEXITY;

MANY VALUED LOGICS;

EID: 84954454453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44674-5_15     Document Type: Conference Paper

References (29)

1. Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson. Handling global conditions in parameterized system Verification. In Computer Aided Verification, CAV '99, volume 1633 of LNCS, 1999.
2. David Basin and Nils Klarlund. Hardware Verification using monadic second-order logic. In Computer Aided Verification, CAV '95, volume 939 of LNCS, 1995.
3. David Basin and Nils Klarlund. Automata based symbolic reasoning in hardware Verification. Formal Methods in Systems Design, 13(3):255-288, 1998.
4. Morten Biehl, Nils Klarlund, and Theis Rauhe. Algorithms for guided tree automata. In WIA '96, volume 1260 of LNCS, 1996.
5. Jean-Paul Bodeveix and Mamoun Filali. FMona: a tool for expressing validation techniques over infinite state systems. In Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2000, volume 1785 of LNCS, 2000.
6. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug 1986.
7. J.R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math., 6:66-92, 1960.
8. J.R. Büchi. On a decision method in restricted second-order arithmetic. In Proc. Internat. Cong. on Logic, Methodol., and Philos. of Sci. Stanford University Press, 1962.
9. K. M. Butler, D. E. Ross, R. Kapur, and M. R. Mercer. Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams. In Proc. ACM/IEEE Design Automation Conference (DAC), pages 417-420, 1991.
10. Niels Damgaard, Nils Klarlund, and Michael I. Schwartzbach. YakYak: Parsing with logical side constraints. In Proceedings of DLT'99, 1999.
11. Jacob Elgaard, Nils Klarlund, and Anders Møller. Mona 1.x: New techniques for WS1S and WS2S. In Computer Aided Verification, CAV '98, volume 1427 of LNCS, 1998.
12. Jacob Elgaard, Anders Møller, and Michael I. Schwartzbach. Compile-time debugging of C programs working on trees. In Proceedings of European Symposium on Programming Languages and Systems, volume 1782 of LNCS, 2000.
13. C.C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21-52, 1961.
14. J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithms for the Construction and Analysis of Systems, First International Workshop, TACAS '95, volume 1019 of LNCS, 1996.
15. Thomas Hune and Anders Sandholm. A case study on using automata in control synthesis. In Proceedings of FASE'00, 2000.
16. 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, 1997.
17. N. Klarlund, M. Nielsen, and K. Sunesen. A case study in automated Verification based on trace abstractions. In M. Broy, S. Merz, and K. Spies, editors, Formal System Specification, The RPC-Memory Specification Case Study, volume 1169 of LNCS, pages 341-374. Springer Verlag, 1996.
18. N. Klarlund and T. Rauhe. BDD algorithms and cache misses. Technical report, BRICS Report Series RS-96-5, Department of Computer Science, University of Aarhus, 1996.
19. Nils Klarlund. A theory of restrictions for logics and automata. In Computer Aided Verification, CAV '99, volume 1633 of LNCS, 1999.
20. Nils Klarlund and Anders Møller. MONA Version 1.3 User Manual. BRICS Notes Series NS-98-3 (2.revision), Department of Computer Science, University of Aarhus, October 1998. URL: http://www.brics.dk/mona/manual.html.
21. A.R. Meyer. Weak monadic second-order theory of successor is not elementary recursive. In R. Parikh, editor, Logic Colloquium, (Proc. Symposium on Logic, Boston, 1972), volume 453 of LNCS, pages 132-154, 1975.
22. Anders Møller. MONA homepage. URL: http://www.brics.dk/mona/.
23. Frank Morawietz and Tom Cornell. The logic-automaton connection in linguistics. In Proceedings of LACL 1997, volume 1582 of LNAI, 1997.
24. Paritosh K. Pandya. DCVALID 1.2. Technical report, Theoretical Computer Science Group, Tata Institute of Fundamental Research, 1997.
25. Anders Sandholm and Michael I. Schwartzbach. Distributed safety controllers for web services. In FASE, volume 1382 of LNCS, 1998.
26. Thomas R. Shiple, James H. Kukula, and Rajeev K. Ranjan. A comparison of Presburger engines for EFSM reachability. In CAV, volume 1427 of LNCS, 1998.
27. Mark A. Smith and Nils Klarlund. Verification of a sliding window protocol using IOA and Mona, 1999. Submitted for publication.
28. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133-191. MIT Press/Elsevier, 1990.
29. S. Yang. Logic synthesis and optimization benchmarks user guide version 3.0. In Tech. Rep. MCNC, 1991.