Quotient for Assume-Guarantee Contracts

We introduce a novel notion of quotient set for a pair of contracts and the operation of quotient for assumeguarantee contracts. The quotient set and its related operation can be used in any compositional methodology where design requirements are mapped into a set of components in a library. In particular, they can be used for the so called missing component problem, where the given components are not capable of discharging the obligations of the requirements. In this case, the quotient operation identifies the contract for a component that, if added to the original set, makes the resulting system fulfill the requirements.

[1]  Bertrand Meyer.  Touch of Class: Learning to Program Well with Objects and Contracts , 2009 .

[2]  Tiziano Villa,et al.  The Unknown Component Problem: Theory and Applications , 2014 .

[3]  Axel Legay,et al.  Contract-Based Requirement Modularization via Synthesis of Correct Decompositions , 2016, ACM Trans. Embed. Comput. Syst..

[4]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[5]  S. Ramesh,et al.  Interface synthesis and protocol conversion , 2008, Formal Aspects of Computing.

[6]  Roberto Passerone,et al.  Multiple Viewpoint Contract-Based Specification and Design , 2008, FMCO.

[7]  Corina S. Pasareanu,et al.  Automated Assume-Guarantee Reasoning by Abstraction Refinement , 2008, CAV.

[8]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[9]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

[10]  Dejan Nickovic,et al.  Monitoring Temporal Properties of Continuous Signals , 2004, FORMATS/FTRTFT.

[11]  Bengt Jonsson,et al.  Compositional assume-guarantee reasoning for input/output component theories , 2014, Sci. Comput. Program..

[12]  Howard Barringer,et al.  Assumption generation for software component verification , 2002, Proceedings 17th IEEE International Conference on Automated Software Engineering,.

[13]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[14]  Rajeev Alur,et al.  Symbolic Compositional Verification by Learning Assumptions , 2005, CAV.

[15]  Alberto L. Sangiovanni-Vincentelli,et al.  Contracts for System Design , 2018, Found. Trends Electron. Des. Autom..

[16]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[17]  Bengt Jonsson,et al.  A Compositional Specification Theory for Component Behaviours , 2012, ESOP.