Skip to main content
SpringerLink
Log in

Constraint Solving for Sequences in Software Validation and Verification

  • Conference paper
Declarative Programming for Knowledge Management (INAP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4369))

  • 332 Accesses

Abstract

Constraint programming techniques are successfully used in various areas of software engineering for industry, commerce, transport, finance etc. Constraint solvers for different data types are applied in validation and verification of programs containing data elements of these types. A general constraint solver for sequences is necessary to take into account this data type in the existing validation and verification tools. In this work, we present an original constraint solver for sequences implemented in CHR and based on T. Frühwirth’s solver for lists with the propagation of two constraints: generalized concatenation and size. Experimental results show its better efficiency compared to the intuitive propagation algorithm based on subsequences. The applications of the solver (with the validation and verification tool BZTT) to different software engineering problems are illustrated by the example of a waiting room model.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  2. Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  3. Berkaoui, L., Legeard, B.: Représentation de séquences définies sur des ensembles non instanciés par arbre PQR partiel. In: Actes de JFPLC 1998, Nantes, France, pp. 251–266. Hermès (May 1998)

    Google Scholar 

  4. Bouquet, F., Legeard, B., Peureux, F.: CLPS-B – Constraint solver to animate a B specification. International Journal on Software Tools for Technology Transfer 6(2), 143–157 (2004)

    Article  Google Scholar 

  5. The BZ-Testing-Tools, web site: http://lifc.univ-fcomte.fr/~bztt University of Franche-Comté, Besançon

  6. Colmerauer, A.: An introduction to Prolog III. Communications of the ACM 33(7), 69–90 (1990)

    Article  Google Scholar 

  7. Durnev, V.G.: Studying algorithmic problems for free semi-groups and groups. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol. 1234, pp. 88–101. Springer, Heidelberg (1997)

    Google Scholar 

  8. Frühwirth, T.: Theory and Practice of Constraint Handling Rules. In: Stuckey, P., Marriot, K. (eds.) Special Issue on Constraint Logic Programming. Journal of Logic Programming 37(1-3), 95–138 (1998)

    MATH  Google Scholar 

  9. Frühwirth, T.: The CHR, web site: http://www.informatik.uni-ulm.de/pm/fileadmin/pm/home/fruehwirth/chr.html Universität Ulm

  10. Karhumäki, J., Mignosi, F., Plandowski, W.: The expressibility of languages and relations by word equations. Journal of the ACM 47(3), 483–505 (2000)

    Article  MathSciNet  Google Scholar 

  11. Koscielski, A., Pacholski, L.: Complexity of Makanin’s Algorithm. Journal of the ACM 43(4), 670–684 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kosmatov, N.: Constraint solving for sequences, web site: http://lifc.univ-fcomte.fr/~kosmatov/sequences University of Franche-Comté, Besançon

  13. Kosmatov, N., Legeard, B., Peureux, F., Utting, M.: Boundary Coverage Criteria for Test Generation from Formal Models. In: Proc. of the 15th Int. Symp. on Software Reliability Engineering (ISSRE 2004), Saint-Malo, France, pp. 139–150. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  14. Makanin, G.S.: The problem of solvability of equations in a free semigroup. Mat. Sbornik (N.S.) 103(2), 147–236 (1977) (in Russian); English translation in: Math. URSS Sbornik 32, 129–198 (1977)

    MathSciNet  Google Scholar 

  15. Spivey, J.M.: The Z Notation: A Reference Manual, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CASSIS, INRIA Lorraine, LIFC, University of Franche-Comté, 16 route de Gray, 25030, Besançon, France

    Nikolai Kosmatov

Authors
  1. Nikolai Kosmatov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology, Iizuka, Fukuoka, Japan

    Masanobu Umeda

  2. Fraunhofer FIRST, Kekuléstr. 7, D-12489, Berlin, Germany

    Armin Wolf

  3. IF Computer Japan, 5-28-2 Sendagi, Bunkyo-ku, 113-0022, Tokyo, Japan

    Oskar Bartenstein

  4. Fraunhofer FIRST, Berlin,  

    Ulrich Geske

  5. Universität Würzburg, Am Hubland, 97074, Würzburg, Germany

    Dietmar Seipel

  6. Graduate School of Computer Science and Systems Engineering,, Kyushu Institute of Technology, Iizuka, Fukuoka, Japan

    Osamu Takata

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kosmatov, N. (2006). Constraint Solving for Sequences in Software Validation and Verification. In: Umeda, M., Wolf, A., Bartenstein, O., Geske, U., Seipel, D., Takata, O. (eds) Declarative Programming for Knowledge Management. INAP 2005. Lecture Notes in Computer Science(), vol 4369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963578_3

Download citation

  • DOI: https://doi.org/10.1007/11963578_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69233-1

  • Online ISBN: 978-3-540-69234-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation