Mosel: A flexible toolset for monadic second-order logic

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

Volumn 1217, Issue , 1997, Pages 183-202

  Kelb, Peter ^a   Margaria, Tiziana ^a   Mendler, Michael ^a   Gsottberger, Claudia ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; FORMAL METHODS; RECONFIGURABLE HARDWARE; SEMANTICS;

ANALYSIS AND VERIFICATIONS; DECISION PROCEDURE; FORMAL SEMANTICS; INPUT FORMAT; LAYERED APPROACHES; MINIMAL SUBSET; MODULAR DESIGNS; MONADIC SECOND-ORDER LOGIC;

COMPUTER CIRCUITS;

EID: 84958745608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0035388     Document Type: Conference Paper

References (28)

1. S. Akers: "Binary Decision Diagrams," IEEE Trans, on Comp. Vol. C-27, 1978, pp. 509-516.
2. D. Basin, N. Klarlund: "Hardware verification using monadic second-order logic," Proc. CAV’95, Liege (B), July 1995, LNCS N. 939, Springer Verlag, pp. 31-41.
3. N. Bjorner, A. Browne, E. Chang, M. Colon, A. Kapur, Z. Manna, H. Sipma, T. Uribe: "STeP: Deductive-algorithmic verification of reactive and real-time systems," Proc. CAV’96, New Brunswick, NJ (USA), Aug. 1996, LNCS N. 1102, Springer Verlag, pp. 415-418.
4. M. von der Beeck, V. Braun, A. Clafien, A. Dannecker, C. Friedrich, D. Koschützki, T. Margaria, F. Schreiber and B. Steffen: "Graphs in METAFrame: The Unifying Power of Polymorphism," Proc. TACAS’97, Enschede (NL), April 1997, in this same Volume of LNCS, Springer.
5. J. Burch, E. Clarke, K. McMillan, D. Dill, L. Hwang: "Symbolic model checking: IO20 states and beyond," Proc. LICS’90, Philadelphia, 1990, pp. 428-439.
6. R. E. Bryant: "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Computing, vol. C-35(8), August 1986, pp. 677-691.
7. R. E. Bryant: "Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams," ACM Computing Surveys Vol. 4, 1992, pp. 293-318.
8. J. R. Büchi: "Weak second-order arithmetic and finite automato, " Z. Math. Logik Grundl. Math., Vol. 6, 1960, pp. 66-92.
9. A. Church: "Logic, arithmetic and automata," Proc. Int. Congr. Math., Almqvist and Wiksells, Uppsala 1963, pp. 23-35.
10. daVinci: the tool is available via ftp at site ftp://ftp.uni-bremen.de/pub/graphics/daVinci
11. C. Friedrich: "The ffgraph library," Techn. Rep. MIP-9520, Fakultat für Mathematik und Informatik, Universitat Passau, December 1995.
12. J. Hopcroft: "An n log n algorithm for minimizing states in a finite automaton," Proc. Int. Symp. on Theory of Machines and Computations, Technion, Haifa (IL), Aug. 1971, pp. 189-196.
13. P. Kelb: "Abstraktionstechniken für automatische Verifikationsmethoden," Ph. D. Diss., Univ. of Oldenburg (Germany), Dec. 1995, Shaker Verlag, Aachen (D).
14. J. Henriksen, J. Jensen, M. Jorgensen N. Klarlund, R. Paige, T. Rauhe, A. Sandholm: "Mona: Monadic second-order logie in practice," Proc. TACAS’95, Arhus (DK), May 1995, LNCS 1019, Springer V., pp. 89-110.
15. N. Klarlund, M. Nielsen, K. Sunesen: "A Case Study in Verification Based on Trace Abstractions," in M. Broy, S. Merz, K. Spies (eds.), Formal Systems Verification - The RPC-Memory Specification Case Study, LNCS N. 1169, Springer V., Nov. 1996.
16. T. Margaria, M. Mendier: "Automatic Treatment of Sequential Circuits in Second-Order Monadic Logic", 4th GI/ITG/GME Worksh. on Methoden des Entwurfs und der Verifikation digitaler Systeme, Kreischa (D), March 1996, Shaker Verlag.
17. T. Margaria, M. Mendier: "Model-based Automatic Synthesis and Analysis in Second-Order Monadic Logic," Proc. AAS’97, ACM/SIGPLAN Int. Worksh. on Automated Analysis of Software, Paris (F), Jan. 1997, pp. 99-112.
18. T. Margaria: "Fully Automatic Verification and Error Detection for Parameterized Iterative Sequential Circuits", Proc. TACAS’96, Passau (D), March 1996, LNCS N. 1055, Springer Verlag, pp. 258-277.
19. T. Margaria: "Verification of Systolic Arrays in M2L(Str)," Techn. Rep. MIP-9613, Fakultat für Mathematik und Informatik, Universitat Passau, July 1996.
20. O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkema: "Report on the Program AMoRE’, Techn. Rep. Nr. 9507, Inst. für Informatik und Praktische Mathematik, Universitat Kiel (D), 1995.
21. J. K. Ousterhout: "Tel and the Tk Toolkit," Addison-Wesley, April 1994.
22. R. Paige, R. Tarjan: "Three partition refinement algorithms," SIAM Journ. of Computation, Vol. 16, N. 6, Dec. 1987, pp. 973-989.
23. K. S. Brace, R. L. Rudell, R. E. Bryant: "Efficient Implementation of a BDD Package," Proc. DAC’90, Orlando, FL, June 1990, pp. 40-45.
24. B. Stefïen, T. Margaria, A. Clafien, V. Braun: "Incrementai Formalization: A Key to Industrial Success", In "SOFTWARE: Concepts and Tools", Vol. 17, No 2, pp. 78-91, Springer Verlag, July 1996.
25. B. Steffen, T. Margaria, A. Clafien, V. Braun: "The METAFrame’95 Environment’, (Experience Report for the Industry Day), Proc. CAV’96, Juli-Aug. 1996, New Brunswick, NJ, USA, LNCS N. 1102, Springer Verlag, pp. 450-453.
26. B. Steffen, T. Margaria, A. Clafien: "Heterogeneous Analysis and Verification for Distributed Systems", In "SOFTWARE: Concepts and Tools", vol. 17, N. 1, pp. 13-25, Springer Verlag, 1996.
27. W. Thomas: "Automata on infinite objects," In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, p. 133-191. MIT Press/Elsevier, 1990.
28. W. Thomas: "Languages, automata, and objects," to appear in the fortheoming new edition of the Handbook of Theoretical Computer Science, MIT Press/Elsevier.