Counterexample Guided Synthesis of Monitors for Realizability Enforcement

Matthias Güdemann (1) , Gwen Salaün (1) , Meriem Ouederni (2)

1 CONVECS - Construction of verified concurrent systems
2 LINA - Laboratoire d'Informatique de Nantes Atlantique

Many of today's software systems are built using distributed services, which evolve in different organizations. In order to facilitate their integration, it is necessary to provide a contract that the services participating in a composition should adhere to. A contract specifies interactions among a set of services from a global point of view. One important problem in a top-down development process is figuring out whether such a contract can be implemented by a set of services, obtained by projection and communicating via message passing. It was only recently shown, that this problem, known as realizability, is decidable if asynchronous communication (communication via FIFO buffers) is considered. It can be verified using the synchronizability property. If the system is not synchronizable, the system is not realizable either. In this paper, we propose a new, automatic approach, which enforces both synchronizability and realizability by generating local monitors through successive equivalence checks and refinement.

Domaines: Génie logiciel [cs.SE]

Matthias Güdemann, Gwen Salaün, Meriem Ouederni. Counterexample Guided Synthesis of Monitors for Realizability Enforcement. Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Oct 2012, Thiruvananthapuram, India. pp.238-253, ⟨10.1007/978-3-642-33386-6_20⟩. ⟨hal-00742159⟩