Skip to main content
Springer Nature Link
Log in

Variant Satisfiability of Parameterized Strings

  • Conference paper
  • First Online:
Rewriting Logic and Its Applications (WRLA 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12328))

Included in the following conference series:

  • 166 Accesses

Abstract

Two “knowingly incomplete,” yet useful, variant-based satisfiability procedures for QF formulas in the instantiations of two, increasingly more expressive, parameterized data types of strings are proposed. The first has four selector functions decomposing a list concatenation into its parts. The second adds a list membership predicate. The meaning of “parametric” here is much more general than is the case for decision procedures for strings in current SMT solvers, which are parametric on a finite alphabet. The parameterized data types presented here are parametric on a (typically infinite) algebraic data type of string elements. The main result is that if an algebraic data type has a variant satisfiability algorithm, then the data type of strings over such elements has a “knowingly incomplete,” yet practical, variant satisfiability algorithm, with no need for a Nelson-Oppen combination algorithm relating satisfiability in strings and in the given data type.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    If , with \(B_{0}\) associativity and/or commutativity axioms, and U identity axioms, the B-preregularity notion can be broadened by requiring only that: (i) \(\varSigma \) is \(B_{0}\)-preregular in the standard sense that \( ls (u\rho )= ls (v\rho )\) for all and substitutions \(\rho \); and (ii) the axioms U oriented as rules \(\vec {U}\) are sort-decreasing in the sense explained in Sect. 2.2.

  2. 2.

    In Maude, X would be the sort Elt of the TRIV parameter theory.

  3. 3.

    For more details about sufficient completeness of parameterized OS theories and methods for checking it see [16].

  4. 4.

    I am purposefully avoiding identity axioms because, thanks to the theory transformation in [8] mapping a convergent \(\vec {\mathcal {E}}\) with identity axioms U into a semantically equivalent convergent \(\vec {\mathcal {E}}_{U}\) where such axioms have been transformed into rewrite rules, this involves no real loss of generality.

References

  1. Abdulla, P.A., et al.: Norn: an SMT solver for string constraints. In: Kroening, D., Păsăreanu, C.S. (eds.) CAV 2015, Part I. LNCS, vol. 9206, pp. 462–469. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21690-4_29

    Chapter  Google Scholar 

  2. Cholewa, A., Meseguer, J., Escobar, S.: Variants of variants and the finite variant property. Technical report, CS Department, University of Illinois at Urbana-Champaign, February 2014. http://hdl.handle.net/2142/47117

  3. Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71999-1

    Book  MATH  Google Scholar 

  4. Comon-Lundh, H., Delaune, S.: The finite variant property: how to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 294–307. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-32033-3_22

    Chapter  Google Scholar 

  5. Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243–320, North-Holland (1990)

    Google Scholar 

  6. Durán, F., et al.: Programming and symbolic computation in Maude. J. Log. Algebr. Methods Program. 110, 1–57, 100497 (2020). https://doi.org/10.1016/j.jlamp.2019.100497

  7. Durán, F., Eker, S., Escobar, S., Martí-Oliet, N., Meseguer, J., Talcott, C.: Associative unification and symbolic reasoning modulo associativity in Maude. In: Rusu, V. (ed.) WRLA 2018. LNCS, vol. 11152, pp. 98–114. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99840-4_6

    Chapter  MATH  Google Scholar 

  8. Durán, F., Lucas, S., Meseguer, J.: Termination modulo combinations of equational theories. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS (LNAI), vol. 5749, pp. 246–262. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04222-5_15

    Chapter  MATH  Google Scholar 

  9. Durán, F., Meseguer, J.: Structured theories and institutions. Theor. Comput. Sci. 309(1–3), 357–380 (2003)

    Article  MathSciNet  Google Scholar 

  10. Eker, S.: A pragmatic approach to implementing associative unification, unpublished manuscript, SRI International, circa (2015)

    Google Scholar 

  11. Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. J. Algebr. Logic Program. 81, 898–928 (2012)

    Article  MathSciNet  Google Scholar 

  12. Goguen, J., Meseguer, J.: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theor. Comput. Sci. 105, 217–273 (1992)

    Article  MathSciNet  Google Scholar 

  13. Jouannaud, J.-P., Kirchner, C., Kirchner, H.: Incremental construction of unification algorithms in equational theories. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 361–373. Springer, Heidelberg (1983). https://doi.org/10.1007/BFb0036921

    Chapter  Google Scholar 

  14. Liang, T., Tsiskaridze, N., Reynolds, A., Tinelli, C., Barrett, C.: A decision procedure for regular membership and length constraints over unbounded strings. In: Lutz, C., Ranise, S. (eds.) FroCoS 2015. LNCS (LNAI), vol. 9322, pp. 135–150. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24246-0_9

    Chapter  Google Scholar 

  15. Meseguer, J.: Variants in the infinitary unification wonderland, submitted to WRLA 2020

    Google Scholar 

  16. Meseguer, J.: Order-sorted parameterization and induction. In: Palsberg, J. (ed.) Semantics and Algebraic Specification. LNCS, vol. 5700, pp. 43–80. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04164-8_4

    Chapter  MATH  Google Scholar 

  17. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73–155 (1992)

    Article  MathSciNet  Google Scholar 

  18. Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Presicce, F.P. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18–61. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-64299-4_26

    Chapter  Google Scholar 

  19. Meseguer, J.: Variant-based satisfiability in initial algebras. Sci. Comput. Program. 154, 3–41 (2018)

    Article  Google Scholar 

  20. Skeirik, S., Meseguer, J.: Metalevel algorithms for variant satisfiability. J. Log. Algebr. Methods Program. 96, 81–110 (2018)

    Article  MathSciNet  Google Scholar 

  21. Trinh, M., Chu, D., Jaffar, J.: S3: a symbolic string solver for vulnerability detection in web applications. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 1232–1243 (2014)

    Google Scholar 

  22. Zheng, Y., et al.: Z3str2: an efficient solver for strings, regular expressions, and length constraints. Formal Methods Syst. Des. 50(2), 249–288 (2016). https://doi.org/10.1007/s10703-016-0263-6

    Article  MATH  Google Scholar 

Download references

Acknowledgements

I cordially thank the referees for their very helpful suggestions to improve the paper. This work has been partially supported by NRL under contract N00173-17-1-G002.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA

    José Meseguer

Authors
  1. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to José Meseguer .

Editor information

Editors and Affiliations

  1. Valencian Research Institute for Artificial Intelligence, Universitat Politècnica de València, Valencia, Spain

    Santiago Escobar

  2. Facultad de Informática, Universidad Complutense de Madrid, Madrid, Spain

    Narciso Martí-Oliet

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Meseguer, J. (2020). Variant Satisfiability of Parameterized Strings. In: Escobar, S., Martí-Oliet, N. (eds) Rewriting Logic and Its Applications. WRLA 2020. Lecture Notes in Computer Science(), vol 12328. Springer, Cham. https://doi.org/10.1007/978-3-030-63595-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-63595-4_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-63594-7

  • Online ISBN: 978-3-030-63595-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics