Abstract
Interface theories are compositional theories where components are represented as abstract, formal interfaces which describe the component’s input/output behavior. A key characteristic of interface theories is that interfaces are non-input-complete, meaning that they allow specification of illegal inputs. As a result of non-input-completeness, interface theories use game-theoretic definitions of composition and refinement, which are both conceptually and computationally more complicated than standard notions of composition and refinement that work with input-complete models. In this paper we propose a lossless transformation, called error-completion, which allows to transform a non-input-complete interface into an input-complete interface while preserving and allowing to retrieve completely the information on illegal inputs. We show how to perform composition of relational interfaces on the error-complete domain. We also show that refinement of such interfaces is equivalent to standard implication of their error-completions.
This work was supported in part by the iCyPhy Center (supported by IBM and United Technologies), the CHESS Center (supported by awards NSF #0720882 (CSR-EHS: PRET) and #0931843 (ActionWebs), NRL #N0013-12-1-G015, Bosch, National Instruments, and Toyota), and by the NSF Expeditions in Computing project ExCAPE: Expeditions in Computer Augmented Program Engineering.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abrial, J.-R.: The B-book: assigning programs to meanings. Cambridge University Press, New York (1996)
Alur, R., Henzinger, T.: Reactive modules. Formal Methods in System Design 15, 7–48 (1999)
Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 163–178. Springer, Heidelberg (1998)
Back, R.-J., Wright, J.: Refinement Calculus. Springer (1998)
Broy, M.: Compositional refinement of interactive systems. J. ACM 44(6), 850–891 (1997)
Broy, M., Stølen, K.: Specification and development of interactive systems: focus on streams, interfaces, and refinement. Springer (2001)
Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Mang, F.Y.C.: Synchronous and bidirectional component interfaces. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 414–427. Springer, Heidelberg (2002)
de Alfaro, L.: Game models for open systems. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 269–289. Springer, Heidelberg (2004)
de Alfaro, L., Henzinger, T.: Interface automata. In: Foundations of Software Engineering, FSE. ACM Press (2001)
de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 148–165. Springer, Heidelberg (2001)
Doyen, L., Henzinger, T., Jobstmann, B., Petrov, T.: Interface theories with component reuse. In: 8th ACM & IEEE International Conference on Embedded Software, EMSOFT, pp. 79–88 (2008)
Geilen, M., Tripakis, S., Wiggers, M.: The Earlier the Better: A Theory of Timed Actor Interfaces. In: 14th Intl. Conf. Hybrid Systems: Computation and Control, HSCC 2011. ACM (2011)
Hehner, E.C.R., Parnas, D.L.: Technical correspondence. Commun. ACM 28(5), 534–538 (1985)
Hoare, C.A.R.: Programs are predicates. In: Proc. of a Discussion Meeting of the Royal Society of London on Mathematical Logic and Programming Languages, pp. 141–155. Prentice-Hall, Inc., Upper Saddle River (1985)
Liskov, B.: Modular program construction using abstractions. In: Bjorner, D. (ed.) Abstract Software Specifications. LNCS, vol. 86, pp. 354–389. Springer, Heidelberg (1980)
Lynch, N.A., Tuttle, M.R.: An introduction to input/output automata. CWI Quarterly 2, 219–246 (1989)
Meyer, B.: Applying “design by contract”. Computer 25(10), 40–51 (1992)
Nelson, G.: A generalization of dijkstra’s calculus. ACM Trans. Program. Lang. Syst. 11(4), 517–561 (1989)
Parnas, D.L.: A generalized control structure and its formal definition. Commun. ACM 26(8), 572–581 (1983)
Raclet, J.-B., Badouel, E., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: A modal interface theory for component-based design. Fundam. Inf. 108(1-2), 119–149 (2011)
Spivey, J.M.: The Z notation: a reference manual. Prentice-Hall, Inc., Upper Saddle River (1989)
Tripakis, S., Lickly, B., Henzinger, T.A., Lee, E.A.: A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS) 33(4) (July 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tripakis, S., Stergiou, C., Broy, M., Lee, E.A. (2013). Error-Completion in Interface Theories. In: Bartocci, E., Ramakrishnan, C.R. (eds) Model Checking Software. SPIN 2013. Lecture Notes in Computer Science, vol 7976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39176-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-39176-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39175-0
Online ISBN: 978-3-642-39176-7
eBook Packages: Computer ScienceComputer Science (R0)