Les travaux présentés dans ce mémoire de thèse s'intéressent à la validation fonctionnelle de contrôleurs logiques par des techniques de test de conformité et de validation en boucle fermée. Le modèle de spécification est décrit dans le langage industriel Grafcet et le contrôleur logique est supposé être un automate programmable industriel (API) mono-tâche. Afin de contribuer à ces techniques de validation fonctionnelle, ces travaux présentent : - Une extension d'une méthode de formalisation du Grafcet par traduction sous la forme d'une machine de Mealy. Cette extension permet de produire un modèle formel de la spécification lorsque le Grafcet est implanté selon un mode d'interprétation sans recherche de stabilité, qui n'est pas préconisé dans la norme IEC 60848 mais largement utilisé dans les applications industrielles. - Une contribution au test de conformité par la définition d'un ensemble de relations de conformité basées sur l'observation de plusieurs cycles d'exécution pour chaque pas de test. - Une contribution à la validation en boucle fermée par la définition d'un critère de fin d'observation et par une technique d'identification en boite grise pour la construction et l'analyse du système en boucle fermée. / The results presented in this PhD thesis deal with functional validation of logic controllers using conformance test and closed-loop validation techniques. The specification model is written in the Grafcet language and the logic controller is assumed to be a Programmable Logic Controller (PLC). In order to contribute to these validation techniques, this thesis presents: - An axtension to a fomalization methods for Grafcet languages by translation to a Mealy machine. This extension generates a formal model of a Grafcet specification that is interpreted without search of stability. This mode of interpretation is not recommended by the standard IEC 60848 but is widely used in industrial applications. - A contribution to conformance test by a definition of a set of conformance relation based on the observation of several execution cycles for each test step. - A contribution to closed-loop validation by the definition of a termination criterion and by a new gray-box identification technique that is used for construction and analysis of the closed-loop system.

Reconstruímos a Teoria da Escolha Pública explicitando seus pressupostos sobre a natureza do objeto, do conhecimento e dos valores e sua lógica de operação, ou seja, seu método de solução de problemas. Mostramos com essa teoria que podemos entender a política como um processo de pacificação pela troca, em vez de um processo de pacificação pelo poder. Temos então novas respostas para as perguntas fundamentais da Ciência Política: Como é possível emergir a cooperação pacífica e legítima entre indivíduos? Qual é a maneira de fazer com que diferentes interesses individuais sejam reconciliados? A Teoria sugere que a política pode ser um jogo de soma positiva, evitando deseconomias constitucionais, guiando-se pelo princípio da unanimidade. Mostraremos então os desenhos constitucionais como ambientes de interação entre indivíduos e poderemos predizer que regras engendrarão cooperação ou competição. / We do a reconstruction of the Public Choice Theory explaining their assumptions about the nature of the object, knowledge and values and logic of their operation, i.e. its method of solution of problems. We show that with this theory we can understand the politics as a process of pacification through trade-offs, instead of a peace process by means of power. Proceeding in this way we obtain new answers to fundamental questions of Political Science: How can emerge a peaceful and legitimate cooperation among individuals? What is the way to conciliate different individual interests? The theory suggests that politics can be a positive-sum game, avoiding constitutional diseconomies, and must be guided by the principle of unanimity. Then we show how the constitutional designs as interaction environments for individuals and so can predict what rules make cooperation or competition.

Reconstruímos a Teoria da Escolha Pública explicitando seus pressupostos sobre a natureza do objeto, do conhecimento e dos valores e sua lógica de operação, ou seja, seu método de solução de problemas. Mostramos com essa teoria que podemos entender a política como um processo de pacificação pela troca, em vez de um processo de pacificação pelo poder. Temos então novas respostas para as perguntas fundamentais da Ciência Política: Como é possível emergir a cooperação pacífica e legítima entre indivíduos? Qual é a maneira de fazer com que diferentes interesses individuais sejam reconciliados? A Teoria sugere que a política pode ser um jogo de soma positiva, evitando deseconomias constitucionais, guiando-se pelo princípio da unanimidade. Mostraremos então os desenhos constitucionais como ambientes de interação entre indivíduos e poderemos predizer que regras engendrarão cooperação ou competição. / We do a reconstruction of the Public Choice Theory explaining their assumptions about the nature of the object, knowledge and values and logic of their operation, i.e. its method of solution of problems. We show that with this theory we can understand the politics as a process of pacification through trade-offs, instead of a peace process by means of power. Proceeding in this way we obtain new answers to fundamental questions of Political Science: How can emerge a peaceful and legitimate cooperation among individuals? What is the way to conciliate different individual interests? The theory suggests that politics can be a positive-sum game, avoiding constitutional diseconomies, and must be guided by the principle of unanimity. Then we show how the constitutional designs as interaction environments for individuals and so can predict what rules make cooperation or competition.

Les réseaux logiciels (connus sous l'éppellation: Software Defined Networking, SDN), qui s'appuient sur le paradigme de séparation du plan de contrôle et du plan d'acheminement, ont fortement progressé ces dernières années pour permettre la programmabilité des réseaux et faciliter leur gestion. Reconnu aujourd'hui comme des architectures logicielles pilotées par des applications, offrant plus de programmabilité, de flexibilité et de simplification des infrastructures, les réseaux logiciels sont de plus en plus largement adoptés et graduellement déployés par l'ensemble des fournisseurs. Néanmoins, l'émergence de ce type d'architectures pose un ensemble de questions fondamentales sur la manière de garantir leur correct fonctionnement. L'architecture logicielle SDN est elle-même un système complexe à plusieurs composants vulnérable aux erreurs. Il est essentiel d'en assurer le bon fonctionnement avant déploiement et intégration dans les infrastructures.Dans la littérature, la manière de réaliser cette tâche n'a été étudiée de manière approfondie qu'à l'aide de vérification formelle. Les méthodes de tests s'appuyant sur des modèles n'ont guère retenu l'attention de la communauté scientifique bien que leur pertinence et l'efficacité des tests associés ont été largement demontrés dans le domaine du développement logiciel. La création d'approches de test efficaces et réutilisables basées sur des modèles nous semble une approche appropriée avant tout déploiement de réseaux virtuels et de leurs composants. Le problème abordé dans cette thèse concerne l'utilisation de modèles formels pour garantir un comportement fonctionnel correct des architectures SDN ainsi que de leurs composants. Des approches formelles, structurées et efficaces de génération de tests sont les principale contributions de la thèse. En outre, l'automatisation du processus de test est mis en relief car elle peut en réduire considérablement les efforts et le coût.La première contribution consiste en une méthode reposant sur l'énumération de graphes et qui vise le test fonctionnel des architectures SDN. En second lieu, une méthode basée sur un circuit logique est développée pour tester la fonctionnalité de transmission d'un commutateur SDN. Plus loin, cette dernière méthode est étendue pour tester une application d'un contrôleur SDN. De plus, une technique basée sur une machine à états finis étendus est introduite pour tester la communication commutateur-contrôleur.Comme la qualité d'une suite de tests est généralement mesurée par sa couverture de fautes, les méthodes de test proposées introduisent différents modèles de fautes et génèrent des suites de tests avec une couverture de fautes guarantie. / Having gained momentum from its concept of decoupling the traffic control from the underlying traffic transmission, Software Defined Networking (SDN) is a new networking paradigm that is progressing rapidly addressing some of the long-standing challenges in computer networks. Since they are valuable and crucial for networking, SDN architectures are subject to be widely deployed and are expected to have the greatest impact in the near future. The emergence of SDN architectures raises a set of fundamental questions about how to guarantee their correctness. Although their goal is to simplify the management of networks, the challenge is that the SDN software architecture itself is a complex and multi-component system which is failure-prone. Therefore, assuring the correct functional behaviour of such architectures and related SDN components is a task of paramount importance, yet, decidedly challenging.How to achieve this task, however, has only been intensively investigated using formal verification, with little attention paid to model based testing methods. Furthermore, the relevance of models and the efficiency of model based testing have been demonstrated for software engineering and particularly for network protocols. Thus, the creation of efficient and reusable model based testing approaches becomes an important stage before the deployment of virtual networks and related components. The problem addressed in this thesis relates to the use of formal models for guaranteeing the correct functional behaviour of SDN architectures and their corresponding components. Formal, and effective test generation approaches are in the primary focus of the thesis. In addition, automation of the test process is targeted as it can considerably cut the efforts and cost of testing.The main contributions of the thesis relate to model based techniques for deriving high quality test suites. Firstly, a method relying on graph enumeration is proposed for the functional testing of SDN architectures. Secondly, a method based on logic circuit is developed for testing the forwarding functionality of an SDN switch. Further on, the latter method is extended to test an application of an SDN controller. Additionally, a technique based on an extended finite state machine is introduced for testing the switch-to-controller communication. As the quality of a test suite is usually measured by its fault coverage, the proposed testing methods introduce different fault models and seek for test suites with guaranteed fault coverage that can be stated as sufficient conditions for a test suite completeness / exhaustiveness.

Soit G un schéma en groupes réductif, connexe et déployé sur l’anneau d’entiers d’une extension finie du corps de nombres p-adiques. Un théorème important dans la théorie des groupes c’est le théorème de localisation, ce qui a été démontré par A. Beilinson et J. Bernstein, et par J.L. Brylinsky et M. Kashiwara. Il s’agit d’un résultat de D-affinité pour la variété de drapeaux de la fibre générique de G. En caractéristique mixte un progrès important se trouve dans les travaux de C. Huyghe et T. Schmidt. Ils donnent une réponse partielle en considérant des caractères algébriques. Les premières quatre chapitres de cette thèse sont consacrés à étendre cette correspondance (le théorème de localisation arithmétique) pour des caractères arbitraires. Dans les chapitres cinq et six, nous traiterons l’objectif principal de cette thèse qui concerne les représentations localement analytiques. Nous montrerons que pour un caractère algébrique, qui est de plus dominant et régulier, la catégorie des représentations admissibles localement analytiques, à caractère central, c’est équivalente à une catégorie de modules arithmétiques coadmissibles et équivariants sur la famille des modèles formels de la variété de drapeaux rigide. / Let G be a split connected, reductive group scheme over the ring of integers of a finite extension of the field of p-adic numbers.. An important theorem in group theory is the localization theorem, demonstrated by A. Beilinson and J. Bernstein, and by J.L. Brylinsky and M. Kashiwara. This is a result about the D-affinity of the flag variety of the generic fiber of G). In mixed characteristic an important progress is found in the work of C. Huyghe and T. Schmidt. They give a partial answer by considering algebraic characters. The first four chapters of this thesis are dedicated to extending this correspondence (the arithmetic localization theorem) for arbitrary characters. In chapters five and six, we will treat the principal objective of this thesis, which concerns admissible locally analytic representations. We will show that for an algebraic character, which is dominant and regular, the category of admissible locally analytic representations, with central character, it is equivalent to the category of coadmissible equivariant arithmetic modules over the family of formal models of the rigid flag variety.

[pt] Inúmeras linguagens de programação oferecem suporte a finalizadores e referências fracas. Não obstante, de maneira geral esses mecanismos são relativamente pouco conhecidos e pouco usados por programadores. Mesmo entre pesquisadores e desenvolvedores de linguagens não existe muito consenso quanto à sua semântica, que varia consideravelmente entre diferentes implementações. Neste trabalho buscamos explorar os conceitos de finalizadores e de referências fracas, suprindo a ausência de uma especificação clara e abrangente, e permitindo uma melhor compreensão, implementação e uso dos mecanismos correspondentes. Como ponto de partida realizamos um amplo levantamento sobre como é feito o suporte a finalizadores e referências fracas em diferentes linguagens de programação, identificando as características comuns, os problemas, e as questões semânticas mais relevantes associadas às implementações consideradas. Para garantir uma maior precisão em nossa análise, utilizamos um modelo abstrato de uma linguagem de programação com gerenciamento automático de memória. Através deste modelo especificamos formalmente a semântica de finalizadores e referências fracas, incluindo descrições das suas principais variantes e mecanismos relacionados. Além disso, provamos certas propriedades inerentes a linguagens de programação com gerenciamento automático de memória, indicando como estas são afetadas pela introdução de finalizadores e referências fracas. Por fim, consideramos possíveis estratégias de implementação desses mecanismos em diferentes tipos de sistemas. Algumas das opções semânticas investigadas impõe um custo de processamento expressivo, o que frequentemente inviabiliza a sua adoção na prática. / [en] Most mainstream programming languages support finalizers and weak references. In spite of that, these abstractions are still modestly known by programmers in general. Even among language designers there seems to be no common view on how to define their semantics, and language implementations certainly reflect that. In this thesis we explore the concepts of finalizer and weak reference by discussing several important issues that, as far as we know, have not been explored by other authors. After presenting a survey on how finalizers and weak references are supported by actual programming languages, we thoroughly examine their semantics and discuss alternative implementation strategies. We also use an operational approach to develop a formal model for reasoning about garbage collection and its interaction with client programs. By explicitly representing low-level details, such as heap memory and its addresses, we were able to clearly specify memory management actions, and prove several important memory-related language invariants. Using this model we describe a formal semantics for finalizers and weak references, exploring some of its many subtleties. We believe that the topics covered here can serve as a relevant reference for further investigations, and also help to guide actual implementations.