research-article

Parametrised Modal Interface Automata

Authors:

Antti Siirtola,

Keijo HeljankoAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 14, Issue 4

Article No.: 65, Pages 1 - 25

https://doi.org/10.1145/2776892

Published: 09 September 2015 Publication History

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.

Supplementary Material

a65-siirtola-apndx.pdf (siirtola.zip)

Supplemental movie, appendix, image and software files for, Parametrised Modal Interface Automata

Download
106.28 KB

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.

Digital 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.

Digital 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.

Digital 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.

[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.

Digital Library

[6]

Jean Bovet and Terence Parr. 2008. ANTLRWorks: An ANTLR grammar development environment. Software: Practice and Experience 38, 12, 1305--1332.

Digital 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.

[8]

Sadie J. Creese. 2001. Data Independent Induction: CSP Model Checking of Arbitrary Sized Networks. Ph.D. Dissertation. Oxford University.

[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.

Digital 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.

[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.

Digital 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.

[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.

[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.

Digital Library

[15]

Robert P. Kurshan and Kenneth L. McMillan. 1995. A structural induction theorem for processes. Information and Computation 117, 1, 1--11.

Digital Library

[16]

Gerald Lüttgen and Walter Vogler. 2013a. Modal interface automata. Logical Methods in Computer Science 9, 3, 265--279.

[17]

Gerald Lüttgen and Walter Vogler. 2013b. Richer interface automata with optimistic and pessimistic compatibility. Acta Informatica 52, 4--5, 305--336.

Digital 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.

Digital Library

[19]

Brendan D. McKay and Adolfo Piperno. 2014. Practical graph isomorphism II. Journal of Symbolic Computation 60, 94--112.

Digital Library

[20]

Christos M. Papadimitriou. 1994. Computational Complexity. Addison-Wesley, Reading, MA.

[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.

Digital Library

[22]

A. William Roscoe. 2010. Understanding Concurrent Systems. Springer.

Digital Library

[23]

Antti Siirtola. 2010a. Algorithmic Multiparameterised Verification of Safety Properties. Process Algebraic Approach. Ph.D. Dissertation. University of Oulu.

[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.

Digital 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.

[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.

Digital 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.

Digital 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.

Digital 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.

Digital 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.

Digital Library

Cited By

Siirtola AHeljanko K(2020)An optimal cut-off algorithm for parameterised refinement checkingScience of Computer Programming10.1016/j.scico.2020.102517198(102517)Online publication date: Oct-2020
https://doi.org/10.1016/j.scico.2020.102517
Xu MJin ZZhang FCui F(2020)Information Flow-Based Security Construction for Compositional Interface AutomataTrusted Computing and Information Security10.1007/978-981-15-3418-8_3(31-43)Online publication date: 20-Feb-2020
https://doi.org/10.1007/978-981-15-3418-8_3
Siirtola AHeljanko K(2018)Dynamic Cut-Off Algorithm for Parameterised Refinement CheckingFormal Aspects of Component Software10.1007/978-3-030-02146-7_13(256-276)Online publication date: 5-Oct-2018
https://doi.org/10.1007/978-3-030-02146-7_13
Show More Cited By

Index Terms

Parametrised Modal Interface Automata
1. Software and its engineering
  1. Software notations and tools
    1. Context specific languages
      1. Interface definition languages
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods
        Model checking
2. Theory of computation
  1. Models of computation
    1. Computability
    2. Concurrency

Recommendations

Parametrised Interface Automata
ACSD '14: Proceedings of the 2014 14th International Conference on Application of Concurrency to System Design

Interface theories (ITs) enable us to analyse the compatibility of interfaces and refine interfaces while preserving their compatibility. However, most ITs are for finite state interfaces whereas real software systems are heavily parametrised involving ...
Regular model checking for LTL(MSO)

Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems whose states can be represented as words of arbitrary length over a finite alphabet, in which regular sets of words are used to represent sets of ...
PVS Strategies for Proving Abstraction Properties of Automata

Abstractions are important in specifying and proving properties of complex systems. To prove that a given automaton implements an abstract specification automaton, one must first find the correct abstraction relation between the states of the automata, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 14, Issue 4

December 2015

604 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/2821757

Editor:
Sandeep K. Shukla
Virginia Tech, USA

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 09 September 2015

Accepted: 01 May 2015

Revised: 01 May 2015

Received: 01 October 2014

Published in TECS Volume 14, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Academy of Finland projects
SARANA project in the SAFIR 2014 program

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
142
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Siirtola AHeljanko K(2020)An optimal cut-off algorithm for parameterised refinement checkingScience of Computer Programming10.1016/j.scico.2020.102517198(102517)Online publication date: Oct-2020
https://doi.org/10.1016/j.scico.2020.102517
Xu MJin ZZhang FCui F(2020)Information Flow-Based Security Construction for Compositional Interface AutomataTrusted Computing and Information Security10.1007/978-981-15-3418-8_3(31-43)Online publication date: 20-Feb-2020
https://doi.org/10.1007/978-981-15-3418-8_3
Siirtola AHeljanko K(2018)Dynamic Cut-Off Algorithm for Parameterised Refinement CheckingFormal Aspects of Component Software10.1007/978-3-030-02146-7_13(256-276)Online publication date: 5-Oct-2018
https://doi.org/10.1007/978-3-030-02146-7_13
Siirtola A(2017)Refinement Checking Parameterised Quorum Systems2017 17th International Conference on Application of Concurrency to System Design (ACSD)10.1109/ACSD.2017.15(39-48)Online publication date: Jun-2017
https://doi.org/10.1109/ACSD.2017.15
Křetínský J(2017)30 Years of Modal Transition Systems: Survey of Extensions and AnalysisModels, Algorithms, Logics and Tools10.1007/978-3-319-63121-9_3(36-74)Online publication date: 25-Jul-2017
https://doi.org/10.1007/978-3-319-63121-9_3

View Options

Get Access

Login options

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

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents