Error-Completion in Interface Theories
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.
Unable to display preview. Download preview PDF.
- 4.Back, R.-J., Wright, J.: Refinement Calculus. Springer (1998)Google Scholar
- 6.Broy, M., Stølen, K.: Specification and development of interactive systems: focus on streams, interfaces, and refinement. Springer (2001)Google Scholar
- 8.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)Google Scholar
- 9.de Alfaro, L., Henzinger, T.: Interface automata. In: Foundations of Software Engineering, FSE. ACM Press (2001)Google Scholar
- 11.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)Google Scholar
- 12.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)Google Scholar
- 14.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)Google Scholar
- 22.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)Google Scholar