A criterion to enforce correctness of indirectly cooperating applications
September 1, 1998·
,
,
·
0 min read
Gérôme Canals
Pascal Molli
Manuel Munier
Claude Godart
Abstract
Cooperative applications are expected to become commonplace in the future. We are concerned here with a special case of cooperation called indirect cooperation. The idea of the paper is that a Concurrency Control approach better fits to indirect cooperation than a Concurrent Programming one. In other words, it does exist syntactic correctness criteria which defines a large sphere of security in which application programmers are released from the burden of interaction explicit programming. This paper arguments this point of view and describes such a criterion: the COO-Serializability. It applies for a class of applications which cooperate indirectly.
Type
Publication
In Information Sciences
Authors
Associate Professor in Computer Science
Manuel Munier received his Ph.D. in Computer Science from University of Nancy in january 1999. His thesis works studied cooperative systems, advanced transaction models, distributed systems. Immediately after receiving his Ph.D., he worked as a postdoctoral researcher for INRIA Lorraine and Xerox Research Centre Europe in Grenoble.
In september 1999 he joined the University of Pau (IUT des Pays de l’Adour, département Réseaux & Télécommunications, site de Mont de Marsan). Manuel Munier is a member of ISI-Know team (Information Security and engIneering through knowledge management) of the LIUPPA (Laboratoire d’Informatique de l’Université de Pau et des Pays de l’Adour).