Skip to main content

Language-Based Testing for Pushdown Reactive Systems

  • Conference paper
  • First Online:
Formal Methods: Foundations and Applications (SBMF 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14414))

Included in the following conference series:

  • 84 Accesses

Abstract

Testing reactive systems is important to guarantee a precise and robust software development process. Pushdown reactive systems are complex applications where the interaction with the environment is regulated by a pushdown memory and, in general, can be specified by the formalism of Input/Output Visibly Pushdown Labeled Transition System (IOVPTS). A conformance checking can then be applied to verify whether an implementation is in compliance to a specification using an appropriate conformance relation. In this work, we establish a conformance relation based on Visibly Pushdown Languages (VPLs) to model sets of desirable and undesirable behaviors of systems. Further, we show that test suites with a complete fault coverage can be generated using this new conformance relation for pushdown reactive systems.

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

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    It is also customary to write \(\mathcal {O}(m\ln m)\) as \(\widetilde{\mathcal {O}}(m)\). In the sequel, we can always replace \(\mathcal {O}(\cdot )\) by \(\widetilde{\mathcal {O}}(\cdot )\).

References

  1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty sixth Annual ACM Symposium on Theory of Computing, STOC 2004, pp. 202–211. ACM, New York (2004). https://doi.org/10.1145/1007352.1007390

  2. Bonifacio, A.L.: Conformance checking for pushdown reactive systems based on visibly pushdown languages (2023). http://arxiv.org/abs/2308.07177

  3. Bonifacio, A.L., Moura, A.V.: Testing asynchronous reactive systems: beyond the ioco framework. CLEI Electron. J. 24(10) (2021). https://doi.org/10.19153/cleiej.24.1.10

  4. Bonifacio, A.L., Moura, A.V.: Conformance checking and pushdown reactive systems. CLEI Electron. J. 25(3) (2022). https://doi.org/10.19153/cleiej.25.3.2

  5. Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, Heidelberg (2005). https://doi.org/10.1007/b137241

    Book  MATH  Google Scholar 

  6. Chédor, S., Jéron, T., Morvan, C.: Test generation from recursive tiles systems. In: Brucker, A.D., Julliand, J. (eds.) TAP 2012. LNCS, vol. 7305, pp. 99–114. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30473-6_9

    Chapter  Google Scholar 

  7. Constant, C., Jeannet, B., Jéron, T.: Automatic test generation from interprocedural specifications. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) FATES/TestCom -2007. LNCS, vol. 4581, pp. 41–57. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73066-8_4

    Chapter  Google Scholar 

  8. Gorrieri, R.: Labeled transition systems. In: Process Algebras for Petri Nets. MTCSAES, pp. 15–34. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-55559-1_2

    Chapter  MATH  Google Scholar 

  9. Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems, vol. 13, pp. 477–498. Springer, Heidelberg (1985). https://doi.org/10.1007/978-3-642-82453-1_17

    Chapter  Google Scholar 

  10. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Bostpn (1979)

    MATH  Google Scholar 

  11. Müllerburg, M., Holenderski, L., Maffeis, O., Merceron, A., Morley, M.: Systematic testing and formal verification to validate reactive programs. Softw. Qual. J. 4(4), 287–307 (1995). https://doi.org/10.1007/BF00402649

    Article  Google Scholar 

  12. Peleska, J.: Test automation for safety-critical systems: industrial application and future developments. In: Gaudel, M.-C., Woodcock, J. (eds.) FME 1996. LNCS, vol. 1051, pp. 39–59. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-60973-3_79

    Chapter  Google Scholar 

  13. Tretmans, G.J.: Test generation with inputs, outputs and repetitive quiescence. Technical Report TR-CTIT-96-26, Centre for Telematics and Information Technology University of Twente, Enschede (1996)

    Google Scholar 

  14. Tretmans, J.: Model based testing with labelled transition systems. In: Formal Methods and Testing, pp. 1–38 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Adilson Luiz Bonifacio .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bonifacio, A.L. (2024). Language-Based Testing for Pushdown Reactive Systems. In: Barbosa, H., Zohar, Y. (eds) Formal Methods: Foundations and Applications. SBMF 2023. Lecture Notes in Computer Science, vol 14414. Springer, Cham. https://doi.org/10.1007/978-3-031-49342-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-49342-3_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-49341-6

  • Online ISBN: 978-3-031-49342-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics