Skip to main content
SpringerLink
Log in

Towards Formal Verification of ToolBus Scripts

  • Conference paper
Algebraic Methodology and Software Technology (AMAST 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5140))

Abstract

ToolBus allows one to connect tools via a software bus. Programming is done using the scripting language Tscript, which is based on the process algebra ACP. Tscript was originally designed to enable formal verification, but this option has so far not been explored in any detail. We present a method for analyzing a Tscript by translating it to the process algebraic language mCRL2, and then applying model checking to verify behavioral properties.

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. Bergstra, J., Klint, P.: The ToolBus coordination architecture. In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol. 1061, pp. 75–88. Springer, Heidelberg (1996)

    Google Scholar 

  2. Bergstra, J., Klint, P.: The discrete time ToolBus - a software coordination architecture. Sci. Comput. Program. 31(2-3), 205–229 (1998)

    Article  MATH  Google Scholar 

  3. Bergstra, J., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60(1-3), 109–137 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. Groote, J.F., Mathijssen, A., Reniers, M., Usenko, Y., van Weerdenburg, M.: The formal specification language mCRL2. In: Proc. Methods for Modelling Software Systems. Number 06351 in Dagstuhl Seminar Proceedings (2007)

    Google Scholar 

  5. Bergstra, J., Heering, J., Klint, P.: Module algebra. J. ACM 37(2), 335–372 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garavel, H., Mateescu, R., Lang, F., Serwe, W.: CADP 2006: A toolbox for the construction and analysis of distributed processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 158–163. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Wing, J.: Writing Larch interface language specifications. ACM TOPLAS 9(1), 1–24 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Guaspari, D., Marceau, C., Polak, W.: Formal verification of Ada programs. IEEE Trans. Software Eng. 16(9), 1058–1075 (1990)

    Article  Google Scholar 

  9. Zhao, J., Rinard, M.: Pipa: A behavioral interface specification language for AspectJ. In: Pezzé, M. (ed.) ETAPS 2003 and FASE 2003. LNCS, vol. 2621, pp. 150–165. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Kiczales, G., Hilsdale, E., Hugunin, J., Kersten, M., Palm, J., Griswold, W.: An overview of AspectJ. In: Knudsen, J.L. (ed.) ECOOP 2001. LNCS, vol. 2072, pp. 327–353. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Larsson, D., Alexandersson, R.: Formal verification of fault tolerance aspects. In: Proc. ISSRE 2005, pp. 279–280. IEEE, Los Alamitos (2005)

    Google Scholar 

  12. Diertens, B.: Simulation and animation of process algebra specifications. Technical Report P9713, University of Amsterdam (1997)

    Google Scholar 

  13. Diertens, B.: Software (re-)engineering with PSF III: An IDE for PSF. Technical Report PRG0708, University of Amsterdam (2007)

    Google Scholar 

  14. van den Brand, M., de Jong, H., Klint, P., Olivier, P.: Efficient annotated terms. Softw. Pract. Exper. 30(3), 259–291 (2000)

    Article  Google Scholar 

  15. Klint, P.: A meta-environment for generating programming environments. ACM TOSEM 2(2), 176–201 (1993)

    Article  Google Scholar 

  16. van den Brand, M., van Deursen, A., Heering, J., de Jong, H., de Jonge, M., Kuipers, T., Klint, P., Moonen, L., Olivier, P., Scheerder, J., Vinju, J., Visser, E., Visser, J.: The ASF+SDF Meta-Environment: a Component-Based Language Development Environment. In: Wilhelm, R. (ed.) CC 2001 and ETAPS 2001. LNCS, vol. 2027, pp. 365–370. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Fokkink, W., Ioustinova, N., Kesseler, E., van de Pol, J., Usenko, Y., Yushtein, Y.: Refinement and verification applied to an in-flight data acquisition unit. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 1–23. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Blom, S., Ioustinova, N., Sidorova, N.: Timed verification with μCRL. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol. 2890, pp. 178–192. Springer, Heidelberg (2004)

    Google Scholar 

  19. Wijs, A.: Achieving discrete relative timing with untimed process algebra. In: Proc. ICECCS 2007, pp. 35–46. IEEE, Los Alamitos (2007)

    Google Scholar 

  20. Alur, R., Dill, D.: A theory of timed automata. Theor. Comput. Sci. 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  21. Alur, R.: Timed automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 8–22. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  22. Groote, J.F., Reniers, M., Usenko, Y.: Time abstraction in timed μCRL a la regions. In: Proc. IPDPS 2006. IEEE, Los Alamitos (2006)

    Google Scholar 

  23. Valero Espada, M., van de Pol, J.: An abstract interpretation toolkit for μCRL. Formal Methods in System Design 30(3), 249–273 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Engineering Cluster, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands

    Wan Fokkink, Paul Klint, Bert Lisser & Yaroslav S. Usenko

  2. Theoretical Computer Science Section, Vrije Universiteit Amsterdam, The Netherlands

    Wan Fokkink

  3. Programming Research Group, Universiteit van Amsterdam, The Netherlands

    Paul Klint

  4. Laboratory for Quality Software (LaQuSo), Technische Universiteit Eindhoven, The Netherlands

    Yaroslav S. Usenko

Authors
  1. Wan Fokkink
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul Klint
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bert Lisser
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yaroslav S. Usenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Meseguer Grigore Roşu

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fokkink, W., Klint, P., Lisser, B., Usenko, Y.S. (2008). Towards Formal Verification of ToolBus Scripts. In: Meseguer, J., Roşu, G. (eds) Algebraic Methodology and Software Technology. AMAST 2008. Lecture Notes in Computer Science, vol 5140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79980-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79980-1_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79979-5

  • Online ISBN: 978-3-540-79980-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation