Abstract
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based system suffers from the scalability issues inherent in exhaustive techniques such as model checking. This work develops a theoretical framework and automated algorithms for modular verification of interface automata. We propose sound and complete assume-guarantee rules for interface automata, and learning-based algorithms to automate assumption generation. Our algorithms have been implemented in a practical model-checking tool and have been applied to a realistic NASA case study.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Cerny, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for java classes. In: Proc. 32nd POPL (2005)
Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Proc. 17th CAV (2005)
Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2) (1987)
Chaki, S., Strichman, O.: Optimized L* for assume-guarantee reasoning. In: Proc. 13th TACAS (2007)
Cheung, S.C., Kramer, J.: Checking safety properties using compositional reachability analysis. TOSEM 8(1) (1999)
Clarke, E.M., Long, D.E., McMillan, K.L.: Compositional model checking. In: Proc. 4th LICS (1989)
Cobleigh, J.M., Avrunin, G.S., Clarke, L.A.: Breaking up is hard to do: An investigation of decomposition for assume-guarantee reasoning. In: ISSTA (2006)
Cobleigh, J.M., Giannakopoulou, D., Păsăreanu, C.S.: Learning assumptions for compositional verification. In: Proc. 9th TACAS (2003)
de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proc. 8th ESEC/FSE (2001)
Gheorghiu, M., Giannakopoulou, D., Păsăreanu, C.S.: Refining interface alphabets for compositional verification. In: Proc. 13th TACAS (2007)
Giannakopoulou, D., Păsăreanu, C.S., Barringer, H.: Assumption generation for software component verification. In: Proc. 17th ASE (2002)
Grumberg, O., Long, D.E.: Model checking and modular verification. In: Proc. 2nd CONCUR (1991)
Henzinger, T.A., Jhala, R., Majumdar, R.: Permissive interfaces. In: Proc. 10th ESEC/FSE (2005)
Jones, C.B.: Specification and design of (parallel) programs. In: Proc. 9th IFIP Congress (1983)
Krimm, J.-P., Mounier, L.: Compositional state space generation from Lotos programs. In: Proc. 3rd TACAS (1997)
Letier, E., Kramer, J., Magee, J., Uchitel, S.: Monitoring and control in scenario-based requirements analysis. In: Proc. 27th ICSE (2005)
Lynch, N., Tuttle, M.: An introduction to input/output automata. Centrum voor Wiskunde en Informatica 2(3) (1989)
Magee, J., Kramer, J.: Concurrency: State Models & Java Programs. John Wiley & Sons, Chichester (1999)
Magee, J., Kramer, J., Giannakopoulou, D.: Behaviour analysis of software architectures. In: Proc. 1st WICSA (1999)
Nam, W., Alur, R.: Learning-based symbolic assume-guarantee reasoning with automatic decomposition. In: Proc. 4th ATVA (2006)
Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Logic and Models of Concurrent Systems (1984)
Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Proc. 21st STOC (1989)
Veanes, M., Campbell, C., Schulte, W., Tillmann, N.: Online testing with model programs. In: Proc. 10th ESEC/FSE (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emmi, M., Giannakopoulou, D., Păsăreanu, C.S. (2008). Assume-Guarantee Verification for Interface Automata. In: Cuellar, J., Maibaum, T., Sere, K. (eds) FM 2008: Formal Methods. FM 2008. Lecture Notes in Computer Science, vol 5014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68237-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-68237-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68235-6
Online ISBN: 978-3-540-68237-0
eBook Packages: Computer ScienceComputer Science (R0)