A BTP-Based Family of Variable Elimination Rules for Binary CSPs

International audienceThe study of broken-triangles is becoming increasingly ambitious , by both solving constraint satisfaction problems (CSPs) in polynomial time and reducing search space size through value merging or variable elimination. Considerable progress has been made in extending this important concept, such as dual broken-triangle and weakly broken-triangle, in order to maximize the number of captured tractable CSP instances and/or the number of merged values. Specifically, m-wBTP allows to merge more values than BTP. k-BTP, WBTP and m-BTP permit to capture more tractable instances than BTP. Here, we introduce a new weaker form of BTP, which will be called m-fBTP for flexible broken-triangle property. m-fBTP allows on the one hand to eliminate more variables than BTP while preserving satisfiability and on the other to define new bigger tractable class for which arc consistency is a decision procedure. Likewise, m-fBTP permits to merge more values than BTP but less than m-wBTP

Model Driven Mutation Applied to Adaptative Systems Testing

Dynamically Adaptive Systems modify their behav- ior and structure in response to changes in their surrounding environment and according to an adaptation logic. Critical sys- tems increasingly incorporate dynamic adaptation capabilities; examples include disaster relief and space exploration systems. In this paper, we focus on mutation testing of the adaptation logic. We propose a fault model for adaptation logics that classifies faults into environmental completeness and adaptation correct- ness. Since there are several adaptation logic languages relying on the same underlying concepts, the fault model is expressed independently from specific adaptation languages. Taking benefit from model-driven engineering technology, we express these common concepts in a metamodel and define the operational semantics of mutation operators at this level. Mutation is applied on model elements and model transformations are used to propagate these changes to a given adaptation policy in the chosen formalism. Preliminary results on an adaptive web server highlight the difficulty of killing mutants for adaptive systems, and thus the difficulty of generating efficient tests.Comment: IEEE International Conference on Software Testing, Verification and Validation, Mutation Analysis Workshop (Mutation 2011), Berlin : Allemagne (2011

Adaptation des Protocoles des Composants par les Automates d'Interface

National audienceUn des objectifs de l'ingénierie des logiciels base de composants (CBSE) est de permettre la réutilisation des composants sans affecter leurs implémentations. Pour atteindre cet objectif, il est nécessaire de proposer des méthodes et des outils d'adaptation des composants avec leur environnement lorsque des incompatibilités se produisent au cours de leurs interactions. Dans ce papier, nous proposons une approche formelle d'adaptation des composants dont les protocoles comportementaux sont décrits par les automates d'interface, fin d'éliminer les disparités entre les composants aux niveaux des signatures et des protocoles. L'approche proposée tire profit de l'approche optimiste des automates d'interface. Ce formalisme permet de spécifer l'ordonnancement temporel des services requis et offerts des composants

Assembly of components based on interface automata and {UML} component model

International audienceWe propose an approach which combines component UML model and interface automata in order to assemble components and to verify their interoperability. We specify component based system architecture with component UML model, and component interfaces with interface automata. Interface automata is a common Input Output (I/O) automata-based formalism intended to specify the signature and the protocol level of component interfaces. We improve interface automata approach by component UML model, in order to consider system architecture, in component composition and interoperability verification methods. Therefore, we handle in interface automata, the connection between components, and the hierarchical connections between composite components and their subcomponents

Refinement of Interface Automata Strengthened by Action Semantics

International audienceInterface automata are light-weight models that capture the temporal interface behavior of software components. They have the ability to model both the input requirements and the output behavior of a component. They support the compatibility check between interface models to ensure a correct interaction between components and they adopt an alternating simulation approach to design refinement. In this paper, we extend our previous works on checking interface automata interoperability by adapting their alternating refinement relation to the action semantics. We show the relation between pre and post-conditions of transitions in the abstract version of an interface and their corresponding ones in its concrete version. We illustrate our extensions by a case study of the CyCab car component-based system

An {I/O} Automata-based Approach to Verify Component Compatibility: Application to the {CyCab} Car

International audienceAn interesting formal approach to specify component interfaces is interface automata based approach, which is proposed by L. Alfaro and T. Henzinger. These formalisms have the ability to model both the input and output requirements of components system. In this paper, we propose a method to enrich interface automata by the semantics of actions in order to verify components interoperability at the levels of signatures, semantics, and protocol interactions of actions. These interfaces consist of a set of required and offered actions specified by Pre and Post conditions. The verification of the compatibility between interface automata reuse the L.Alfaro and T.Henzinger proposed algorithm and adapt it by taking into account the action semantics. Our approach is illustrated by a case study of the vehicle CyCab

Adapting Components Behaviours using Interface Automata

International audienceOne of the principal goal of Component-Based Software Engineering (CBSE) is to allow the reuse of components in diverse situations without affecting their codes. To reach this goal, it is necessary to propose approaches to adapt a component with its environment when behavioural mismatches occur during their interactions. In this paper, we present a formal approach based on interface automata to adapt components in order to eliminate possible behavioural mismatches, and then insure more flexible interoperability between component

Chirped Pulse Spectrometer Operating at 200 GHz

The combination of electronic sources operating at high frequencies and modern microwave instrumentation has enabled the recent development of chirped-pulse spectrometers for the millimetre and THz bands. This type of instrument can operate at high resolution which is particularly suited to gas phase rotational spectroscopy. The construction of a chirped pulse spectrometer operating at 200 GHz is described in detail while attention is paid to the phase stability and the data accumulation over many cycles. Validation using carbonyl sulphide has allowed the detection limit of the instrument to be established as function of the accumulation. A large number of OCS transitions were identified using a 10 GHz chirped pulse and include the 6 most abundant isotopologues, the weakest line corresponding to the fundamental R(17) transition of 16 O 13 C 33 S with a line strength of 4.3 x 10-26 cm-1 /(molec.cm-2). The linearity of the system response for different degrees of data accumulation and transition line strength was confirmed over 4 orders of magnitudes. A simple analysis of the time domain data was demonstrated to provide the line broadening coefficient without the need for conversion by a Fourier transform. Finally, the pulse duration is discussed and optimal values are given for both Doppler limited and collisional regimes

Object-Oriented Component-based Design using Behavioral Contracts: Application to Railway Systems

In this report, we propose a formal approach for the design of object-oriented component-based systems using behavioral contracts. This formalism merges interface automata describingcommunication protocols of components with the semantics of their operations. On grounds ofconsistency with the object-oriented paradigms, we revisit the notions of incremental design andindependent implementability of interface automata by novel definitions of components compatibility,composition, and refinement. Our work is illustrated by a design case study of CBTC railway systems