Cette thèse a pour objet les corrections perturbatives de CDQ pour la production de quatre jets dans l'annihilation des électrons et positrons. Les corrections à une boucle pour le sous-processus $e^+ e^- \rightarrow q \bar{q} Q \bar{Q}$ sont calculées avec de nouvelles méthodes qui comprennent la décomposition de couleur, la méthode des spineur d'hélicité, et une décomposition inspirée par la supersymmétrie. Nous avons également profité des contraintes découlants de l'unitarité et des limites colinéaires pour restreindre la forme analytique des amplitudes. Dans une deuxième phase, j'ai écrit un programme numérique qui combine des contributions dues aux corrections radiatives des sous-processus $e^+ e^- \rightarrow q \bar{q} Q \bar{Q}$ et $e^+ e^- \rightarrow q g g \bar{q}$ et dues aux corrections d'émission réelle. Le programme utilise le formalisme des dipoles pour annuler les divergences infra-rouge. L'analyse numérique contient des résultats sur la section efficace totale, le paramètre $D$ et la variable d'élargissement d'un jet.

For many years software engineering has primarily focused on the development of new systems and neglected maintenance and reengineering of legacy applications. Maintenance typically represents 70% of the cost during the life cycle of a system. In order to allow an efficient and safe maintenance of a legacy system, we need to reverse engineer it in order to reconstruct its missing or out-of-date documentation. In data-oriented applications the reverse engineering complexity can be broken down by considering that the database can be reverse engineered independently of the procedural components. Database reverse engineering can be defined as the process of recovering the database's schema(s) of an application from database declaration text and program source code that use the data in order to understand their exact structure and meaning. A database reverse engineering methodology is broken down into three processes: project preparation, data structure extraction that recovers the database's logical schema and data structure conceptualization that interprets the logical schema in conceptual terms. In order to validate our methodology and program understanding techniques, we have developed tools to support them. Those tools have proved absolutely necessary to perform database reverse engineering of medium to larger applications in reasonable time and at reasonable cost. To cut down on the cost of large projects, we have stressed the need for automation to reduce the manual work of the analyst. Our experience with real size projects has taught us that the management aspects of a project are essential success factors. The management of a project comprises different aspects such as database reverse engineering explanation, cost evaluation and database reverse engineering result evaluation.

In this thesis we address several analytical and numerical problems related with the general relativistic study of black hole space-times and boson stars. We have developed a new centered finite volume method based on the flux splitting approach. The techniques for dealing with the singularity, steep gradients and apparent horizon location, are studied in the context of a single Schwarzschild black hole, in both spherically symmetric and full 3D simulations. We present an extended study of gauge instabilities related with a class of singularity avoiding slicing conditions and show that, contrary to previous claims, these instabilities are not generic for evolved gauge conditions. We developed an alternative to the current space coordinate conditions, based on a generalized Almost Killing Equation. We performed a general relativistic study regarding the long term stability of Mixed-State Boson Stars configurations and showed that they are suitable candidates for dark matter models. / En esta tesis abordamos varios problemas analíticos y numéricos relacionados con el estudio de agujeros negros relativistas y modelos de materia oscura. Hemos desarrollado un nuevo método de volúmenes finitos centrados basado en el enfoque de la división de flujo. Discutimos las técnicas para tratar con la singularidad, los gradientes abruptos y la localización del horizonte aparente en el contexto de un solo agujero negro de Schwarzschild, en simulaciones tanto con simetría esférica como completamente tridimensionales. Hemos extendido el estudio de una familia de condiciones de foliaciones evitadoras de singularidad y mostrado que ciertas inestabilidades no son genéricas para condiciones de gauge dinámicas. Desarrollamos una alternativa a las prescripciones actuales basada en una Almost Killing Equation generalizada. Hemos realizado también un estudio con respecto a la estabilidad a largo plazo de configuraciones de Mixed-State Boson Stars, el cual sugiere que estas podrían ser candidatas apropiadas para modelos de materia oscura.

Due to the increasing complexity of reactive systems, testing has become an important part in the process of the development of such systems. Conformance testing with formal methods refers to checking functional correctness, by means of testing, of a black-box system under test with respect to a formal system specification, i.e., a specification given in a language with a formal semantics. In this aspect, passive testing techniques are used when the implementation under test cannot be disturbed or the system interface is not provided. Passive testing techniques are based on the observation and verification of properties on the behavior of a system without interfering with its normal operation, it also helps to observe abnormal behavior in the implementation under test on the basis of observing any deviation from the predefined behavior. The main objective of this thesis is to present a new approach to perform passive testing based on the analysis of the control and data part of the system under test. During the last decades, many theories and tools have been developed to perform conformance testing. However, in these theories, the specifications or properties of reactive systems are often modeled by different variants of Labeled Transition Systems (LTS). However, these methodologies do not explicitly take into account the system's data, since the underlying model of LTS are not able to do that. Hence, it is mandatory to enumerate the values of the data before modeling the system. This often results in the state-space explosion problem. To overcome this limitation, we have studied a model called Input-Output Symbolic Transition Systems (IOSTS) which explicitly includes all the data of a reactive system. Many passive testing techniques consider only the control part of the system and neglect data, or are confronted with an overwhelming amount of data values to process. In our approach, we consider control and data parts by integrating the concepts of symbolic execution and we improve trace analysis by introducing trace slicing techniques. Properties are described using Input Output Symbolic Transition Systems (IOSTSs) and we illustrate in our approach how they can be tested on real execution traces optimizing the trace analysis. These properties can be designed to test the functional conformance of a protocol as well as security properties. In addition to the theoretical approach, we have developed a software tool that implements the algorithms presented in this paper. Finally, as a proof of concept of our approach and tool we have applied the techniques to two real-life case studies: the SIP and Bluetooth protocol

Software obfuscation is a protection technique for making code unintelligible to automated program comprehension and analysis tools. It works by performing semantic preserving transformations such that the difficulty of automatically extracting the computational logic out of code is increased. Obfuscating transforms in existing literature have been designed with the ambitious goal of being resilient against all possible reverse engineering attacks. Even though some of the constructions are based on intractable computational problems, we do not know, in practice, how to generate hard instances of obfuscated problems such that all forms of program analyses would fail. In this thesis, we address the problem of software protection by developing a weaker notion of obfuscation under which it is not required to guarantee an absolute blackbox security. Using this notion, we develop provably-correct obfuscating transforms using dependencies existing within program structures and indeterminacies in communication characteristics between programs in a distributed computing environment. We show how several well known static analysis tools can be used for reverse engineering obfuscating transforms that derive resilience from computationally hard problems. In particular, we restrict ourselves to one common and potent static analysis tool, the static slicer, and use it as our attack tool. We show the use of derived software engineering metrics to indicate the degree of success or failure of a slicer attack on a piece of obfuscated code. We address the issue of proving correctness of obfuscating transforms by adapting existing proof techniques for functional program refinement and communicating sequential processes. The results of this thesis could be used for future work in two ways: first, future researchers may extend our proposed techniques to design obfuscations using a wider range of dependencies that exist between dynamic program structures. Our restricted attack model using one static analysis tool can also be relaxed and obfuscations capable of withstanding a broader class of static and dynamic analysis attacks could be developed based on the same principles. Secondly, our obfuscatory strength evaluation techniques could guide anti-malware researchers in the development of tools to detect obfuscated strains of polymorphic viruses. / Whole document restricted, but available by request, use the feedback form to request access.

Software obfuscation is a protection technique for making code unintelligible to automated program comprehension and analysis tools. It works by performing semantic preserving transformations such that the difficulty of automatically extracting the computational logic out of code is increased. Obfuscating transforms in existing literature have been designed with the ambitious goal of being resilient against all possible reverse engineering attacks. Even though some of the constructions are based on intractable computational problems, we do not know, in practice, how to generate hard instances of obfuscated problems such that all forms of program analyses would fail. In this thesis, we address the problem of software protection by developing a weaker notion of obfuscation under which it is not required to guarantee an absolute blackbox security. Using this notion, we develop provably-correct obfuscating transforms using dependencies existing within program structures and indeterminacies in communication characteristics between programs in a distributed computing environment. We show how several well known static analysis tools can be used for reverse engineering obfuscating transforms that derive resilience from computationally hard problems. In particular, we restrict ourselves to one common and potent static analysis tool, the static slicer, and use it as our attack tool. We show the use of derived software engineering metrics to indicate the degree of success or failure of a slicer attack on a piece of obfuscated code. We address the issue of proving correctness of obfuscating transforms by adapting existing proof techniques for functional program refinement and communicating sequential processes. The results of this thesis could be used for future work in two ways: first, future researchers may extend our proposed techniques to design obfuscations using a wider range of dependencies that exist between dynamic program structures. Our restricted attack model using one static analysis tool can also be relaxed and obfuscations capable of withstanding a broader class of static and dynamic analysis attacks could be developed based on the same principles. Secondly, our obfuscatory strength evaluation techniques could guide anti-malware researchers in the development of tools to detect obfuscated strains of polymorphic viruses. / Whole document restricted, but available by request, use the feedback form to request access.

Software obfuscation is a protection technique for making code unintelligible to automated program comprehension and analysis tools. It works by performing semantic preserving transformations such that the difficulty of automatically extracting the computational logic out of code is increased. Obfuscating transforms in existing literature have been designed with the ambitious goal of being resilient against all possible reverse engineering attacks. Even though some of the constructions are based on intractable computational problems, we do not know, in practice, how to generate hard instances of obfuscated problems such that all forms of program analyses would fail. In this thesis, we address the problem of software protection by developing a weaker notion of obfuscation under which it is not required to guarantee an absolute blackbox security. Using this notion, we develop provably-correct obfuscating transforms using dependencies existing within program structures and indeterminacies in communication characteristics between programs in a distributed computing environment. We show how several well known static analysis tools can be used for reverse engineering obfuscating transforms that derive resilience from computationally hard problems. In particular, we restrict ourselves to one common and potent static analysis tool, the static slicer, and use it as our attack tool. We show the use of derived software engineering metrics to indicate the degree of success or failure of a slicer attack on a piece of obfuscated code. We address the issue of proving correctness of obfuscating transforms by adapting existing proof techniques for functional program refinement and communicating sequential processes. The results of this thesis could be used for future work in two ways: first, future researchers may extend our proposed techniques to design obfuscations using a wider range of dependencies that exist between dynamic program structures. Our restricted attack model using one static analysis tool can also be relaxed and obfuscations capable of withstanding a broader class of static and dynamic analysis attacks could be developed based on the same principles. Secondly, our obfuscatory strength evaluation techniques could guide anti-malware researchers in the development of tools to detect obfuscated strains of polymorphic viruses. / Whole document restricted, but available by request, use the feedback form to request access.

Software obfuscation is a protection technique for making code unintelligible to automated program comprehension and analysis tools. It works by performing semantic preserving transformations such that the difficulty of automatically extracting the computational logic out of code is increased. Obfuscating transforms in existing literature have been designed with the ambitious goal of being resilient against all possible reverse engineering attacks. Even though some of the constructions are based on intractable computational problems, we do not know, in practice, how to generate hard instances of obfuscated problems such that all forms of program analyses would fail. In this thesis, we address the problem of software protection by developing a weaker notion of obfuscation under which it is not required to guarantee an absolute blackbox security. Using this notion, we develop provably-correct obfuscating transforms using dependencies existing within program structures and indeterminacies in communication characteristics between programs in a distributed computing environment. We show how several well known static analysis tools can be used for reverse engineering obfuscating transforms that derive resilience from computationally hard problems. In particular, we restrict ourselves to one common and potent static analysis tool, the static slicer, and use it as our attack tool. We show the use of derived software engineering metrics to indicate the degree of success or failure of a slicer attack on a piece of obfuscated code. We address the issue of proving correctness of obfuscating transforms by adapting existing proof techniques for functional program refinement and communicating sequential processes. The results of this thesis could be used for future work in two ways: first, future researchers may extend our proposed techniques to design obfuscations using a wider range of dependencies that exist between dynamic program structures. Our restricted attack model using one static analysis tool can also be relaxed and obfuscations capable of withstanding a broader class of static and dynamic analysis attacks could be developed based on the same principles. Secondly, our obfuscatory strength evaluation techniques could guide anti-malware researchers in the development of tools to detect obfuscated strains of polymorphic viruses. / Whole document restricted, but available by request, use the feedback form to request access.

A program slice consists of a subset of the statements of a program that can potentially affect values computed at some point of interest. Such a point of interest along with a set of variables is called a slicing criterion. Slicing tools are useful for several applications, such as program understanding, testing, program integration, and so forth. Slicing object oriented programs has some special problems that need to be addressed due to features like inheritance, polymorphism and dynamic binding. Alias analysis is important for precision of slices. In this thesis we implement a slicing tool for sequential Java programs in the Soot framework. Soot is a front-end for Java developed at McGill University and it provides several forms of intermediate code. We have integrated the slicer into the framework. We also propose an improved technique for intraprocedural points-to analysis. We have implemented this technique and compare the results of the analysis with those for a flow-insensitive scheme in Soot. Performance results of the slicer are reported for several benchmarks.

Pour l'étude d'une structure solide ou d'un matériau, l'analyse expérimentale permet d'obtenir des grandeurs mécaniques qui permettent de comprendre leurs comportements ou encore de valider des résultats issus d'une simulation numérique. Ces grandeurs peuvent être de différentes natures (contraintes, déformations...) et être localisées de différentes manières dans l'espace (2D, 3D) et dans le temps (statique, dynamique). Le bilan des techniques actuelles d'analyse expérimentale en mécanique des solides révèle un besoin concernant l'acquisition d'une structure en tous points avec une résolution élevée à la fois spatialement et temporellement. L'objectif des travaux menés au cours de cette thèse est le développement d'une nouvelle technique d'acquisition capable d'acquérir un volume de matière de quelques centimètres de côté en moins d'une seconde avec une précision spatiale inférieure à 0.1mm. Les volumes obtenus doivent avoir une qualité suffisamment élevée pour être couplés à la technique de Corrélation d'Images Volumiques (DVC) permettant d'obtenir les déplacements ainsi que le tenseur des déformations de Green-Lagrange complet au coeur de la matière. Un nouveau procédé d'acquisition baptisé Optical Rotating Scanning Tomography (ORST) et basé sur le découpage optique a été développé. Après l'avoir décrit mathématiquement, un système spécifique synchronisé avec une caméra rapide a été conçu. La méthode a été appliquée sur deux essais mécaniques : traction continue et contact entre un galet roulant et un bloc. L'analyse des résultats a montré que l'ORST est capable d'analyser l'évolution des champs de déformations à la fois au coeur du volume et résolue en temps. / To study of a solid structure or a material, an experimental analysis can be used to get mechanical fields in order to understand the mechanical behaviour or to validate simulation results. Different kind of fields can be obtained (stress, strain) in different spatial (2D, 3D) or temporal referential (static, dynamic). Current techniques are not able to acquire the whole volume of a structure with a high spatial and temporal resolution. The objective of this work is to develop a new volume acquisition technique able to capture a volume with a characteristic edge size of several centimetres in less than 1 second with a spatial accuracy less than 0.1mm. Reconstructed volumes need to have a good quality to be used with the Digital Volume Correlation (DVC) in order to provide displacement fields and the full Green-Lagrange tensor in the whole volume. A new acquisition technique called Optical Rotating Scanning Tomography (ORST) based on the optical scanning technique has been developed. A mathematical description has been achieved and then a special device has been manufactured. This device is synchronized with a high speed CCD camera in order to perform time-resolved acquisition. This new technique has been used to study two mechanical tests. The first is a traction test with a continuous loading, and the second concerns a wheel rolling over a solid bloc. Experimental results of these applications show that ORST technique is able to analyse displacement and strain fields in the whole volume and in a time-resolved way.