Search

Your search keyword '"Claude Jard"' showing total 30 results
Start Over Author "Claude Jard" Topic computer
30 results on '"Claude Jard"'

1. Capturer les dépendances causales dans les orchestrations de services Web définies en ORC

Author

Achour Mostefaoui, Claude Jard, Matthieu Perrin, AELOS, Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Gestion de Données Distribuées [Nantes] (GDD), ANR-10-LABX-0007,COMIN Labs,Descent CominLabs(2010), and ANR-13-INFR-0003,SocioPlug,Cloud social sur des réseaux de plugs, pour un accès à l'information symétrique et respectueux de la vie privée(2013)

Subjects
FOS: Computer and information sciences, Computer Science - Programming Languages, Event (computing), Programming language, Semantics (computer science), Computer science, 020207 software engineering, 02 engineering and technology, Tracking (particle physics), computer.software_genre, Operational semantics, Web service orchestration, Computer Science - Distributed, Parallel, and Cluster Computing, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Concurrency semantics, Distributed, Parallel, and Cluster Computing (cs.DC), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Web service, computer, Programming Languages (cs.PL)
Abstract

This article shows how the operational semantics of a language like ORC can be instrumented so that the execution of a program produces information on the causal dependencies between events. The concurrent semantics we obtain is based on asymmetric labeled event structures. The approach is illustrated using a Web service orchestration instance and the detection of race conditions., NETYS - 3rd International Conference on NETwork sYStems, May 2015, Agadir, Morocco. 2015, Proceedings of the third international conference on network systems

Published
2015

2. The EPOC project: Energy Proportional and Opportunistic Computing system

Author

Marie-Laure Moulinard, Olivier Roux, Thomas Ledoux, Nicolas Beldiceanu, Jean-Marc Menaud, Jean-Louis Pazat, Didier Lime, Barbara Dumas Feris, Anne-Cécile Orgerie, Sabbir Hasan, Philippe Gravey, Ammar Sharaiha, Yunbo Li, Gilles Madi-Wamba, Claude Jard, Pascal Morel, Michel Morvan, Theory, Algorithms and Systems for Constraints (TASC), Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Département informatique - EMN, Mines Nantes (Mines Nantes)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Département Optique (OPT), Institut Mines-Télécom [Paris] (IMT)-Télécom Bretagne-Université européenne de Bretagne - European University of Brittany (UEB), Aspect and composition languages (ASCOLA), Design and Implementation of Autonomous Distributed Systems (MYRIADS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), AELOS, Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN), Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN), Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES), Projet EPOC du Labex CominLabs (ANR-10-LABX-07-01), Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Département informatique - EMN, Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Université européenne de Bretagne - European University of Brittany (UEB)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), and Institut National des Sciences Appliquées (INSA)

Subjects
Power management, Engineering, Data-Center, business.industry, Cloud computing, Energy consumption, Environmental economics, Virtualization, computer.software_genre, 7. Clean energy, Electrical grid, Renewable energy, Optical Network, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Task Placement, 13. Climate action, Data center, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Energy-Efficiency, computer, Computer network, Efficient energy use
Abstract

15397; International audience; With the emergence of the Future Internet and the dawning of new IT models such as cloud computing, the usage of data centers (DC), and consequently their power consumption, increase dramatically. Besides the ecological impact, the energy consumption is a predominant criteria for DC providers since it determines the daily cost of their infrastructure. As a consequence, power management becomes one of the main challenges for DC infrastructures and more generally for large-scale distributed systems. In this paper, we present the EPOC project which focuses on optimizing the energy consumption of mono-site DCs connected to the regular electrical grid and to renewable energy sources.

Published
2015

3. Distributed Implementation of Message Sequence Charts

Author

Claude Jard, Rouwaida Abdallah, Loïc Hélouët, École normale supérieure - Cachan (ENS Cachan), SUpervision of large MOdular and distributed systems (SUMO), LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Sequence, Theoretical computer science, SIMPLE (military communications protocol), Computer science, Programming language, 020206 networking & telecommunications, 020207 software engineering, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Stamping, computer.software_genre, Projection (relational algebra), Order (business), Modeling and Simulation, Component (UML), 0202 electrical engineering, electronic engineering, information engineering, computer, Software, Program synthesis, ComputingMilieux_MISCELLANEOUS
Abstract

This work revisits the problem of program synthesis from specifications described by high-level message sequence charts. We first show that in the general case, synthesis by a simple projection on each component of the system allows more behaviors in the implementation than in the specification. We then show that differences arise from loss of ordering among messages and show that behaviors can be preserved by addition of communication controllers that intercept messages to add stamping information before resending them and deliver messages to processes in the order described by the specification.

Published
2015
Full Text
View/download PDF

4. Synthesis of distributed testers from true-concurrency models of reactive systems

Author

Claude Jard

Subjects
business.industry, Programming language, Computer science, Concurrency, 020207 software engineering, Context (language use), 02 engineering and technology, computer.software_genre, Computer Science Applications, Set (abstract data type), Projection (relational algebra), Test case, 0202 electrical engineering, electronic engineering, information engineering, Graph (abstract data type), 020201 artificial intelligence & image processing, Software engineering, business, Conformance testing, computer, Reactive system, Software, Information Systems
Abstract

Automatic synthesis of test cases for conformance testing has been principally developed with the objective of generating sequential test cases. In the distributed system context, it is worth extending the synthesis techniques to the generation of multiple testers. We base our work on our experience in using model-checking techniques, as successfully implemented in the Test Generation using the Verification tool. Continuing the works of Ulrich and Konig, we propose to use a true-concurrency model based on graph unfolding. The article presents the principles of a complete chain of synthesis, starting from the definition of test purposes and ending with a projection onto a set of testers.

Published
2003
Full Text
View/download PDF

5. An event structure based semantics for high-level message sequence charts

Author

Loïc Hélouët, Benoît Caillaud, and Claude Jard

Subjects
Mathematics (miscellaneous), Theoretical computer science, Event structure, Rule-based machine translation, Computer science, Programming language, Equivalence (formal languages), computer.software_genre, computer, Computer Science Applications
Abstract

This paper details a partial order semantics for families of scenarios represented by High-Level Message Sequence Charts (HMSCs): graph grammars generating event structures are used to represent HMSCs. A decision procedure for HMSC equivalence is then described. This can be considered as a first step towards the formal manipulation of scenarios.

Published
2002
Full Text
View/download PDF

6. Blending Timed Formal Models with Clock Transition Systems

Author

Didier Lime, Claude Jard, Olivier Roux, Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN), Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN), Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS), and ANR-10-BLAN-0317,ImpRo,Implantabilité et Robustesse des Systèmes Temporisés(2010)

Subjects
Structure (mathematical logic), Algebra and Number Theory, Theoretical computer science, Computer science, business.industry, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 020207 software engineering, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Petri net, Rotation formalisms in three dimensions, Expression (mathematics), Operational semantics, Theoretical Computer Science, Automaton, Computational Theory and Mathematics, Factor (programming language), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Isomorphism, Artificial intelligence, business, computer, Information Systems, computer.programming_language
Abstract

International audience; Networks of Timed Automata (NTA) and Time Petri Nets (TPNs) are well-established formalisms used to model, analyze and control industrial real-time systems. The underlying theories are usually developed in different scientific communities and both formalisms have distinct strong points: for instance, conciseness for TPNs and a more flexible notion of urgency for NTA. The objective of the paper is to introduce a new model allowing the joint use of both TPNs and NTA for the modeling of timed systems. We call it Clock Transition System (CTS). This new model incorporates the advantages of the structure of Petri nets, while introducing explicitly the concept of clocks. Transitions in the network can be guarded by an expression on the clocks and reset a subset of them as in timed automata. The urgency is introduced by a separate description of invariants. We show that CTSallow to express TPNs (even when unbounded) and NTA. For those two classical models, we identify subclasses of CTSs equivalent by isomorphism of their operational semantics and provide (syntactic) translations. The classical state-space computation developed for NTA and then adapted to TPNs can easily be defined for general CTSs. Armed with these merits, the CTSmodel seems a good candidate to serve as an intermediate theoretical and practical model to factor out the upcoming developments in the TPNs and the NTA scientific communities.

Published
2014

7. QoS-Aware Management of Monotonic Service Orchestrations

Author

Sidney Rosario, John A. Thywissen, Albert Benveniste, Claude Jard, Ajay Kattepur, System synthesis and supervision, scenarios (S4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Middleware on the Move (MIMOVE), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), University of Texas Health Science Center, The University of Texas Health Science Center at Houston (UTHealth), Departement of Computer Science [Austin] (CS), University of Texas at Austin [Austin], Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, and Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Service (systems architecture), Computer science, Separation of concerns, media_common.quotation_subject, Quality of service, Distributed computing, Real-time computing, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020207 software engineering, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], computer.software_genre, Theoretical Computer Science, Workflow, Hardware and Architecture, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Orchestration (computing), Web service, Function (engineering), computer, Software, media_common
Abstract

International audience; We study QoS-aware management of service orchestrations, specifically for orchestrations having a data-dependent workflow. Our study supports multi-dimensional QoS. To capture uncertainty in performance and QoS, we provide support for probabilistic QoS. Under the above assumptions, orchestrations may be non-monotonic with respect to QoS, meaning that strictly improving the QoS of a service may strictly decrease the end-to-end QoS of the orchestration, an embarrassing feature for QoS-aware management. We study monotonicity and provide sucient conditions for it. We then propose a comprehensive theory and methodology for monotonic orchestrations. Generic QoS composition rules are developed via a QoS Calculus, also capturing best service binding/service discovery, however, is not within the scope of this work. Monotonicity provides the rationale for a contract-based approach to QoS-aware management. Although function and QoS cannot be separated in the design of complex orchestrations, we show that our framework supports separation of concerns by allowing the development of function and QoS separately and then "weaving" them together to derive the QoSenhanced orchestration. Our approach is implemented on top of the Orc script language for specifying service orchestrations.

Published
2014
Full Text
View/download PDF

8. Negotiation Strategies for Probabilistic Contracts in Web Services Orchestrations

Author

Claude Jard, Ajay Kattepur, Albert Benveniste, Distributed and Iterative Algorithms for the Management of Telecommunications Systems (DISTRIBCOM), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, and Kattepur, Ajay

Subjects
[INFO.INFO-WB] Computer Science [cs]/Web, Computer science, media_common.quotation_subject, Distributed computing, Quality of service, 05 social sciences, [INFO.INFO-WB]Computer Science [cs]/Web, Probabilistic logic, Stochastic dominance, 02 engineering and technology, computer.software_genre, Negotiation, Control flow, Service level, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Web service, computer, Integer programming, 050205 econometrics, media_common
Abstract

International audience; Service Level Agreements (SLAs) have been proposed in the context of web services to maintain acceptable quality of service (QoS) performance. This is specially crucial for composite service orchestrations that invoke many atomic services to render functionality. A consequence of SLA management entails efficient negotiation protocols among orchestrations and invoked services. In composite services where data and QoS (modeled in a probabilistic setting) interact, it is difficult to select an atomic service for negotiation, in order to improve end-to-end QoS performance. A superior improvement in one negotiated domain (eg. latency) might mean deterioration in another domain (eg. cost); improvement in one of the invoked services may be annulled by another due to the control flow specified in the orchestration. In this paper, we propose a integer programming formulation based on first order stochastic dominance as a strategy for re-negotiation over multiple services. A consequence of this is better end-to-end performance of the orchestration compared to random selection of services for re-negotiation. We also demonstrate this optimal strategy can be applied to negotiation protocols specified in languages such as Orc. Such strategies are necessary for composite services where QoS contributions from individual atomic services vary significantly.

Published
2012

9. Pairwise Testing of Dynamic Composite Services

Author

Benoit Baudry, Ajay Kattepur, Albert Benveniste, Claude Jard, Sagar Sen, Distributed and Iterative Algorithms for the Management of Telecommunications Systems (DISTRIBCOM), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Perception Understanding Learning Systems for Activity Recognition (PULSAR), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Reliable and efficient component based software engineering (TRISKELL), SIGSOFT ACM Special Interest Group on Software Engineering, IEEE CS, ANR-06-MDCA-0005,DocFlow,analysis, monitoring and optimization of Web documents and services(2006), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
Computer science, Quality of service, [INFO.INFO-WB]Computer Science [cs]/Web, Response time, 020207 software engineering, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], computer.software_genre, ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.5: Online Information Services/H.3.5.2: Web-based services, Data quality, 0202 electrical engineering, electronic engineering, information engineering, All-pairs testing, Redundancy (engineering), 020201 artificial intelligence & image processing, Pairwise comparison, Software system, Data mining, Web service, computer
Abstract

International audience; Online services encapsulate enterprises, people, software systems and often operate in poorly understood environments. Using such services in tandem to predictably orchestrate a complex task is one of the principal challenges of service-oriented computing. A composite service orchestration soliciting multiple atomic services is plagued by a number of sources of variation. For instance, availability of an atomic service and its response time are two important sources of variation. Moreover, the number of possible variations in a composite service increases exponentially with increase in the number of atomic services. Testing such a composite service presents a crucial challenge as its often very expensive to exhaustively examine the variation space. Can we effectively test the dynamic behavior of a composite service using only a subset of these variations? This is the question that intrigues us. In this paper, we first model composite service variability as a feature diagram (FD) that captures all valid configurations of its orchestration. Second, we apply pairwise testing to sample the set of all possible configurations to obtain a concise subset. Finally, we test the composite service for selected pairwise configurations for a variety of QoS metrics such as response time, data quality, and availability. Using two case studies, Car crash crisis management and eHealth management, we demonstrate that pairwise generation effectively samples the full range of QoS variations in a dynamic orchestration. The pairwise sampling technique eliminates over $99\%$ redundancy in configurations, while still calling all atomic services at least once. We rigorously evaluate pairwise testing for the criteria such as: a) ability to sample the extreme QoS metrics of the service b) stable behavior of the extracted configurations c) compact set of configurations that can help evaluate QoS tradeoffs and d) comparison with random sampling.

Published
2011
Full Text
View/download PDF

10. An Experiment in Automatic Generation of Protocols from HMSCs

Author

Rouwaida Abdallah and Claude Jard

Subjects
Protocol (science), Finite-state machine, SIMPLE (military communications protocol), Promela, Computer science, Distributed computing, Code (cryptography), Message sequence chart, Stamping, computer, Market fragmentation, computer.programming_language
Abstract

We discuss the automatic protocol generation of protocols that can have a specification described by a local High level Message Sequence Chart (HMSC). We will use a synthesis method that allows to any local HMSC to be correctly implementable by adding some stamping information. And we will demonstrate its use by explaining in details the automatic generation of the operational model described by Communicationg Finite Automata of a simple transmission protocol based message's fragmentation, as well as its generated Promela code by our SOFAT tool.

Published
2011
Full Text
View/download PDF

11. Optimizing Decisions in Web Services Orchestrations

Author

Claude Jard, Albert Benveniste, Ajay Kattepur, Distributed and Iterative Algorithms for the Management of Telecommunications Systems (DISTRIBCOM), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Gerti Kappel and Zakaria Maamar and Hamid R. Motahari-Nezhad, Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
021103 operations research, Database, Computer science, Quality of service, Distributed computing, [INFO.INFO-WB]Computer Science [cs]/Web, 0211 other engineering and technologies, Analytic hierarchy process, 020207 software engineering, 02 engineering and technology, computer.software_genre, Consistency (database systems), Workflow, 0202 electrical engineering, electronic engineering, information engineering, Resource allocation, Orchestration (computing), Pruning (decision trees), Web service, computer
Abstract

International audience; Web services orchestrations conventionally employ exhaustive comparison of runtime quality of service (QoS) metrics for decision making. The ability to incorporate more complex mathematical packages are needed, especially in case of workflows for resource allocation and queuing systems. By modeling such optimization routines as service calls within orchestration specifications, techniques such as linear programming can be conveniently invoked by non-specialist workflow designers. Leveraging on previously developed QoS theory, we propose the use of a high-level flexible query procedure for embedding optimizations in languages such as Orc. The Optima site provides an extension to the sorting and pruning operations currently employed in Orc. Further, the lack of an objective technique for consolidating QoS metrics is a problem in identifying suitable cost functions. We employ the \emph{analytical hierarchy process (AHP)} to generate a total ordering of QoS metrics across various domains. With constructs for ensuring consistency over subjective judgements, the AHP provides a suitable technique for producing objective cost functions. Using the Dell Supply Chain example, we demonstrate the feasibility of decision making through optimization routines, specially when the control flow is QoS dependent.

Published
2011
Full Text
View/download PDF

12. Variability Modeling and QoS Analysis of Web Services Orchestrations

Author

Albert Benveniste, Ajay Kattepur, Benoit Baudry, Sagar Sen, Claude Jard, Distributed and Iterative Algorithms for the Management of Telecommunications Systems (DISTRIBCOM), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Reliable and efficient component based software engineering (TRISKELL), Vojtisek, Didier, Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
Service (business), Database, Computer science, Quality of service, Distributed computing, [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], Probabilistic logic, 020207 software engineering, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], computer.software_genre, Service level, Outlier, 0202 electrical engineering, electronic engineering, information engineering, Feature (machine learning), 020201 artificial intelligence & image processing, Orchestration (computing), Web service, computer
Abstract

International audience; The ever-growing choice in diverse services is making service orchestration variability an essential aspect of a composite web service. Influence of this variation on the Quality of Service (QoS) of a composite service is critical and the focus of our work. In this paper, we present a methodology to first model orchestration variability using a feature diagram (FD). The FD specifies a product line of orchestrations represented as configurations of invoked/rejected atomic services. Second, due to the potentially large set of configurations we employ combinatorial testing techniques to automatically generate configurations covering all valid pairwise interactions between services. Third, we analyze QoS variation for each configuration using probabilistic models of QoS. Using a crisis management system case study we experimentally show that pairwise generation covers all QoS outliers and eliminates analysis of > 75\% of all possible configurations. The QoS analysis of the pairwise configurations reveals unsafe/ineffective configurations, helps determine realistic Service Level Agreements (SLAs), and provides valuable feedback to help remodel an orchestration. , bdsk-url-1 = http://www.irisa.fr/triskell/publis/2010/Kattepur2010.pdf

Published
2010

13. On-the-fly verification of finite transition systems

Author

Laurent Mounier, Claude Jard, Jean-Claude Fernandez, and Thierry Jéron

Subjects
Model checking, Bisimulation, Theoretical computer science, On the fly, Computer science, Programming language, Breadth-first search, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, Graph, Theoretical Computer Science, Tree traversal, 010201 computation theory & mathematics, Hardware and Architecture, Bounded function, 0202 electrical engineering, electronic engineering, information engineering, computer, Software
Abstract

The analysis of programs by the exhaustive inspection of reachable states in a finite-state graph is a well-understood procedure. It is straightforwardly applicable to many description languages and is actually implemented in several industrial tools. But one of the main limitations of today's verification tools is the size of the memory needed to exhaustively build the state graphs of the programs. For numerous properties, it is not necessary to explicitly build this graph; an exhaustive depth-first traversal is often sufficient. This leads to an on-line algorithms for computing Buchi acceptance (in the deterministic case) and behavioral equivalences: they are presented in detail. In order to avoid retraversing states, it is, however, important to store some of the already visited states in memory. To keep the memory size bounded (and avoid a performance falling down), visited states are randomly replaced. In most cases, this depth-first traversal with replacement can push back significantly the limits of verification tools. We give the name on-the-fly verification to the use of algorithms based on a depth-first search (with replacement) of the finite-state graph associated with the program to be verified.

Published
1992
Full Text
View/download PDF

14. Echidna, an estelle compiler to prototype protocols on distributed computers

Author

Claude Jard and Jean-Marc Jézéquel

Subjects
Rapid prototyping, Intel iPSC, Distributed algorithm, Programming language, Computer science, Kernel (statistics), General Engineering, Operating system, Compiler, Hypercube, computer.software_genre, computer, Protocol (object-oriented programming)
Abstract

We report our experience in developing a compiler and a distributed run-time kernel for distributed computers, called Echidna. Echidna is a software package which has been available for more than two years, and aims to support protocol designers in protocol modeling, validation and performance evaluation. It is basically oriented towards the rapid prototyping of distributed algorithms on distributed computers: the Intel iPSC hypercube, the Supernode machine, and networks of Transputers and Suns were considered. Algorithms are described using an ISO formal description technique called Estelle. First, we present and justify the concept of experimentation on distributed algorithms for which our Estelle compiler has been designed. Then we discuss how Estelle constructs are mapped onto C structures and how they are interpreted by a distributed run-time kernel. We conclude by presenting typical uses of Echidna.

Published
1992
Full Text
View/download PDF

15. Flexible Probabilistic QoS Management of Transaction Based Web Services Orchestrations

Author

Sidney Rosario, Claude Jard, and Albert Benveniste

Subjects
Computer science, business.industry, Business process, media_common.quotation_subject, Quality of service, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Probabilistic logic, Mobile QoS, computer.software_genre, Quality (business), Orchestration (computing), Web service, business, Database transaction, computer, media_common, Computer network
Abstract

In this paper we extend our previous work on soft probabilistic contracts for QoS management, from the particular case of "response time", to general QoS parameters. Our study covers composite QoS parameters dealing not only with time aspects but also with Quality of Data. We also study contract composition (how to derive QoS contracts for an orchestration from the QoS contracts with its called services), and contract monitoring. Our approach supports comprehensive and flexible QoS management within a probabilistic framework.

Published
2009
Full Text
View/download PDF

16. Monitoring probabilistic SLAs in Web service orchestrations

Author

Albert Benveniste, Claude Jard, and Sidney Rosario

Subjects
WS-Addressing, Web standards, business.industry, Computer science, WS-I Basic Profile, computer.internet_protocol, Services computing, Service-oriented architecture, Web application security, computer.software_genre, World Wide Web, Web service, business, WS-Policy, computer
Abstract

Web services are software applications that are published over the Web, and can be searched and invoked by other programs. New Web services can be formed by composing elementary services, such composite services are called Web service orchestrations. Quality of Service (QoS) issues for Web service orchestrations deeply differ from corresponding QoS issues in network management. In an open world of Web services, service level agreements (SLAs) play an important role. They are contracts defining the obligations and rights between the provider of a Web service and a client with respect to the services' function and quality.

Published
2009
Full Text
View/download PDF

17. Probabilistic QoS and Soft Contracts for Transaction-Based Web Services Orchestrations

Author

Claude Jard, Albert Benveniste, Sidney Rosario, Stefan Haar, Distributed and Iterative Algorithms for the Management of Telecommunications Systems (DISTRIBCOM), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), RNRT project SWAN decision 03 S 481 and INRIA Sabbatical program, Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
Information Systems and Management, Quality of Service (QoS), Computer Networks and Communications, Computer science, media_common.quotation_subject, Distributed computing, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], ComputingMilieux_LEGALASPECTSOFCOMPUTING, 02 engineering and technology, computer.software_genre, Computer security, Service-level agreement, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Quality (business), Orchestration (computing), media_common, Web services, Service (business), Quality of service, Probabilistic logic, Computer Science Applications, composite Web services, Hardware and Architecture, Service level, 020201 artificial intelligence & image processing, Web service, computer
Abstract

International audience; Service level agreements (SLAs), or contracts, have an important role in web services. They define the obligations and rights between the provider of a web service and its client, about the function and the Quality of the service (QoS). For composite services like orchestrations, contracts are deduced by a process called QoS contract composition, based on contracts established between the orchestration and the called web services. Contracts are typically stated as hard guarantees (e.g., response time always less than 5 msec). Using hard bounds is not realistic, however, and more statistical approaches are needed. In this paper we propose using soft probabilistic contracts instead, which consist of a probability distribution for the considered QoS parameter--in this paper, we focus on timing. We show how to compose such contracts, to yield a global probabilistic contract for the orchestration. Our approach is implemented by the TOrQuE tool. Experiments on TOrQuE show that overly pessimistic contracts can be avoided and significant room for safe overbooking exists. An essential component of SLA management is then the continuous monitoring of the performance of called web services, to check for violations of the SLA. We propose a statistical technique for run-time monitoring of soft contracts.

Published
2008
Full Text
View/download PDF

18. Probabilistic QoS and soft contracts for transaction based Web services

Author

Claude Jard, Albert Benveniste, Sidney Rosario, Stefan Haar, Distributed and Iterative Algorithms for the Management of Telecommunications Systems (DISTRIBCOM), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
Database, Computer science, Transaction processing, Distributed computing, Quality of service, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Probabilistic logic, 020207 software engineering, 02 engineering and technology, Mobile QoS, computer.software_genre, Software quality, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Orchestration (computing), Web service, computer, Database transaction
Abstract

International audience; Web services orchestrations and choreographies require establishing Quality of Service (QoS) contracts with the user. This is achieved by performing QoS composition, based on contracts established between the orchestration and the called Web services. These contracts are typically stated in the form of hard guarantees (e.g., response time always less than 5 msec). In this paper we propose using soft contracts instead. Soft contracts are characterized by means of probability distributions for QoS parameters. We show how to compose such contracts, to yield a global contract (probabilistic) for the orchestration. Our approach is implemented by the TOrQuE tool. Experiments on TOrQuE show that overly pessimistic contracts can be avoided and significant room for safe overbooking exists.

Published
2007
Full Text
View/download PDF

19. Test Synthesis from UML Models of Distributed Software

Author

Y. Le Traon, Jean-Marc Jézéquel, Simon Pickin, Thierry Jéron, Claude Jard, Departamento Ingeniería Telemática, Universidad Carlos III de Madrid [Madrid] (UC3M), Distributed and Iterative Algorithms for the Management of Telecommunications Systems (DISTRIBCOM), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Verification models and techniques applied to testing and control of reactive systems (VERTECS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Reliable and efficient component based software engineering (TRISKELL), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
Computer science, Distributed computing, System testing, Applications of UML, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], computer.software_genre, Software development process, Software, Unified Modeling Language, Sequence diagram, Formal specification, 0202 electrical engineering, electronic engineering, information engineering, Code generation, Formal verification, computer.programming_language, UML tool, Object-oriented programming, business.industry, Programming language, 020207 software engineering, Formal methods, Test case, 020201 artificial intelligence & image processing, business, computer
Abstract

International audience; The object-oriented software development process is increasingly used for the construction of complex distributed systems. In this context, behavior models have long been recognized as the basis for systematic approaches to requirements capture, specification, design, simulation, code generation, testing, and verification. Two complementary approaches for modeling behavior have proven useful in practice: interaction-based modeling (e.g. UML sequence diagrams) and state-based modeling (e.g. UML statecharts). Building on formal V\& V techniques, in this article we present a method and a tool for automated synthesis of test cases from scenarios and a state-based design model of the application, remaining entirely within the UML framework. The underlying ``on the fly'' test synthesis algorithms are based on the input/output labeled transition system formalism, which is particularly appropriate for modeling applications involving asynchronous communication. The method is eminently compatible with classical OO development processes since it can be used to synthesize test cases from the scenarios used in early development stages to model global interactions between actors and components, instead of these test cases being derived manually. We illustrate the system test synthesis process using an Air Traffic Control software example.

Published
2007

20. Event Structure Semantics of Orc

Author

David Kitchin, Sidney Rosario, Claude Jard, William R. Cook, Albert Benveniste, Stefan Haar, Distributed and Iterative Algorithms for the Management of Telecommunications Systems (DISTRIBCOM), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Computer Science Department [Austin], University of Texas at Austin [Austin], Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, INRIA, Dumas, Marlon and Heckel, and Reiko

Subjects
Theoretical computer science, Computer science, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 02 engineering and technology, computer.software_genre, Operational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Denotational semantics, 0202 electrical engineering, electronic engineering, information engineering, Failure semantics, semantics, event structures, business.industry, Programming language, Quality of service, 020207 software engineering, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS, Event structure, 020201 artificial intelligence & image processing, The Internet, Web service, Partial orders, business, computer, Coding (social sciences)
Abstract

One challenge in developing wide-area distributed applications is analyzing the system's non-functional properties, including timing constraints and internal dependencies that can affect quality of service. Analysis of non-functional properties requires a precise formal semantics for the language in which the system is written; but labelled transition systems and trace semantics, which are commonly used for this purpose, do not facilitate this kind of analysis. Event structures provide an explicit representation of the the causal dependencies between events in the execution of a system. But event structures are difficult to construct compositionally, because they cannot easily represent fragments of a computation. In this paper we present a partial-order semantics based on heaps (an explicitly encoded form of occurrence nets with read arcs), which naturally represent fragments of behavior. Heaps are then easily translated into asymmetric event structures. The semantics is developed for Orc, an orchestration language in which concurrent services are invoked to achieve a goal while managing time-outs, exceptions, and priority. Orc, and this new semantics, are being used to study quality of service (QoS) for wide area orchestrations.

Published
2007
Full Text
View/download PDF

21. LaTe, a Non-fully Deterministic Testing Language

Author

Emmanuel Donin de Rosière, Claude Jard, and Benoît Parreaux

Subjects
Service (systems architecture), System under test, Computer science, Programming language, White-box testing, Scenario testing, computer.software_genre, computer, Operational semantics, Interpreter, Test (assessment)
Abstract

This paper presents a case study which is the test of a voice-based service. To develop this application, we propose new functionalities for testing languages and a new language called LaTe that implements them. With LaTe, one testing scenario can describe several different executions and the interpreter tries to find the execution that best fits with the real behavior of the System Under Testing (SUT). We propose an operational semantics of these non-deterministic operators. Experimental results of the test of the voice-based service are also included.

Published
2006
Full Text
View/download PDF

22. Models for the supervision of Web services orchestration with dynamic changes

Author

Thomas Chatain and Claude Jard

Subjects
Web server, Theoretical computer science, Computer science, Distributed computing, Concurrent computing, Context (language use), Orchestration (computing), Petri net, Web service, computer.software_genre, computer, Natural language, Electronic mail
Abstract

Programming on the Web enlightens some classical problems encountered on large distributed applications with a particular emphasis on dynamic changes. In that context, we are interested in the questions of supervision and diagnosis. Our approach is based on true-concurrency models and consists in building an unfolding of a model of the supervised system, that selects the histories that explain the observed alarms. We extend the notion of unfolding of high-level Petri nets to a model of dynamic systems that we define. This model is close to high-level Petri nets and allows us to model dynamicity. Finally, we explain how to use unfoldings of dynamic nets for the diagnosis application.

Published
2005
Full Text
View/download PDF

23. System test synthesis from UML models of distributed software

Author

Yves Le Traon, Thierry Jéron, Claude Jard, Jean-Marc Jézéquel, Simon Pickin, Alain Le Guennec, Reliable and efficient component based software engineering (TRISKELL), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
Computer science, Distributed computing, System testing, Applications of UML, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], computer.software_genre, Software development process, Software, System under test, Unified Modeling Language, Sequence diagram, 0202 electrical engineering, electronic engineering, information engineering, Formal verification, computer.programming_language, UML tool, Object-oriented programming, business.industry, Software development, 020207 software engineering, Test case, 020201 artificial intelligence & image processing, Class diagram, Scenario testing, business, computer
Abstract

International audience; The object-oriented software development process is increasingly used for the construction of both centralised and distributed systems. As yet, however, formal V&V techniques have not found much use in the object-oriented context, in spite of the fact that some are now mature enough to be exercised in real world applications. In this paper, we investigate the use of formal validation in a UML-based development process. We present a method and a tool for automated synthesis of test cases from generic test scenarios and a design model of the application, remaining entirely within the UML framework. The underlying "on the fly" test synthesis algorithms are based on the input/output labelled transition formalism, which is particularly appropriate for modelling applications which may involve asynchronous communication. We illustrate the system test synthesis process using an Air Traffic Control software case study.

Published
2002

24. Verification of Test Suites

Author

Claude Jard, Pierre Morel, and Thierry Jéron

Subjects
Correctness, TTCN, Computer science, Programming language, Protocol implementations, Formal specification, Test suite, Conformance testing, computer.software_genre, computer, Protocol (object-oriented programming), computer.programming_language, Test (assessment)
Abstract

We present a formal approach to check the correctness and to propose corrections of hand-written test suites with respect to a formal specification of the protocol implementations to test. It is shown that this requires in general a complex algorithmic comparable to model-checking. The principles of a prototype tool, called VTS, and based on the synthesis algorithms of TGV, are presented. We then prove the usefulness of the technique by checking a significant part of the ATM Forum test suite for the SSCOP protocol.

Published
2000
Full Text
View/download PDF

25. BDl, A Language of Distributed Reactive Objects

Author

Z. Bouziane, H. Canon, Claude Jard, Benoît Caillaud, Albert Benveniste, Jean-Pierre Talpin, Environnement de programmation d'applications temps réel (EP-ATR), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-INRIA Rennes, Institut National de Recherche en Informatique et en Automatique (Inria), Models and Tools for Programming Distributed Parallel Architectures (PAMPA), INRIA, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-INRIA Rennes

Subjects
Computer science, Programming language, Distributed computing, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 020207 software engineering, 02 engineering and technology, 16. Peace & justice, Object (computer science), computer.software_genre, Causality (physics), Unified Modeling Language, 0202 electrical engineering, electronic engineering, information engineering, Asynchronous network, 020201 artificial intelligence & image processing, Code generation, Control (linguistics), Reactive system, computer, Formal verification, computer.programming_language
Abstract

We introduce the definition of a language of distributed reactive objects, a Behaviour Description Language (BDL) as a unified medium for specifying, verifying, compiling and validating object-oriented, distributed reactive systems. One of the novelties in BDL is its seamless integration into the Unified Modeling Language approach (UML). BDL supports a description of objects interaction which respects both the functional architecture of system designs and the declarative style of diagram descriptions. This support is implemented by means of a partial-order theoretical framework. This framework allows to specify both the causality and the control models of object interactions independently of any hypothesis on the actual configuration of the system. Given the description of such a configuration, the use of BDL offers new perspectives for a flexible verification of systems by modeling them as an asynchronous network of synchronous components. It allows an optimized code generation by using compilation techniques developed for synchronous languages. It permits an accurate validation and test of applications by supporting the manipulation of both causal and control dependencies. BDL aims at maximizing the re-usability of high-level specifications while minimizing programming effort and test-case based validation of distributed systems.

Published
1998

26. Using on-the-fly verification techniques for the generation of test suites

Author

Thierry Jéron, Jean-Claude Fernandez, Claude Jard, and César Viho

Subjects
Set (abstract data type), Consistency (database systems), Test case, Computer science, Programming language, Formal specification, Component (UML), Real-time computing, Test suite, Context (language use), computer.software_genre, computer, Test (assessment)
Abstract

In this paper we attempt to demonstrate that on-the-fly techniques, developed in the context of verification, can help in deriving test suites. Test purposes are used in practice to select test cases according to some properties of the specification. We define a consistency pre-order linking test purposes and specifications. We give a set of rules to check this consistency and to derive a complete test case with preamble, postamble, verdicts and timers. The algorithm, which implements the construction rules, is based on a depth first traversal of a synchronous product between the test purpose and the specification. We shortly relate our experience on an industrial protocol with TGV, a first prototype of the algorithm implemented as a component of the C ADP toolbox.

Published
1996
Full Text
View/download PDF

27. Correctness of automated distribution of sequential programs

Author

Benoît Caillaud, René Thoraval, Claude Jard, and Cyrille Bareau

Subjects
020203 distributed computing, Correctness, Distribution (number theory), Programming language, Computer science, 02 engineering and technology, Parallel computing, computer.software_genre, Confluence, Parallel programming model, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Distributed memory, computer
Abstract

In this paper, we prove that the data-driven parallelization technique, which compiles sequential programs into parallel programs for distributed memory parallel computers, is correct. We dėfine a model based on labeled transition systems, and we prove, in spite of nondeterminism due to communications asynchronism, the confluence of all the possible behaviours of parallel programs obtained from the compilation rules.

Published
1993
Full Text
View/download PDF

28. Bounded-memory algorithms for verification on-the-fly

Author

Thierry Jéron and Claude Jard

Subjects
Correctness, Finite-state machine, Computer science, Programming language, 020207 software engineering, 02 engineering and technology, computer.software_genre, Mathematical proof, Symbolic execution, Formal proof, Consistency (database systems), Formal specification, 0202 electrical engineering, electronic engineering, information engineering, State space, 020201 artificial intelligence & image processing, computer
Abstract

Program verification is a branch of computer science whose business is "to prove programs correctness". It has been studied in theoretical computer science departments for a long time but it is rarely and laboriously applied to real world problems. As a matter of fact, we must pay much more attention to practical problems like the amount of space and time needed to perform verification. Let us recall that proofs of correctness are proofs of the relative consistency between two formal specifications: those of the program, and of the properties that the program is supposed to satisfy. Such a formal proof tries to increase the confidence that a computer system will make it right when executing the program under consideration. A considerable need for such methods appeared these last ten years in different domains, such as design of asynchronous circuits, communication protocols and distributed software in general. A lot of us accepted the challenge to design automated verification tools, and many different theories have been suggested for the automated analysis of distributed systems. There now exist elaborate methods that can verify quite subtle behaviors. A simple method for performing automated verification is symbolic execution which is the core of most existing and planned verification systems. The practical limits of this method are the size of the state space and the time it may take to inspect all reachable states in this state space. Those quantities can dramatically rise with the problem size.

Published
1992
Full Text
View/download PDF

29. Development of Veda, a prototyping tool for distributed algorithms

Author

Claude Jard, Roland Groz, and J.-F. Monin

Subjects
Rapid prototyping, Structure (mathematical logic), Standardization, Computer science, business.industry, 020207 software engineering, 02 engineering and technology, Software prototyping, Prolog, Distributed algorithm, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Software engineering, business, Protocol (object-oriented programming), computer, Software, Virtual prototyping, computer.programming_language
Abstract

The development of a simulator, called Veda, is described. Veda is a software tool to help designers in protocol modeling and validation. It is oriented towards the rapid prototyping of distributed algorithms. Algorithms are described using an ISO (International Organisation for Standardization) formal description technique, called Estelle. The development of Veda and its internal structure is presented, emphasizing the use of Prolog as a software engineering tool. Typical uses of Veda are discussed. >

Published
1988
Full Text
View/download PDF

30. An experiment in automatic generation of test suites for protocols with verification technology

Author

Thierry Jéron, Jean-Claude Fernandez, Claude Jard, and César Viho

Subjects
Test purpose, Computer science, Programming language, Concurrency, White-box testing, Testing, Verification, Test suite, computer.software_genre, Toolbox, Test (assessment), Protocol, Verilog, Graph (abstract data type), computer, Protocol (object-oriented programming), Software, Conformance, computer.programming_language
Abstract

In this paper we describe an experiment in automatic generation of test suites for protocol testing. We report the results gained with generation of test suites based on advanced verification techniques applied to a real industrial protocol. In this experiment, several tools have been used: the commercial tool GEODE (VERILOG) was used for the generation of finite state graph models from SDL specifications, the tool Aldebaran of the CADP toolbox for the minimization of transition systems, and a prototype named TGV (for Test Generation using Verification techniques) for the generation of test suites which has been developed in the CADP toolbox. TGV is based on verification techniques such as synchronous product and on-the-fly verification. These tools have been applied to an industrial protocol, the DREX protocol. The comparison of produced test suites with hand written test suites proves the relevance of the used techniques.

Catalog

Books, media, physical & digital resources
See catalog results