A decision procedure for alternation-free modal μ-calculi

Advances in Modal Logic 2006

Volumn 7, Issue , 2008, Pages 341-362

  Tanabe, Yoshinori ^a   Takahashi, Koichi ^b   Hagiya, Masami ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

Author keywords

Decision procedure; Modal calculus; Satisfiability

Indexed keywords

COMPLEX DECISION; DECISION PROCEDURE; EXPRESSIVE POWER; FUNCTIONAL MODALITIES; PROGRAM ANALYSIS; SATISFIABILITY;

BIOMINERALIZATION; COMPUTABILITY AND DECIDABILITY;

CALCULATIONS;

EID: 84863338294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Takahashi, K., Hagiya, M.: Abstraction of graph transformation using temporal formulas. In: Supplemental Volume of the 2003 International Conference on Dependable Systems and Networks (DNS-2003). (2003) W-65 to W-66
2. Hagiya, M., Takahashi, K., Yamamoto, M., Sato, T.: Analysis of synchronous and asynchronous cellular automata using Abstraction by temporal logic. In: FLOPS2004: The Seventh Functional and Logic Programming Symposium. Volume 2998 of Lecture Notes in Computer Science. (2004) 7-21
3. Tanabe, Y., Takahashi, K., Yamamoto, M., Sato, T., Hagiya, M.: An implementation of a decision procedure for satisfiability of two-way CTL formulae using BDD (in Japanese). Computer Software 22(3) (2005) 154-166
4. Tanabe, Y., Takahashi, K., Yamamoto, M., Tozawa, A., Hagiya, M.: A decision procedure for the alternation-free two-way modal μ-calculus. In Beckert, B., ed.: TABLEAUX. Volume 3702 of Lecture Notes in Computer Science., Springer (2005) 277-291
5. Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 24(3) (2002) 217-298
6. Bonatti, P.A., Peron, A.: On the undecidability of logics with converse, nominals, recursion and counting. Artificial Intelligence 158 (2004) 75-96
7. JavaBDD: http://javabdd.sourceforge.net/
8. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27(3) (1983) 333-354
9. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended Abstract). In: FOCS, IEEE (1991) 368-377
10. Bonatti, P.A., Lutz, C., Murano, A., Vardi, M.Y.: The complexity of enriched μ-calculi. In Bugliesi, M., Preneel, B., Sassone, V., Wegener, I., eds.: ICALP (2). Volume 4052 of Lecture Notes in Computer Science., Springer (2006) 540-551
11. Emerson, E.A.: Temporal and modal logic. In: Handbook of theoretical computer science (vol. B): formal models and semantics, Elsevier Science Publishers B.V. (1990) 995-1072
12. Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for K. In: Proceedings of the 18th International Conference on Automated Deduction, Springer-Verlag (2002) 16-30
13. Pan, G., Vardi, M.Y.: Optimizing a BDD-based modal solvar. In: 19th International Conference on Automated Deduction. Volume 2741 of Lecture Notes in Computer Science. (2003) 75-89
14. Henriksen, J.G., Jensen, J.L., Jøgensen, M.E., Klarlund, N., Paige, R., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems. Volume 1019 of Lecture Notes in Computer Science., Springer-Verlag (1995) 89-110
15. Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS, IEEE Computer Society (2005) 531-542
16. van Eijck, J.: HyLoTab - tableau-based theorem proving for hybrid logics (2002) Manuscript, CWI, available from http://www.cwi.nl/jve/hylotab.
17. Walukiewicz, I.: Completeness of Kozens axiomatisation of the propositional mucalculus. Information and Computation 157 (2000) 142-182
18. Zappe, J.: Modal μ-calculus and alternating tree automata. In Grädel, E., Thomas, W., Wilke, T., eds.: Automata, Logics, and Infinite Games. Volume 2500 of Lecture Notes in Computer Science., Springer (2001) 171-184
19. Tanabe, Y.: Satisfiability Judgment of Modal Logics and their Application to Verification Problems. PhD thesis, University of Tokyo (2008)
20. Sekizawa, T., Tanabe, Y., Yuasa, Y., Takahashi, K.: MLAT: A tool for heap analysis based on predicate Abstraction by modal logic. In: IASTED International Conference on Software Engineering (SE 2008). (2008) 310-317
21. Schorr, H., Waite, W.M.: An efficient machine-independent procedure for garbage collection in various list structures. Commun. ACM 10(8) (1967) 501-506