Mona implementation secrets

International Journal of Foundations of Computer Science

Volumn 13, Issue 4, 2002, Pages 571-586

  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

finite state automata; monadic second order logic; the MONA tool

Indexed keywords

EID: 18944382304     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012905410200128X     Document Type: Article

References (49)

1. Abdelwaheb Ayari, David Basin, and Stefan Friedrich. Structural and behavioral modeling with monadic logics. In The Twenty-Ninth IEEE International Symposium on Multiple-Valued Logic. IEEE Computer Society, 1999.
2. Abdelwaheb Ayari, David Basin, and Andreas Podelski. LISA: A specification language based on WS2S. In CSL '97, LNCS, 1998.
3. David Basin and Stefan Friedrich. Combining WS1S and HOL. In Frontiers of Combining Systems 2, volume 7 of Studies in Logic and Computation. Research Studies Press/Wiley, 2000.
4. David Basin and Nils Klarlund. Automata based symbolic reasoning in hardware verification. Formal Methods In System Design, 13:255-288, 1998. Extended version of: "Hardware verification using monadic second-order logic," CAV '95, LNCS 939.
5. Kai Baukus, Karsten Stahl, Saddek Bensalem, and Yassine Lakhnech. Abstracting WS1S systems to verify parameterized networks. In Tools and Algorithms for the Construction and Analysis of Systems, TACAS '00, volume 1785 of LNCS, 2000.
6. Morten Biehl, Nils Klarlund, and Theis Rauhe. Mona: decidable arithmetic in practice (demo). In Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, volume 1135 of LNCS, 1996.
7. Morten Biehl, Nils Klarlund, and Theis Rauhe. Algorithms for guided tree automata. In First International Workshop on Implementing Automata, WIA '96, volume 1260 of LNCS, 1997.
8. 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 '00, volume 1785 of LNCS, 2000.
9. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677~691, Aug 1986.
10. R.E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. A CM Computing surveys, 24(3):293-318, September 1992.
11. J.R. Biichi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math., 6:66-92, 1960.
12. 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), 1991.
13. Niels Damgaard, Nils Klarlund, and Michael I. Schwartzbach. YakYak: Parsing with logical side constraints. In Proceedings of DLT'99, 1999.
14. J. Doner. Tree acceptors and some of their applications. J. Comput. System Sci., 4:406-451, 1970.
15. Jacob Elgaard, Nils Klarlund, and Anders M0ller. Mona l.x: new techniques for WS1S and WS2S. In Computer Aided Verification, CAV '98, volume 1427 of LNCS, 1998.
16. Jacob Elgaard, Anders M0ller, and Michael I. Schwartzbach. Compile-time debugging of C programs working on trees. In Proceedings of European Symposium on Programming Languages and Systems, ESOP '00, volume 1782 of LNCS, 2000.
17. C.C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society, 98:21-52, 1961.
18. J. Glenn and W. Gasarch. Implementing WS1S via finite automata. In Automata Implementation, WIA '96, volume 1260 of LNCS, 1997.
19. Aarti Gupta and Allan L. Fisher. Representation and symbolic manipulation of linearly inductive boolean functions. In Proceedings of the IEEE International Conference on Computer-Aided Design. IEEE Computer Society Press, 1993.
20. J.G. Henriksen, J. Jensen, M. J0rgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In TACAS '95, volume 1019 of LNCS, 1996.
21. Thomas Hune and Anders Sandholm. A case study on using automata in control synthesis. In Fundamental Approaches to Software Engineering, FASE'00, volume 1783 of LNCS, 2000.
22. Jacob L. Jensen, Michael E. J0rgensen, Nils Klarlund, and Michael I. Schwartzbach. Automatic verification of pointer programs using monadic second-order logic. In PLDI '97, 1997.
23. Bengt Jonsson and Marcus Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In Tools and Algorithms for the Construction and Analysis of Systems, TACAS '00, volume 1785 of LNCS, 2000.
24. P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. MOSEL: a flexible toolset for Monadic Second-order Logic. In Tools and Algorithms for Construction and Analysis of Systems, TACAS '97, volume 1217 of LNCS, 1997.
25. Nils Klarlund. Mona 8z Fido: The logic-automaton connection in practice. In Computer Science Logic, CSL '97, volume 1414 of LNCS, 1998.
26. Nils Klarlund. An nlogn algorithm for online BDD refinement. Journal of Algorithms, 32:133-154, 1999. Abbreviated version in CAV '97, LNCS 1254.
27. Nils Klarlund. A theory of restrictions for logics and automata. In Computer Aided Verification, CAV '99, volume 1633 of LNCS, 1999.
28. Nils Klarlund, Jari Koistinen, and Michael I. Schwartzbach. Formal design constraints. In Proceedings of OOPSLA '96, 1996.
29. Nils Klarlund and Anders M0ller. MONA Version 14 User Manual. BRICS Notes Series NS-01-1, Department of Computer Science, University of Aarhus, January 2001.
30. Nils Klarlund, Mogens Nielsen, and Kim Sunesen. Automated logical verification based on trace abstraction. In Proceedings of PODC '96, 1996.
31. Nils Klarlund, Mogens Nielsen, and Kim 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.
32. Nils Klarlund and Theis Rauhe. BDD algorithms and cache misses. Technical report, BRICS Report Series RS-96-5, Department of Computer Science, University of Aarhus, 1996.
33. Nils Klarlund and Michael I. Schwartzbach. A domain-specific language for regular sets of strings and trees. IEEE Transactions On Software Engineering, 25(3) :378-386, 1999.
34. O. Matz, A. Miller, A. Potthoff, W. Thomas, and E. Valkema. Report on the program AMoRE. Technical report, Report 9507, Inst, fur Informatik u. Prakt. Mathematik, CAU Kiel, 1995.
35. Ken McMillan. Symbolic Model Checking. Kluwer, 1993.
36. 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.
37. Anders M0ller. MONA project home page, http://www.brics.dk/mona/.
38. Anders M0ller and Michael I. Schwartzbach. The pointer assertion logic engine. In Proceedings of Conference on Programming Language Design and Implementation, PLDI '01. ACM, 2001.
39. Prank Morawietz and Tom Cornell. The logic-automaton connection in linguistics. In Proceedings of LACL '97, number 1582 in LNAI, 1997.
40. Marcus Nilsson. Analyzing parameterized distributed algorithms. Master's thesis, Department of Computer Systems at Uppsala University, Sweden, 1999.
41. Sam Owre and Harald Ruess. Integrating WSIS with PVS. In Conference on Computer-Aided Verification, CAV '00, LNCS, 2000.
42. Paritosh K. Pandya. DC VALID 1.3: The user manual. Technical report, Tata Institute of Fundamental Research, STCS-99/1, 1999.
43. Anders Steen Rasmussen. Symbolic model checking using monadic second order logic as requirement language. Master's thesis, Technical University of Denmark (DTU), 1999. IT-E 821.
44. Anders Sandholm and Michael I. Schwartzbach. Distributed safety controllers for Web services. In Fundamental Approaches to Software Engineering, FASE'98, volume 1382 of LNCS, 1998.
45. Thomas R. Shiple, James H. Kukula, and Rajeev K. Ranjan. A comparison of Presburger engines for EFSM reachability. In Computer Aided Verification, CAV '98, volume 1427 of LNCS, 1998.
46. Mark A. Smith and Nils Klarlund. Verification of a sliding window protocol using IOA and Mona, 1999.
47. J.W. Thatcher and J.B. Wright. Generalized finite automata with an application to a decision problem of second-order logic. Math. Systems Theory, 2:57-82, 1968.
48. Wolfgang Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133-191. MIT Press/Elsevier, 1990.
49. S. Yang. Logic synthesis and optimization benchmarks user guide version 3.0. In Tech. Rep. MCNC, 1991.