Tesis sobre el tema "Génération de logiciel"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Génération de logiciel".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Villeneuve, D. "Logiciel de génération de colonnes". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ53547.pdf.
Texto completoChevalley, Philippe. "Approche statistique pour le test de logiciels critiques orientés-objet : expérimentation sur un logiciel avionique". École nationale supérieure de l'aéronautique et de l'espace (Toulouse ; 1972-2007), 2001. http://www.theses.fr/2001ESAE0018.
Texto completoBertault, François. "Génération et tracé de structures décomposables". Nancy 1, 1997. http://www.theses.fr/1997NAN10297.
Texto completoThe main goal of the thesis is to conceive algorithms and tools to assist people who study a special kind of combinatorial structures, namely decomposable structures. The two major questions we try to solve are: How to generate, randomly or by some systematic procedure, a decomposable structure; How to draw decomposable structures. Decornposable structures are combinatorial structures that are recursively described using a small set of constructors. The idea consists in considering a structure as a process of construction from simpler structures. The main interest of the decomposable structure theory is that we can describe an infinite number of different sets of structures, including permutations, varions kind of trees or functional graphs, for which we can solve counting and random generation problems. Possible applications are the average case analysis of algorithms and the production of test inputs for the experimental validation of programs. We propose an algorithm for drawing decomposable structures based on the translation into special graphs, that we call composed graphs, in which bath inclusion and adjacency relationships can exist. The principle is based on the translation of decomposable structures into composed graphs, i. E. Graphs with both inclusion and adjacency relationships. The drawing of composed graph is achieved by using different classical graph drawing algorithm together. The number of algorithms that can be used on a sarne drawing is infinite. The only restriction is that the algorithms must be able to draw graphs with arbitrary node sizes. We present two graph drawing software realisations that we wrote in order to validate the algorithms presented in the thesis. They can be linked to combinatorial structure generation programs in order to form integrated systems. We also investigate their use for the visualisation of large data structures
Nebut, Clémentine. "Génération automatique de tests à partir des exigences et application aux lignes de produits logicielles". Rennes 1, 2004. http://www.theses.fr/2004REN10099.
Texto completoLe, Guennec Alain. "Génie logiciel et méthodes formelles avec UML : : spécification, validation et génération de tests". Rennes 1, 2001. http://www.theses.fr/2001REN10156.
Texto completoRibereau, Dominique. "Génération d'un logiciel de simulation de la combustion d'un bloc de propergol solide". Bordeaux 1, 1988. http://www.theses.fr/1988BOR10594.
Texto completoBelhaouari, Hakim. "Une approche intégrée pour la conception par contrat : vérification statique / dynamique et génération automatique de test". Paris 6, 2010. http://www.theses.fr/2010PA066116.
Texto completoMaïga, Cheick Ismaël. "Génération de squelettes des contrats de classes et des tests unitaires en Java". Mémoire, Université de Sherbrooke, 2016. http://hdl.handle.net/11143/9473.
Texto completoJouve, Wilfried. "Approche déclarative pour la génération de canevas logiciels dédiés à l'informatique ubiquitaire". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2009. http://tel.archives-ouvertes.fr/tel-00402605.
Texto completo– Nous proposons l'approche DIAGEN qui permet, à partir de spécifications d'architectures logicielles ubiquitaires, de générer du support de programmation et un ensemble de vérifications dédiés au développement d'applications ubiquitaires. Ces spécifications reposent sur un langage déclaratif, appelé DIASPEC, qui permet de décrire les types de services composant les applications ubiquitaires cibles. Le compilateur DIASPEC vérifie la cohérence des spécifications et génère, à partir de celles-ci, des canevas de programmation dédiés. Les canevas de programmation générés garantissent l'intégrité des communications d'applications dynamiques.
– Nous avons développé DIASIM, un simulateur pour tester à l'exécution, le comportement des applications développées avec l'approche DIAGEN. DIASIM permet de tester les applications sans les modifier et d'intégrer incrémentalement des services réels dans les scénarios de simulation.
– Nous avons montré que l'approche DIAGEN permet davantage de vérifications statiques tout en gérant la dynamicité des environnements ubiquitaires et en permettant une plus grande concision des applications développées. Nous avons analysé les canevas de programmation générés pour la gestion de réunion, l'immotique et la téléphonie.
Atat, Youssef. "Conception de haut niveau des MPSoCs à partir d'une spécification Simulink : passerelle entre la conception au niveau système et la génération d'architecture". Grenoble INPG, 2007. http://www.theses.fr/2007INPG0047.
Texto completoThe current fabrication technology allows the integration of a complex multiprocessor system on one silicon part (MPSoC for Multiprocessor System-one-Chip). A way to control the increasing complexity of these systems is to increase the abstraction level and to adopt the system level design. However, the increase of the abstraction level can make a huge gap between the system level concepts and those used for the hardware/software architecture implementation of MPSoC. The objective of this thesis is to fill the gap between the two abstractions levels by proposing an efficient bridge between the algorithms development aid tools (Matlab\Simulink) and the architectures design tools (ROSES and macro-Cell builder). This is accomplished: - By defining a transactional model in the Simulink environment. This intermediate model combines algorithm and architecture. It allows the early definition of the implementation platform and establishes continuity between the functional model and the architectural model. - By automating the passage between the system level and the architectural level, to accelerate the MPSoCs design procedure and to reduce the errors quantity caused by manual design in a unified environment. The relevance of this work was evaluated by its application to the MP3 decoder design presented in this memory
Fiandino, Maxime. "Exploration d'architectures basée sur la génération automatique de plates-formes matérielles et le portage rapide du logiciel". Grenoble INPG, 2007. http://www.theses.fr/2007INPG0053.
Texto completoThe proposed approach is an iterative flow in three steps. The first one is the fast development and modification of the architecture executable model. The second one is the adaptation of the embedded software. The third one is the hardware and software architecture exploration. A tool has been developed in order to create and modify quickly a hardware architecture model. It uses flexible sub-systems. One method in order to adapt the embedded software is exposed, it includes: to manually add some parameterization in the software, an automatic extraction of the architecture characteristics, the generation of the low level code sources. To finish a method allow to simulate processors at different level of simulation with their embedded software, high level for fast simulation, low level for performance measurements. Following results, hardware and software are modified and the flow can restart. This flow was tested on a real application, a parallelized H264 encoder
Megzari, Karim. "Refiner : environnement logiciel pour le raffinement d'architectures logicielles fondé sur une logique de réécriture". Chambéry, 2004. http://www.theses.fr/2004CHAMS039.
Texto completoIn this thesis, we werre interested in the problems involved in the insufficiency of the software support for refinement of software architectures. Indeed, the titles of architecture description languages (ADL) like SADL and Rapide which tackle these problems make it in a very restricted way, although they support multiple levels of abstraction. Our contribution consists of the supply of the software environment which we named refiner based on the rewriting logics. The choice of the latter is justified by the fact that it is well adapted to the description of concurrent systems, thier refinement by the mechanism of rewriting and also by the fact that it is well supported by software tools. We built it around the architecture refinement language ArchWare ARL. The Refiner allows its users : - to refine architectural elements gradually (component, connectors, ports, etc. ) since abstract descriptions towards concrete descriptions, and this through multiple levels of abstraction. With each step of refinement, an action can be applied which provides by construction, under certain obligations of proofs, a correct architectural tranformation. - to refine more than the structure and the behavior of an architectural element. - to built during a step of refinement, as well a more concrete architectural description translating a possible architecture than a simplified description tranlating a reduced architecture. - to support, at the most concrete level of architectural refinement, the generation of the applications in programming languages target. This is done by the means of the Sigma generator of applications based on the concepts of mapping and patterns of synthesis. Consequently, the Refiner supprot proposed allows to the architects to refine correctly architectural elements, then to recompose the refined elements for the construction of concrete architectures
Du, Bousquet Lydie. "Contributions à l'automatisation raisonnée de différents processus du test logiciel". Habilitation à diriger des recherches, Université de Grenoble, 2010. http://tel.archives-ouvertes.fr/tel-01005528.
Texto completoWarth, Valérie. "Conception et développement d'un logiciel de génération de mécanismes réactionnels d'oxydation et de combustion de substances organiques". Vandoeuvre-les-Nancy, INPL, 1999. http://www.theses.fr/1999INPL087N.
Texto completoThis thesis deals with the development of a software for the generation of combustion and oxidation mechanisms of organic compounds (alkanes, cyclanes, and ethers) found in gasoline and diesel fuel. One of the main aims of this study is to predict the emission of pollutants by internai combustion engines. The software is made of the following items : a database of small species (Co-C2) reactions, a comprehensive primary mechanism generator, a lumped secondary mechanism generator and two data generators : a first one of thermodynamic data and a second one of kinetic data. Generated reaction models are compatible with CHEMKIN II package from SANDIA laboratories, USA, for the analysis of gas phase chemical kinetics. The generated mechanisms can be interactively validated thanks to CHEMKIN by comparison with experimental results. Moreover, another software has been developed and validated for reducing these detailed mechanisms. A non ~anonical external repre~entation of chemical reactants is transformed into a canonical internai representation through a compiler and two canoniêity algorithms. The mechanisms are generated by applying algorithrns implementing elementary chemical reactions to internai chemical structures. Completeness and non redundancy of the produced mechanims are ensured by, on the one hand, the canonicity of the species and, on the other hand, by creationlconsumption rules for radical species implemented via an iterative algorithm
Krimm, Jean-Pierre. "Application des ordres partiels à la génération compositionnelle de systèmes asynchrones". Université Joseph Fourier (Grenoble), 2000. http://www.theses.fr/2000GRE10243.
Texto completoGotlieb, Arnaud. "Contributions à la génération de tests à base de contraintes". Habilitation à diriger des recherches, Université Européenne de Bretagne, 2011. http://tel.archives-ouvertes.fr/tel-00699260.
Texto completoBounar, Boualem. "Génération automatique de programmes sur une base de données en réseau : couplage PROLOG-Base de données en réseau". Lyon 1, 1986. http://www.theses.fr/1986LYO11703.
Texto completoChaisemartin, Philippe. "Contribution à la génération automatique de plans de masse". Phd thesis, Grenoble 1, 1986. http://tel.archives-ouvertes.fr/tel-00322531.
Texto completoKangoye, Sékou. "Elaboration d'une approche de vérification et de validation de logiciel embarqué automobile, basée sur la génération automatique de cas de test". Thesis, Angers, 2016. http://www.theses.fr/2016ANGE0017/document.
Texto completoAn embedded system is a system that performs a specific task and has a computer embedded inside. In the automotive sector, the amount of embedded systems in the vehicle has risen dramatically in recent years and is set to increase. They deal essentially with safety, comfort, and driving assistance. Furthermore, the increase in number and complexity of the systems is associated with a growth in software. As a consequence, their management (system and software) have become more and more complex and problematic. Also, the competition and time-to-market in the automotive industry are very tough. Thus, to guarantee the efficiency and reliability of the embedded systems in the vehicle in general and the software in particular, in view of the complexity as well as the competition and time-to-market law, new development methods should be considered. Therefore, new development methods including new standards, and automatic approaches have emerged over the last years. In the particular case of embedded software verification and validation, one of the most critical activities that has experienced a significant progress is test case generation with the advent of automatic approaches. Despite this, these approaches are not widely used or are not well adapted in industrial context. In that context, our goal in this PhD. thesis is to propose a new verification and validation approach, based on automatic test case generation of embedded embedded. Thus, we have set up an approach that automatically generates test cases, with respect to the MC/DC criterion, from abstract models of the software specifications expressed in the form of state-transition models
Lbath, Ahmed. "A. I. G. L. E. : un environnement visuel pour la conception et la génération automatique d'applications géomatiques". Lyon, INSA, 1997. http://www.theses.fr/1997ISAL0048.
Texto completoThe Geographical Information Systems (GIS) applications domain is very large. Nowadays marketed GfS are closed regarding applications. Each geographical application needs specific development which is time consuming and which is dedicated to a specific GIS. Moreover, in GIS, manipulated spatial data could be complex (raster or vector). Mental model of the end-user is not considered in the method design aspect; it is not taken into account in the query language aspect. Regarding these problems no real solution exists and most of marketed GIS are still proprietary systems. Our aim is to develop a new visual CASE tool named AIGLE, capable of generating various applications on several GIS platforms. The problem of portability leads us to integrate an intermediate language into the CASE tool. This CASE tool supports, in one hand, a visual object oriented method named OMEGA, and, in the other hand, a visual query language. OMEGA is dedicated to the design and development of geographical end-user applications. This method uses a visual iconic metaphors for the representation of object classes and dynamic state diagrams. In the visual query language for GIS two important levels are defined: end-user level with iconic metaphors and technical level with graphical representation of class abject. The iconic metaphors could represent data or queries. For data, iconic metaphors should be defined in the design stage with OMEGA. The proposed visual language is translated into an intermediate query language before being generated into a specific target GIS. In order to validate our approach a prototype has been developed and an example of geographical application has been generated and marketed
Gauthier, Lovic. "Génération de système d'exploitation pour le ciblage de logiciel multitâche sur des architectures multiprocesseurs hétérogènes dans le cadre des systèmes embarqués spécifiques". Grenoble INPG, 2001. http://www.theses.fr/2001INPG0132.
Texto completoTka, Mouna. "Génération automatique de test pour les contrôleurs logiques programmables synchrones". Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM020/document.
Texto completoThis thesis work done in the context of the FUI project Minalogic Bluesky, concerns the automated functional testing of a particular class of programmable logic controllers (em4) produced by InnoVista Sensors. These are synchronous systems that are programmed by means of an integrated development environment (IDE). People who use and program these controllers are not necessarily expert programmers. The development of software applications should be as result simple and intuitive. This should also be the case for testing. Although applications defined by these users need not be very critical, it is important to test them adequately and effectively. A simulator included in the IDE allows programmers to test their programs in a way that remains informal and interactive by manually entering test data.Based on previous research in the area of synchronous test programs, we propose a new test specification language, called SPTL (Synchronous Testing Programs Language) which makes possible to simply express test scenarios that can be executed on the fly to automatically generate test input sequences. It also allows describing the environment in which the system evolves to put conditions on inputs to arrive to realistic test data and limit unnecessary ones. SPTL facilitates this testing task by introducing concepts such as user profiles, groups and categories. We have designed and developed a prototype named "Testium", which translates a SPTL program to a set of constraints used by a Prolog solver that randomly selects the test inputs. So, generating test data is based on constraint logic programming techniques.To assess this, we experimented this method on realistic and typical examples of em4 applications. Although SPTL was evaluated on EM4, its use can be envisaged for the validation of other types of synchronous controllers or systems
Valderrama, Carlos. "Prototype virtuel pour la génération des architectures mixtes logicielles-matérielles". Grenoble INPG, 1998. http://www.theses.fr/1998INPG0121.
Texto completoThe objective of this work is to develop a methodology for the generation of flexible and modular architectures for distributed systems. This approach (also called " virtual prototyping ") is an essential stage in the process of joint design (codesign) of mixed software/hardware systems. Virtual prototyping takes as input a heterogeneous architecture made up of a whole of distributed modules resulting from software/hardware partitioning. It generates executable descriptions for software and hardware elements. Research approaches in this field are justified by the evolution of technology, the urgent need for prototypes to validate the specification, and by the availability of tools and synthesis environments for the design of software and hardware parts. One of the major difficulties of virtual prototyping is that it allows at the same time to handle both, software and hardware. This work describes a strategy of virtual prototyping for the cosynthesis (generation of the modules material and software on an architectural platform) and cosimulation (i. E. The joint simulation of these two kind of components) in a unified environment, the development of a distributed and flexible cosimulation environment allowing the use of several simulation tools and languages, the generation of hardware/software synthesizable models and mono-processor architecture software generation for a set of communicating processes. This approach, presented in the ED&TC conference, got the best paper award in 1995. The tools developed during this thesis were put into practice in the Cosmos codesign environment. One of them was transferred to SGS-Thomson Microelectronics. The tools were also used for the Europeans projects COMITY (particularly used by Aerospace the Missiles in Toulouse and Intracom in Greece) and CODAC, and by other groups like the FZI of the university of Tübingen and PSA in Paris
Fellahi, Mohammed. "Des réseaux de processus cyclo-statiques à la génération de code pour le pipeline multi-dimensionnel". Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00683224.
Texto completoRémy, Pascal. "Conception et réalisation d'un processeur pour la génération d'un modèle bond-graph à partir de différentes descriptions de systèmes physiques sous le logiciel Archer". Lille 1, 1994. http://www.theses.fr/1994LIL10142.
Texto completoMischler, Éric. "Système informatique pour la génération de séquences RMN : application aux mesures d'auto-diffusion translationnelle par gradients de champ radiofréquence". Nancy 1, 1996. http://www.theses.fr/1996NAN10318.
Texto completoEnard, Quentin. "Développement d'applications logicielles sûres de fonctionnement : une approche dirigée par la conception". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00829477.
Texto completoJonquet, Clement. "Génération dynamique de service : Interactions entre agents pour l'échange de service Grid". Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2006. http://tel.archives-ouvertes.fr/tel-00115389.
Texto completoGenestier, Richard. "Vérification formelle de programmes de génération de données structurées". Thesis, Besançon, 2016. http://www.theses.fr/2016BESA2041/document.
Texto completoThe general problem of proving properties of imperative programs is undecidable. Some subproblems– restricting the languages of programs and properties – are known to be decidable. Inpractice, thanks to heuristics, program proving tools sometimes automate proofs for programs andproperties living outside of the theoretical framework of known decidability results. We illustrate thisfact by building a catalog of proofs, for similar programs and properties of increasing complexity. Mostof these programs are combinatorial map generators.Thus, this work contributes to the research fields of enumerative combinatorics and softwareengineering. We distribute a C library of bounded exhaustive generators of structured arrays, formallyspecified in ACSL and verified with the WP plugin of the Frama-C analysis platform. We also proposea testing-based methodology to assist interactive proof in Coq, an original formal study of maps, andnew results in enumerative combinatorics
Varet, Antoine. "Conception, mise en oeuvre et évaluation d'un routeur embarqué pour l'avionique de nouvelle génération". Phd thesis, INSA de Toulouse, 2013. http://tel.archives-ouvertes.fr/tel-00932283.
Texto completoNicolas, Ferry. "Formalisation des modèles de la méthode MACAO et réalisation d'un outil de génie logiciel pour la création d'interfaces homme-machine". Phd thesis, Université Paul Sabatier - Toulouse III, 2008. http://tel.archives-ouvertes.fr/tel-00647482.
Texto completoEnard, Quentin. "Développement d'applications logicielles sûres de fonctionnement: une approche dirigee par la conception". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00839298.
Texto completoHarik, Ramy. "Spécifications de fonctions pour un système d'aide à la génération automatique de gamme d'usinage : Application aux pièces aéronautiques de structure, prototype logiciel dans le cadre du projet RNTL USIQUICK". Phd thesis, Université Henri Poincaré - Nancy I, 2007. http://tel.archives-ouvertes.fr/tel-00173161.
Texto completoL'enchaînement des étapes permettant le calcul de ces fonctions est déterminé. Il comporte :
- une première étape d'enrichissement du modèle géométrique CAO,
- une deuxième étape permettant d'extraire les entités d'usinage élémentaires. Aux faces sont ainsi liées les informations technologiques suivantes : mode d'usinage, directions et outils possibles,
- une troisième étape d'analyse du graphe d'adjacence de la pièce qui détermine les faces pouvant être usinées simultanément.
Ces étapes sont implémentées en CAA® dans un démonstrateur dont la validité est présentée sur quelques exemples. Son degré de robustesse est évalué.
Les apports de ce travail sont relatifs à la notion d'entité élémentaire, d'entité de haut niveau orientée type d'usinage, de caractérisation des extrémités d'élancements et à la définition de fonctions opérateur.
Le mémoire se termine par une synthèse des fonctions qui devraient être implémentées dans le logiciel CATIA afin que le Transformateur devienne un produit industriel.
Harik, Ramy Farid. "Spécifications de fonctions pour un système d'aide à la génération automatique de gamme d'usinage : application aux pièces aéronautiques de structure, prototype logiciel dans le cadre du projet RNTL USIQUICK". Nancy 1, 2007. http://docnum.univ-lorraine.fr/public/SCD_T_2007_0077_HARIK.pdf.
Texto completoOur PhD work comes within the framework of the USIQUICK RNTL project (www. Usiquick. Com) that aims to answer the needs of some aircraft industries in the domain of structural parts manufacturing that are of an average to high complexity. Automating the manufacturing fixture, process planning and generating the NC programs are the expected results. Our contribution lies in the study of the ‘Transformer’, a module dedicated to enriching the part geometry into one that is adapted to manufacturing. The ‘Transformer’ must supply the necessary information needed by the two other USIQUICK modules: Process planning and Automatic milling path generator. The sequence of steps allowing to compute the different functions is determined. It includes: a first step during which the CAD geometrical model is enriched, a second step during which the different ‘Elementary Manufacturing Features’ are extracted. The faces composing the CAD model are completed by their: milling mode, milling directions and possible milling tools, a last step, where a face adjacency’ graph analysis is proceeded, pointing all the faces that could be milled simultaneously. These steps are implemented using CAA® in a prototype. The validity is presented in some examples. The degree of its robustness is evaluated. The main results of our PhD are: the definition of the ‘Elementary Manufacturing Feature’, high level milling features extractions, thin features identification and the CAPP functions definition. This PhD report ends with a synthesis of the functions that should be implemented in CATIA so that the ‘Transformer’ becomes an industrial product
Bedin, França Ricardo. "Processus et outils qualifiables pour le développement de systèmes critiques certifiés en avionique basés sur la génération automatique de code". Thesis, Toulouse, INPT, 2012. http://www.theses.fr/2012INPT0028.
Texto completoThe development of safety-critical avionics software, such as aircraft flight control programs, presents many different constraints that are nearly contradictory, such as performance and safety requirements, and all must be met simultaneously. The objective of this Thesis is to propose modifications in the development cycle of Airbus flight control programs in order to improve their performance without weakening their verification processes or violating other industrial constraints. The main criterion for performance evaluation is the Worst-Case Execution Time (WCET), as it is used in the timing analysis that is performed in actual avionics software verification processes. In a first moment, the DO-178, which contains guidance for avionics software development approval, is presented. Both the DO-178B and the DO-178C are discussed, since the former was the reference for the development of many Airbus flight control programs and the latter shall be the reference for the development of new programs, starting from 2012. Then, the case study is presented. In order to better understand it, some historical context is provided by the study of other flight control programs - many of its life cycle activities reuse techniques that were successful in previous software projects. Each activity is evaluated in order to underline what are the performance bottlenecks in the flight control software development. Some potential underperforming activities are depicted and the main axis of study developed subsequently is the compilation phase: not only it is a well-known unoptimized activity that has important impacts over software performance, but it is also an activity that might undergo a paradigm change due to innovating compilers that are being developed by researchers. The CompCert compiler is presented and its use in the scope of this Thesis is justified - at the time of this Thesis, it was the compiler that was best prepared to perform meaningful experiments, such as compiling a large subset of the chosen case study. Its architecture is studied, together with its semantic preservation theorem, which is the backbone of its formally-verified part. Additional features that were developed in CompCert during this Thesis in order to meet Airbus's requirements - such as its annotation mechanism and its reference interpreter - are discussed in order to underline their usefulness in the development of flight control software. The evaluation of CompCert consists in a performance comparison with the current compilation strategy and an assessment of the impacts that its utilization might have over the verification strategy commonly employed in flight control software. The results of the performance comparison are promising, since CompCert-generated code has a WCET more than 10% lower than if it were compiled with a good quality non-optimizing compiler. As expected, the use of CompCert has impacts over some important verification activities but its formal development and increased verifiability helps in the development of new compiler verification activities that can keep the whole development process at least as safe as the current one. Some development strategy propositions are then presented, according to the certification credit that might be required by using CompCert
Broult, Christophe. "LPV, une nouvelle technologie de validation du logiciel basée sur la programmation linéaire : application informelle "en éclaireur" à la génération de scénarios de test non triviaux pour les cartes à microprocesseur". Caen, 1999. http://www.theses.fr/1999CAEN2074.
Texto completoVoiron, Guillaume. "Exploration concrétisée et pertinente de systèmes d'événements abstraits en vue de la génération automatique de tests". Thesis, Bourgogne Franche-Comté, 2019. http://www.theses.fr/2019UBFCD027.
Texto completoThe 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
Benhima, Abderrahim. "Contribution à l'optimisation dynamique de mouvements de robots-manipulateurs avec génération automatique des équations du problème optimal". Poitiers, 1989. http://www.theses.fr/1989POIT2278.
Texto completoCabrera, Castillos Kalou. "Génération automatique de scénarios de tests à partir de propriétés temporelles et de modèles comportementaux". Phd thesis, Université de Franche-Comté, 2013. http://tel.archives-ouvertes.fr/tel-00924485.
Texto completoMoneimne, Walid. "TAO vers l'arabe : spécification d'une génération standard de l'arabe ; réalisation d'un prototype anglais-arabe à partir d'un analyseur existant". Grenoble 1, 1989. http://www.theses.fr/1989GRE10061.
Texto completoDolques, Xavier. "Génération de Transformations de Modèles : une approche basée sur les treillis de Galois". Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2010. http://tel.archives-ouvertes.fr/tel-00916856.
Texto completoMolinari, Isabelle. "Test de génération de thrombine sur ACL7000 (développement d'un programme de traitement des données sur Microsoft Excel et éléments d'analyse de l'intérêt du test dans les états d'hypercoagulabilité)". Bordeaux 2, 1999. http://www.theses.fr/1999BOR23102.
Texto completoDia, Cheikh Tidiane. "Génération de modeles compacts thermiques dynamiques de composants electroniques via les algorithmes genetiques". Thesis, Paris 10, 2015. http://www.theses.fr/2015PA100172/document.
Texto completoThis thesis is dedicated to the generation of behavioral thermal model for electronic component having multiple active sensitive chips. This innovative study focuses on the necessary improvements of the concept of steady-state and dynamic compact model in order to elaborate pertinent and accurate modeling practical techniques. To help the electronic designer to early identify the overheated electronic components, the purpose is to generate simplified models, capable to mimic the thermal behavior of sophisticated detailed models. These simplified or compact models using well-known thermal resistances network replicate the thermal path from the most sensitive elements to the external package surfaces and enable to accurately predict their temperatures as well as the case heat flow rates. Preliminary evaluations performed on the popular, plastic Quad Flat-pack No lead package family showed that the simplest network definition, restricted to the heating source and two external surfaces, is always insufficient to properly characterize the thermal response of real device. So our development of steady-state compact thermal model (CTM) for electronic component is based on a process flow defined by the European project DELPHI which was revised by the presented work to address multi-chip components. DELPHI style compact thermal model presents an enlarged node number, especially for the component external surfaces which are divided in a set of relevant areas
Baudon, Olivier. "Cabri-graphes : un cahier de brouillon interactif pour la théorie des graphes". Phd thesis, Université de Grenoble, 1990. http://tel.archives-ouvertes.fr/tel-00648847.
Texto completoParissis, Ioannis. "Test de logiciels synchrones spécifiés en Lustre". Phd thesis, Université Joseph Fourier (Grenoble), 1996. http://tel.archives-ouvertes.fr/tel-00005010.
Texto completoAzem, Sadia. "Ordonnancement des systemes flexibles de production sous contraintes de disponibilite des ressources". Phd thesis, Ecole Nationale Supérieure des Mines de Saint-Etienne, 2010. http://tel.archives-ouvertes.fr/tel-00611830.
Texto completoChevalier, Fanny. "Reconnaissance de motifs dans des graphes : heuristique et applications". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2007. http://tel.archives-ouvertes.fr/tel-00286214.
Texto completoTarby, Jean-Claude. "Gestion Automatique du Dialogue Homme-Machine à partir de Spécifications Conceptuelles". Phd thesis, Université des Sciences Sociales - Toulouse I, 1993. http://tel.archives-ouvertes.fr/tel-00174589.
Texto completoLe travail présenté est basé sur la méthode Diane+ conçue initialement pour la spécification du dialogue homme-machine. Diane+ repose sur la planification hiérarchique et intègre le niveau de l'utilisateur. Elle est utilisée pour spécifier la répartition des tâches entre l'homme et la machine tout en laissant une latitude décisionnelle à l'utilisateur. Cette spécification utilise un formalisme simple et concis prenant en compte les répartitions les plus complexes. Ce formalisme permet, à partir des spécifications, de :
• générer l'interface homme-machine en intégrant des règles d'ergonomie générale,
• générer une partie du code des traitements,
• gérer automatiquement la dynamique de l'application (noyau fonctionnel et interface homme-machine),
• gérer automatiquement l'aide d'utilisation, l'aide fonctionnelle étant quant à elle implémentée par le concepteur.
De par les origines de Diane+ et les caractéristiques des IHM, ce travail utilise conjointement le modèle tâche et le modèle objet.
Lasalle, Jonathan. "Génération automatique de tests à partir de modèles SysML pour la validation fonctionnelle de systèmes embarqués". Phd thesis, Université de Franche-Comté, 2012. http://tel.archives-ouvertes.fr/tel-00762053.
Texto completoNiang, Boubou Thiam. "A Model-Driven Engineering and Software Product Line Approach to Support Interoperability in Systems of Information Systems". Electronic Thesis or Diss., Lyon 2, 2024. http://www.theses.fr/2024LYO20005.
Texto completoModern information systems consist of various components that require seamless communication and coordination. Organizations face difficulties adapting to dynamic changes while engaging with diverse industry partners. The challenge arises from the fact that interoperability mechanisms are often created manually and in an ad hoc manner. These mechanisms must be reusable to avoid time-consuming and error-prone processes in an ever-changing environment. The lack of reusability is because interoperability mechanisms are often integrated into business logic components, which creates a strong coupling between components, making maintenance difficult without affecting the overall operation of the system.Berger-Levrault, our industrial partner, primarily serves public institutions. The company actively maintains interoperability, especially in the context of frequent reforms in the local public sector. In addition, companies have grown through acquisitions, resulting in a diverse range of legacy applications with variations in language, architecture, norms, and industry standards. The primary goal is to create an adaptable interoperability solution that facilitates seamless communication between the components of the information system and the external environment. Challenges include adapting to changing rules and standards, managing variable data volumes, and integrating connected objects within public institutions.This thesis examines data exchange flows between constituents and systems, analyzes their characteristics and requirements, and proposes cost-effective approaches for implementing and evolving interoperability mechanisms while minimizing the impact on overall information system operations. The methodology adopted begins with a reified vision of interoperability mechanisms, where exchange mechanisms are extracted from the business logic constituents and considered first-class constituents called interoperability connectors. To achieve this, reverse engineering extracts functionality from existing interoperability mechanisms and reifies it as a tangible constituent, the connector, within the information system. For the analysis, we create a repository comprising projects selected transparently, guaranteeing a minimal number of projects, and covering all the Enterprise Integration Patterns from different sources. The proposed metamodel confirms and validates this reification regarding completeness and extensibility. The completeness of the connector metamodel is validated through a well-defined process, while another process guarantees the metamodel's extensibility. The extensible metamodel reveals connectors as common entities, leading to the ConPL approach, a software product line framework adapted to connectors. The PhaDOP tool was utilized to implement this approach, and a proof-of-concept was demonstrated with a specific use case. Performance tests were conducted on the proposed connector representation structure. The ConPL framework is validated through an industrial use case