%0 Conference Proceedings
%T Preserving Contract Satisfiability Under Non-monotonic Composition
%+ KTH Royal Institute of Technology [Stockholm] (KTH )
%+ Scania CV AB [Södertälje]
%A Westman, Jonas
%A Nyberg, Mattias
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 38th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Madrid, Spain
%Y Christel Baier
%Y Luís Caires
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-10854
%P 181-195
%8 2018-06-18
%D 2018
%R 10.1007/978-3-319-92612-4_10
%K Contracts
%K Non-monotonic
%K Composition
%K Satisfiability
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X A contracts theory embeds non-monotonic composition (with respect to implementation) if the fact that a composition of two components implements a specification $$\mathcal {S}$$ does not generally follow from one of these components implementing $$\mathcal {S}$$. In contrast to monotonic composition, non-monotonic composition offers the additional expressiveness of specifying properties that only hold locally for a component since non-monotonic composition does not enforce all properties to be preserved when composing. Despite that this additional expressiveness is clearly needed, it implies that cases where monotony is indeed desired needs to be managed explicitly. The present paper elaborates on this topic by introducing a contracts theory embedding non-monotonic composition, and exploring conditions for ensuring monotonic composition in the context of this theory.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01824811/document
%2 https://inria.hal.science/hal-01824811/file/469043_1_En_10_Chapter.pdf
%L hal-01824811
%U https://inria.hal.science/hal-01824811
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-10854