skip to main content
research-article

Parametrised Modal Interface Automata

Published:09 September 2015Publication History
Skip Abstract Section

Abstract

Interface theories (ITs) enable us to analyse the compatibility interfaces and refine them while preserving their compatibility. However, most ITs are for finite state interfaces, whereas computing systems are often parametrised involving components, the number of which cannot be fixed. We present, to our knowledge, the first IT that allows us to specify a parametric number of interfaces. Moreover, we provide a fully algorithmic procedure, implemented in a tool, for checking the compatibility of and refinement between parametrised interfaces. Finally, we show that the restrictions of the technique are necessary; removing any of them renders the refinement checking problem undecidable.

Skip Supplemental Material Section

Supplemental Material

References

  1. Fides Aarts and Frits W. Vaandrager. 2010. Learning I/O automata. In CONCUR 2010—Concurrency Theory. Lecture Notes in Computer Science, Vol. 6269. Springer, 71--85. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Krzysztof R. Apt and Dexter C. Kozen. 1986. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters 22, 6, 307--309. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Sebastian S. Bauer, Philip Mayer, Andreas Schroeder, and Rolf Hennicker. 2010. On weak modal compatibility, refinement, and the MIO Workbench. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, Vol. 6015. Springer, 175--189. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Machiel Bijl, Arend Rensink, and Jan Tretmans. 2004. Compositional testing with IOCO. In Formal Approaches to Software Testing. Lecture Notes in Computer Science, Vol. 2931. Springer, 86--100.Google ScholarGoogle Scholar
  5. Ahmed Bouajjani, Peter Habermehl, and Tomás Vojnar. 2008. Verification of parametric concurrent systems with prioritised FIFO resource management. Formal Methods in System Design 32, 2, 129--172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Jean Bovet and Terence Parr. 2008. ANTLRWorks: An ANTLR grammar development environment. Software: Practice and Experience 38, 12, 1305--1332. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Ferenc Bujtor and Walter Vogler. 2014. Error-pruning in interface automata. In SOFSEM 2014: Theory and Practice of Computer Science. Lecture Notes in Computer Science, Vol. 8327. Springer, 162--173.Google ScholarGoogle Scholar
  8. Sadie J. Creese. 2001. Data Independent Induction: CSP Model Checking of Arbitrary Sized Networks. Ph.D. Dissertation. Oxford University.Google ScholarGoogle Scholar
  9. Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman, and Andrzej Wsowski. 2010. Timed I/O automata: A complete specification theory for real-time systems. In Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control (HSCC’10). ACM, New York, NY, 91--100. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Luca de Alfaro and Thomas A. Henzinger. 2005. Interface-based design. In Engineering Theories of Software Intensive Systems. NATO Science Series, Vol. 195. Springer, 83--104.Google ScholarGoogle Scholar
  11. Laurent Doyen, Thomas A. Henzinger, Barbara Jobstmann, and Tatjana Petrov. 2008. Interface theories with component reuse. In Proceedings of the 8th ACM International Conference on Embedded Software (EMSOFT’08). ACM, New York, NY, 79--88. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. E. Allen Emerson and Vineet Kahlon. 2004. Parameterized model checking of ring-based message passing systems. In Computer Science Logic. Lecture Notes in Computer Science, Vol. 3210. Springer, 325--339.Google ScholarGoogle ScholarCross RefCross Ref
  13. Silvio Ghilardi and Silvio Ranise. 2010. Backward reachability of array-based systems by SMT solving: termination and invariant synthesis. Logical Methods in Computer Science 6, 4, 1--48.Google ScholarGoogle ScholarCross RefCross Ref
  14. Alexander Kaiser, Daniel Kroening, and Thomas Wahl. 2010. Dynamic cutoff detection in parameterized concurrent programs. In Computer Aided Verification. Lecture Notes in Computer Science, Vol. 6174. Springer, 645--659. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Robert P. Kurshan and Kenneth L. McMillan. 1995. A structural induction theorem for processes. Information and Computation 117, 1, 1--11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Gerald Lüttgen and Walter Vogler. 2013a. Modal interface automata. Logical Methods in Computer Science 9, 3, 265--279.Google ScholarGoogle ScholarCross RefCross Ref
  17. Gerald Lüttgen and Walter Vogler. 2013b. Richer interface automata with optimistic and pessimistic compatibility. Acta Informatica 52, 4--5, 305--336. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Nancy A. Lynch and Mark R. Tuttle. 1987. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC’87). ACM, New York, NY, 137--151. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Brendan D. McKay and Adolfo Piperno. 2014. Practical graph isomorphism II. Journal of Symbolic Computation 60, 94--112. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Christos M. Papadimitriou. 1994. Computational Complexity. Addison-Wesley, Reading, MA.Google ScholarGoogle Scholar
  21. Jean-Baptiste Raclet, Eric Badouel, Albert Benveniste, Benoît Caillaud, Axel Legay, and Roberto Passerone. 2011. A modal interface theory for component-based design. Fundamenta Informaticae 108, 1--2, 119--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. A. William Roscoe. 2010. Understanding Concurrent Systems. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Antti Siirtola. 2010a. Algorithmic Multiparameterised Verification of Safety Properties. Process Algebraic Approach. Ph.D. Dissertation. University of Oulu.Google ScholarGoogle Scholar
  24. Antti Siirtola. 2010b. Cut-offs with network invariants. In Proceedings of the 2010 10th International Conference on Application of Concurrency to System Design (ACSD’10). IEEE, Los Alamitos, CA, 105--114. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Antti Siirtola. 2014a. Bounds2: A tool for compositional multi-parametrised verification. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, Vol. 8413. Springer, 599--604.Google ScholarGoogle Scholar
  26. Antti Siirtola. 2014b. Parametrised interface automata. In Proceedings of the 2014 14th International Conference on Application of Concurrency to System Design (ACSD’14). IEEE, Los Alamitos, CA, 176--185. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Antti Siirtola and Keijo Heljanko. 2012. Parametrised compositional verification with multiple process and data types. In Proceedings of the 2013 13th International Conference on Application of Concurrency to System Design (ACSD’13). IEEE, Los Alamitos, CA, 60--69. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Antti Siirtola and Juha Kortelainen. 2009. Algorithmic verification with multiple and nested parameters. In Formal Methods and Software Engineering. Lecture Notes in Computer Science, Vol. 5885. Springer, 561--580. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Antti Valmari and Martti Tienari. 1991. An improved failures equivalence for finite-state systems with a reduction algorithm. In Proceedings of the International Symposium on Protocol Specification, Testing, and Verification XI. 3--18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Qiusong Yang and Mingshu Li. 2010. A cut-off approach for bounded verification of parameterized systems. In Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering (ICSE’10), Vol. 1. ACM, New York, NY, 345--354. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Parametrised Modal Interface Automata

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!