Skip to main content
SpringerLink
Log in

Mu-Calculus Satisfiability with Arithmetic Constraints

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

The propositional modal μ-calculus is a well-known specification language for labeled transition systems. In this work, we study an extension of this logic with converse modalities and Presburger arithmetic constraints, interpreted over tree models. We describe a satisfiability algorithm based on breadth-first construction of Fischer-Lardner models. An implementation together several experiments are also reported. Furthermore, we also describe an application of the algorithm to solve static analysis problems over semi-structured data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.

Similar content being viewed by others

REFERENCES

  1. Bonatti, P.A., Lutz, C., Murano, A., and Vardi, M.Y., The complexity of enriched mu-calculi, Logical Methods Comput. Sci., 2008, vol. 4, no. 3, pp. 1–27.

    Article  Google Scholar 

  2. Bárcenas, E. and Lavalle, J., Global numerical constraints on trees, Logical Methods Comput. Sci., 2014, vol. 10, no. 2, pp. 1–28.

    Article  MathSciNet  Google Scholar 

  3. Bárcenas, E., Benítez-Guerrero, E., Lavalle, J., and Molero-Castillo, G., Presburger constraints on trees, Computación y Sistemas, 2020, vol. 24, no. 1.

  4. Limón, Y., Bárcenas, E., Benítez-Guerrero, E., Molero-Castillo, G., and Velázquez-Mena, A., A satisfiability algorithm for the mu-calculus for trees with presburger constraints, Proc. 7th Int. Conf. in Software Engineering Research and Innovation (CONISOFT), Mexico, 2019.

  5. Demri, S. and Lugiez, D., Complexity of modal logics with presburger constraints, J. Appl. Logic, 2010, vol. 8, no. 3, pp. 233–252.

    Article  MathSciNet  Google Scholar 

  6. Seidl, H., Schwentick, T., and Muscholl, A., Counting in trees, in Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas], Flum, J., Grädel, E., and Wilke, T., Eds., Amsterdam Univ. Press, 2008, vol. 2, pp. 575–612.

    Google Scholar 

  7. Seidl, H., Schwentick, T., and Muscholl, A., Numerical document queries, in Proc. the 22nd ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Neven, F., Beeri, C., and Milo, T., Eds., ACM, 2003, pp. 155–166.

  8. de Moura, L. and Bjørner, N., Z3: an efficient smt solver, in Tools and Algorithms for the Construction and Analysis of Systems, Ramakrishnan, C.R. and Rehof, J., Eds., Berlin, Heidelberg: Springer, 2008, pp. 337–340.

    MATH  Google Scholar 

  9. Hoder, K., Bjørner, N., and de Moura, L., μz– an efficient engine for fixed points with constraints, in Computer Aided Verification, Gopalakrishnan, G. and Qadeer, S., Eds., Berlin, Heidelberg: Springer, 2011, pp. 457–462.

  10. Conradie, W., Fomatati, Y., Palmigiano, A., and Sourabh, S., Algorithmic correspondence for intuitionistic modal mu-calculus, Theor. Comput. Sci., 2015, vol. 564, pp. 30–62.

    Article  MathSciNet  Google Scholar 

  11. Biehl, M., Klarlund, N., and Rauhe, T., Mona: decidable arithmetic in practice, in Formal Techniques in Real-Time and Fault-Tolerant Systems, Jonsson, B. and Parrow, J., Eds., Berlin, Heidelberg: Springer, 1996, pp. 459–462.

    Google Scholar 

  12. Genevès, P., Layaïda, N., and Schmitt, A., Efficient static analysis of XML paths and types, in Proc. ACM SIGPLAN 2007 Conf. on Programming Language Design and Implementation, San Diego, CA, June 10–13, 2007, Ferrante, J. and McKinley, K.S., Eds., ACM, 2007, pp. 342–351.

  13. Limón, Y., Bárcenas, E., Benítez-Guerrero, E., and Nieto, M.A.M., Depth-first reasoning on trees, Computación y Sistemas, 2018, vol. 22, no. 1, pp. 189–201.

    Google Scholar 

  14. Junedi, M., Genevès, P., and Layaïda, N., XML query-update independence analysis revisited, in Proc. ACM Symp. on Document Engineering, DocEng’12, Paris, Sept. 4–7, 2012, Concolato, C. and Schmitz, P., Eds., ACM, 2012, pp. 95–98.

  15. Fischer, M.J. and Ladner, R.E., Propositional modal logic of programs (extended abstract), in Proc. ACM Symp. on Theory of Computing, Hopcroft, J.E., Friedman, E.P., and Harrison, M.A., Eds., ACM, 1977, pp. 286–294.

  16. The World Wide Web Consortium (W3C), XPath 2.0 W3C Recommendation, 2010. |https://www.w3.org/TR/xpath20/.

  17. Lisovsky, K.Y., XML applications development in scheme, Program. Comput. Software, 2002, vol. 28, no. 4, pp. 197–206

    Article  Google Scholar 

  18. Limón, Y., Bárcenas, E., Benítez-Guerrero, E., and Molero, G., On the consistency of context-aware systems, J. Intellig. Fuzzy Syst., 2018, vol. 34, no. 5, pp. 3373–3383.

    Article  Google Scholar 

  19. Mashechkin, I.V., Petrovskiy, M., Tsarev, D.V., and Chikunov, M.N., Machine learning methods for detecting and monitoring extremist information on the internet, Program. Comput. Software, 2019, vol. 45, no. 3, pp. 99–115.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Veracruz, Calle Salvador Díaz Mirón 35, Zona Universitaria, 91090, Xalapa-Enríquez, Ver., Mexico

    Y. Limón & E. Benítez-Guerrero

  2. UNAM Coyoacán Mayor’s Office, C.P. 04510, Mexico City, CDMX, Mexico

    E. Bárcenas, G. Molero Castillo & A. Velázquez-Mena

Authors
  1. Y. Limón
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Bárcenas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Benítez-Guerrero
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. G. Molero Castillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. A. Velázquez-Mena
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Y. Limón, E. Bárcenas, E. Benítez-Guerrero, G. Molero Castillo or A. Velázquez-Mena.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Limón, Y., Bárcenas, E., Benítez-Guerrero, E. et al. Mu-Calculus Satisfiability with Arithmetic Constraints. Program Comput Soft 46, 503–510 (2020). https://doi.org/10.1134/S0361768820080137

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768820080137

Search

Navigation