WorldCat Identities

Le Gall, Pascale

Overview
Works: 45 works in 72 publications in 2 languages and 340 library holdings
Genres: Conference papers and proceedings 
Roles: Editor, Thesis advisor, Other, Opponent, htt, Author, Publishing director, Contributor
Classifications: QA76.758, 005.1
Publication Timeline
.
Most widely held works by Pascale Le Gall
Testing Software and Systems : 31st IFIP WG 6.1 International Conference, ICTSS 2019, Paris, France, October 15-17, 2019, Proceedings by ICTSS (Conference)( )

11 editions published in 2019 in English and held by 266 WorldCat member libraries worldwide

This book constitutes the refereed proceedings of the 31st IFIP WG 6.1 International Conference on Testing Software and Systems, ICTSS 2019, held in Paris, France, in October 2019. The 14 regular papers and 3 short papers presented were carefully reviewed and selected from 30 submissions. This year also included an additional industrial paper. ICTSS is a series of international conferences addressing the conceptual, theoretic, and practical problems of testing software systems, including communication protocols, services, distributed platforms, middleware, embedded and cyber-physical systems, and security infrastructures
Introducing unbounded arities : sequence algebras by A Deo( Book )

3 editions published in 1994 in English and French and held by 5 WorldCat member libraries worldwide

Automated test generation from bounded data types specifications by Agnès Arnould( Book )

3 editions published in 1997 in English and held by 5 WorldCat member libraries worldwide

Abstract : "We present a test generation tool from bounded data type specifications. Our specifications are made of a classical algebraic specification describing ideal data types, and a bound description given in a constraint system. Our test generation procedure is a bounding constraint enrichment (using constraint logic programming techniques) of the LOFT tool (developed for test generation from algebraic specifications). We demonstrate this implementation on the bounded binary search tree example, from which we generate nominal tests and boundary tests using bound coverage criteria."
Dynamic testing from bounded data type specifications by Agnès Arnould( Book )

3 editions published in 1996 in English and held by 5 WorldCat member libraries worldwide

LES ALGEBRES ETIQUETEES : UNE SEMANTIQUE POUR LES SPECIFICATIONS ALGEBRIQUES FONDEE SUR UNE UTILISATION SYSTEMATIQUE DES TERMES. APPLICATION AU TEST DE LOGICIEL AVEC TRAITEMENT D'EXCEPTIONS by Pascale Le Gall( Book )

2 editions published in 1993 in French and held by 4 WorldCat member libraries worldwide

LE TRAITEMENT D'EXCEPTIONS EST SOUVENT NEGLIGE DANS LA PHASE DE SPECIFICATIONS DES LOGICIELS. NOUS PROPOSONS UNE NOUVELLE APPROCHE ALGEBRIQUE COMME CADRE D'UNE NOUVELLE THEORIE DU TEST FONCTIONNEL A PARTIR DE SPECIFICATIONS ALGEBRIQUES AVEC TRAITEMENT D'EXCEPTIONS. LE CAS DES STRUCTURES DE DONNEES BORNEES FOURNIT UN EXEMPLE DE SPECIFICATIONS OU IL EST SOUHAITABLE DE POUVOIR DIFFERENCIER DEUX EXPRESSIONS QUI SONT PAS AILLEURS EGALES. L'APPLICATION DES PROPRIETES EXPRIMEES PAR LES AXIOMES DOIT ETRE RESTREINTE SOIGNEUSEMENT. NOUS UTILISONS LES ETIQUETTES COMME DES MARQUES SPECIALES PERMETTANT DE CARACTERISER LES MOTIFS APPROPRIES. LE CADRE GENERAL DES ALGEBRES ETIQUETEES FOURNISSENT UNE SEMANTIQUE POUR LES ETIQUETTES. DES RESULTATS ALGEBRIQUES USUELS (MODELE INITIAL, FONCTEUR DE SYNTHESE, ...) SONT OBTENUS POUR LES SPECIFICATIONS ETIQUETEES CONDITIONNELLES POSITIVES. NOUS DEFINISSONS UN NOUVEAU FORMALISME ALGEBRIQUE DES EXCEPTION-ALGEBRES COMME APPLICATION DIRECTE DES ALGEBRES ETIQUETEES. IL PERMET DE SPECIFIER TOUS LES CARACTERISTIQUES PROPRES AU TRAITEMENT D'EXCEPTIONS COMME LA RECUPERATION, LA PROPAGATION IMPLICITE DES EXCEPTIONS, ETC. GRACE A L'ETIQUETAGE DES TERMES, NOUS EVITONS LES PROBLEMES USUELS D'INCONSISTANCES SOULEVES PAR LE TRAITEMENT D'EXCEPTIONS (COMME CEUX APPARAISSANT POUR LES STRUCTURES DE DONNEES BORNEES AVEC RECUPERATIONS AU-DELA DES BORNES). COMME LES ASPECTS SEMANTIQUES SPECIFIQUES AU TRAITEMENT D'EXCEPTIONS PEUVENT ETRE SPECIFICES A L'AIDE D'UN ENSEMBLE BIEN CHOISI D'AXIOMES ETIQUETES, DES RESULTATS ALGEBRIQUES SONT DEDUITS DE CEUX ETABLIS POUR LES SPECIFICATIONS ETIQUETEES. ENFIN, NOUS DEFINISSONS UN NOUVEAU FORMALISME DE TEST FONCTIONNEL A PARTIR DE SPECIFICATIONS FORMELLES. LA PRINCIPALE IDEE SOUS-JACENTE EST QU'UNE PHASE DE TEST NE PEUT ETRE DEFINIE QU'EN PRESENCE D'UNE PROCEDURE D'ORACLE REELLEMENT DISPONIBLE. LORSQUE L'ORACLE EST CARACTERISE PAR UN ENSEMBLE DE FORMULES OBSERVABLES, NOUS ETABLISSONS QUELQUES RESULTATS EXPLOITABLES POUR LES SPECIFICATIONS ALGEBRIQUES USUELLES ET LES EXCEPTION-SPECIFICATIONS
Une description générique formelle des systèmes à base de services : Application du raffinement et de l' enrichissement algébrique au problème des interactions de services by Christophe Gaston( Book )

2 editions published in 2002 in French and held by 3 WorldCat member libraries worldwide

Un système orienté-services est un système logiciel destiné à être re-conçu incrémentalement pour fournir à ses utilisateurs de nouvelles options. Ceci amène à modifier et / ou enrichir certains comportements du systèmes. La modification de tels comportements est appelée service. Les services sont conçus et intégrés indépendamment les uns des autres. Cette indépendance a pour effet d'induire des comportements du système non prévus. Ces derniers sont appelés : Interactions. Dans le cadre des méthodes formelles, il existe plusieurs caractérisations de la notion d'interaction, mais ces dernières dépendent de la logique sous-jacente. Dans cette thèse, nous proposons des définitions génériques des notions de services, systèmes orienté-services et interaction. Ces dernières sont caractérisées dans la théorie des institutions. A partir d'une institution quelconque, nous montrons comment définir une nouvelle institution dédiée à spécifier des services. Puis nous montrons comment composer ces services de façon à modéliser les systèmes de services et l'opération d'intégration de services. Les interactions sont alors mises en lumière par l'étude de deux types de propriétés : Les propriétés émergentes qui dénotent des comportements du système non prédits par la description du service et les propriétés de non-conformités qui dénotent des comportements promis par la description du services et qui ne sont pas des comportements du système. Dans la dernière partie de la thèse, nous montrons comment ces propriétés sont conservées au travers de primitives d'enrichissement et de raffinement. Dans les deux cas, (enrichissement et raffinement), nous montrons que les propriétés émergentes sont préservées (bien que de nouvelles puissent apparaître) alors que les propriétés de non conformité peuvent disparaître. Finallement, nous proposons d'imposer des conditions suffisantes pour obtenir une conservation complète des propriétés émergentes et de non-conformité
Modélisation hybride temporelle et analyse par contraintes des réseaux de régulation biologiques by Jonathan Fromantin( Book )

in French and held by 2 WorldCat member libraries worldwide

Embedding of Biological Regulatory Networks and Property Preservation by Mbarka Mabrouki( )

1 edition published in 2011 in English and held by 2 WorldCat member libraries worldwide

Hoare-like verification of graph transformation by Jon Haël Brenas( )

1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide

In computer science as well as multiple other fields, graphs have become ubiquitous. They are used to represent data in domains ranging from chemistry to architecture, as abstract structures or as models of the data or its evolution. In all these domains, graphs are expected to evolve over time due to chemical reactions, update of the knowledge or programs. Being able to deal with such transformations is an extremely important and difficult task. In this work, our aim is to study the verification of such graph transformation, that is how to prove that a graph transformation is correct. Correctness of a graph transformation is more precisely defines as correctness of a specification for the transformation containing additionally a precondition and a postcondition. We decided to use a Hoare-like calculus generating the weakest precondition for a postcondition and a transformation. If this weakest precondition is implied by the actual precondition, the specification is correct. We chose a more algorithmic approach to graph transformation by using atomic actions.We chose to define two ways to build graph transformations: using an imperative programming language and using rule-base rewriting systems. The main ingredient of the verification of graph transformation is the logic that is chosen to represent the precondition, the postcondition and the possible conditions internal to the transformation. So that the logic can interact with the calculus, we require that the decision problem be decidable, that the logic be closed under the substitutions introduced by the Hoare-like calculus and that it has to be able to express the existence and absence of a match for the transformation. The core result of this work is the identification and explanation of these conditions
Systèmes multi-agents adaptatifs avec contraintes temps-réel : De la spécification formelle à la vérification et à la génération de code by Dong Hue Wang( Book )

2 editions published in 2005 in French and held by 2 WorldCat member libraries worldwide

The design of reactive systems must comply with logical correctness (the system does what it supposed to do) and timeliness (the system has to satisfy a set of temporal constraints) criteria. In this paper, we propose a global approach for the design of adaptative reactive systems, i.e. systems that dynamically adapt their architecture depending on the context. We use the timed automata formalism for the design of the agents' behaviour. This allows evaluating beforehand the properties of the system (regarding logical correctiness and timeliness), thanks to model-checking and simulation techniques. This model is enhanced to tools that we developed for the automatic generation of code, allowing to produce very quickly a running multi-agent prototype satisfying the properties of model
Résultats de théorie abstraite des modèles dans le cadre des institutions : vers la combinaison de logiques by Fabrice Barbier( Book )

2 editions published in 2005 in French and held by 2 WorldCat member libraries worldwide

The importance of Craig interpolation for structuration and modularity of axiomatic style specifications have been shown by many works. In order to give sufficient conditions to Craig interpolation in a suitable framework for computer science, we've studied a propery equivalent to Craig interpolation in standard model theory: Robinson consistency. To do so, we had to generalize the notions of complete diagrams and elementary morphisms in a specialization of institutions. This allowed the generalization of other classical standard model theory results such as Löwenheim-Skolem theorem and Tarski chain union. Finally, since formulae constructors are explicite in our framework, we've studied logic combination and the preservation of both Craig interpolation and Robinson consistency through combination
Etude et spécifications formelles de l'arrondi d'objets géométriques by Franck Ledoux( Book )

2 editions published in 2002 in French and held by 2 WorldCat member libraries worldwide

With 2D objects, rounding operation consists in replacing sharp edges by smooth rounded surfaces. We provide a general rounding operation which allows to treat an unspecified number of edges in an object with different parameters for each edge. This approach is made possible by using an underlying topologic structure which isolates and identifies the treatment at the extremities of rounded edges. Once the topology of the new object determined, a geometry is associated to him, either with a linear embedding, or with a surface embedding wich introduces Bezier surfaces. In the last case, for all configurations, internal G1-continuity is ensured between surfaces. A particular attention is given to the surfaces which replace the vertices adjacent to the rounded edges. The developed methods are efficient with 2D or 3D objects.The topological part and the geometrical part with linear embedding of our rounding operation are completely specified by using the algebraic specification language CASL. This work brings a new definition level for geometrical operations. More abstract than usual mathematical definitions, it conveys the intuition of operations and topological models while being more rigorous than algorithms. It results from using a specification method based on the properties of the model. Then, we get a requirement specification providing a complete formalization for the n-G-map model, its basic operations and the rounding operation with linear embedding
Topology-based abstraction of complex biological systems: application to the Golgi apparatus by Mathieu Poudret( )

1 edition published in 2008 in English and held by 2 WorldCat member libraries worldwide

Génération et analyse de tests pour les systèmes autonomes by Clément Robert( Book )

2 editions published in 2021 in French and held by 2 WorldCat member libraries worldwide

Les robots autonomes sont principalement testés par des expérimentations sur le terrain. Cette approche est coûteuse et peut présenter des risques. Une méthode alternative consiste à réaliser une partie des tests sur une plate-forme de simulation. Ceci soulève plusieurs défis : la génération d'environnements virtuels complexes, la vérification automatisée du comportement observé (oracle de test), et la fidélité imparfaite de la simulation par rapport à des tests sur le terrain. Cette thèse est divisée en deux parties axées autour de ces problématiques. Dans une première partie, nos travaux abordent ces différents points au travers du cas d'étude d'un robot agricole, le robot Oz de la société Naïo Technologies. Nous faisons en particulier une analyse comparative des fautes trouvées en simulation et sur le terrain. La contribution principale de cette partie est de démontrer la faisabilité et l'efficacité du test en simulation sur un cas industriel. Malgré leur fidélité imparfaite, les tests en simulation révèlent la plupart des fautes trouvées par les expérimentations avec le robot réel, y compris celles ayant causé la majorité des défaillances sur le terrain. Ils révèlent également une nouvelle faute passée inaperçue sur le terrain mais confirmée par l'industriel. Cependant, l'effort d'implémentation des tests virtuels se révèle important, avec notamment le développement d'un générateur de données spécifiques aux environnements 3D du robot. Ce constat a mené la suite de nos travaux vers l'étude de la génération de tests. La deuxième partie de nos travaux introduit une nouvelle méthode de génération de test et un outil qui l'implémente. Elle se base sur un modèle de données purement déclaratif, en combinant la résolution de contraintes SMT et l'échantillonnage aléatoire. Bien que le point de départ de ces travaux soit la génération d'environnements virtuels pour les systèmes autonomes, notre méthode de génération s'applique à un domaine bien plus large. Elle permet de produire des données structurées de tailles variables, tout en respectant des propriétés sémantiques et en offrant de la diversité. Nous avons évalué notre méthode sur quatre cas d'étude venant de domaines d'application variés (le robot Oz, un système de gestion de taxe, des images de dégradé de gris et des structures arborescentes). Nos résultats montrent des données générées efficacement et couvrant bien l'espace des solutions. Notre méthode est compétitive au regard des approches existantes auxquelles nous l'avons comparée
Modelling genetic regulatory networks from specified behaviours by Daniel Mateus( )

1 edition published in 2007 in English and held by 2 WorldCat member libraries worldwide

Contribution à la vérification de programmes C par combinaison de tests et de preuves. by Guillaume Petiot( )

2 editions published in 2015 in French and held by 2 WorldCat member libraries worldwide

Software verification often relies on a formal specification encoding the program properties to check. Formally specifying and deductively verifying programs is difficult and time consuming and requires some knowledge about theorem provers. Indeed, a proof failure for a program can be due to a noncompliance between the code and its specification, a loop or callee contrat being insufficient to prove another property, or a prover incapacity. It is often difficult for the user to decide which one of these three reasons causes a given proof failure. Indeed, this feedback is not (or rarely) provided by the theorem prover thus requires a thorough review of the code and the specification. This thesis develops a method to automatically diagnose proof failures and facilitate the specification and verification task. This work takes place within the analysis framework for C programs FRAMAC, that provides the specification language ACSL, the deductive verification plugin WP, and the structural test generator PATHCRAWLER. The proposed method consists in diagnosing proof failures using structural test generation on an instrumented version of the program under verification
Validation de spécifications à base d'automates par des techniques de dépliage et d'exécution by Nicolas Rapin( Book )

2 editions published in 2004 in French and held by 2 WorldCat member libraries worldwide

Une partie notable des anomalies de fonctionnements des systèmes industriels est due à des erreurs de spécifcation. La validation est l'ensemble des techniques qui visent à prévenir de telles erreurs. La thèse développe une méthodologie, ainsi que ses fondements théoriques, pour la validation de spécifications à bases d'automates communicants. L'idée développée est qu'une spécification peut être réécrite dans une forme qui révèle ses comportements, de sorte que le concepteur puisse en apprécier la justesse. Plus techniquement la spécification réécrite est un graphe construit à partir des chemins de contrôle consistants issus de la spécification d'origine. Il est montré que la spécification réécrite décrit bien le même système et qu'elle peut être substituée à la spécification d'origine dans le cas où elle joue le rôle de composant au sein d'un système plus vaste. Ce résultat soutient une méthodologie de validation basée sur le couple validation unitaire/ validation d'intégration
Exploration concrétisée et pertinente de systèmes d'événements abstraits en vue de la génération automatique de tests by Guillaume Voiron( )

2 editions published in 2019 in French and held by 2 WorldCat member libraries worldwide

The work presented in this thesis contributes to the automated under-approximation generation techniques in order to generate tests from models.Model based testing aims at guaranteeing the conformity of an implementation with regards to a model, both designed from specifications by two distinct teams.In this thesis, we propose to use well known abstraction techniques by using predicates extracted from behavioural models allowing to reduce the manipulated state space to a finite and narrow set. We propose to extract the abstraction predicates from the test purpose so that the generated tests cover the behaviours it targets. However, the computation of an abstraction causes a loss of information of the reachability with regards to the initial model. Our goals are, on the one hand, to efficiently compute an abstraction of the model as representative as possible of a test purpose. On the other hand, we strive to extract executions from this abstraction which can be instanciated on the model before its abstraction, targeting the behaviours to test, and aiming at covering the states and the transitions of the abstracted model.Our contributions are the following. We define a test generation method combining various algorithms allowing to obtain a good structural coverage of the abstraction of a non deterministic behavioural model. We first propose an algorithm computing the abstraction of a model using predicates extracted from a test purpose expressed as a temporal property. This algorithm computes an under-approximation of the model by covering the abstract states and transitions of the model. It applies various exploration heuristics and techniques with the aim of increasing the amount of reached instances. Then, we propose to improve by the means of two other algorithms the structural coverage obtained by this first under-approximation. The first of these algorithms, fully automated, takes advantage of the known modalities of the abstract transitions which provide us with reachability properties. The second under-approximation extension algorithm uses the expertise of the tester who must, from non covered transitions, design a relevance predicate which will guide and limit the exploration and the instanciations. We define a set of rules allowing to express this relevance predicate and compute a variant guaranteeing the termination of the exploration algorithm. These two algorithms complete the under-approximation by necessarily instanciable executions. Finally, we experimentally assess the quality of the method on five case studies
Automatisation du test de tous-les-chemins en présence d'appels de fonction by Patricia Mouy( Book )

2 editions published in 2007 in French and held by 2 WorldCat member libraries worldwide

Structural testing is usually restricted to unit tests and based on some clear definition of source code coverage. In particular, the all-paths criterion is recognised as offering a high level of software reliability. To limit the combinatorial explosion in the number of paths, we choose to abstract the called functions by their specification. We incorporate the functional information on the called functions within the structural information on the function under test, given as a CFG. This representation combining functional and structural descriptions allows us to characterise test selection criteria ensuring the coverage of the source code of the function under test.Two new criteria are proposed. The first one corresponds to the coverage of all the paths of this new representation, including all the paths arising from the functional description of the called functions. The second one covers all the feasible paths of the function under test only
Modélisation discrète de la régulation du métabolisme énergétique des cellules eukaryotes et validation formelle de sa dynamique by Rajeev Khoodeeram( )

1 edition published in 2021 in English and held by 1 WorldCat member library worldwide

We present a formal model of the regulation of the energetic metabolism in eukaryotic cells. The main originality of this model is to consider explicitly an abstraction of the main metabolic processes that pilot this metabolism, thereby greatly reducing the number of variables in the model. Moreover, the modelling framework proposed by Réné Thomas is particularly well suited for a qualitative view of regulatory networks resulting in a model with 14 variables and 112 parameters, with integer values. However, the model contains a lot of feedback loops which are intricately linked and which makes the dynamic of the system very complex. As in all complex system modelling, the main difficulty is to identify the value of all parameters in a coherent way with respect to known dynamic behaviours. The identification of parameters has been smoothed due to a large repertoire of knowledge in molecular biology, and the validation of the proposed model has been done by model checking, in more than 160 temporal logic formulas (including the main metabolic phenotypes, notably the Warburg effect). It has been a meticulate process which has been successful by putting in place a solid and pluridisciplinary method of modelling together with a software platform (DyMBioNet), both pivotal for this thesis. The model has been conceived to be used as a backbone, which can be plugged with other regulatory net- works like the cell cycle or the circadian clock, for potential applications to cancer or chronotherapy. The DyMBioNet software is bundled with three main functionalities including verifying system proper- ties with CTL, simulation as well as visualisation of a complex system. Furthermore, this well-defined methodology, and its software platform DyMBioNet, would be useful to directly construct other formal regulatory networks of large size
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.00 (from 0.00 for Testing So ... to 0.00 for Testing So ...)

WorldCat IdentitiesRelated Identities
Testing Software and Systems : 31st IFIP WG 6.1 International Conference, ICTSS 2019, Paris, France, October 15-17, 2019, Proceedings
Covers
Languages
English (24)

French (23)