Academic literature on the topic 'Vérification de programmes et de modèles'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Vérification de programmes et de modèles.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Vérification de programmes et de modèles":
Simmonds, Anne L. "Le rôle de l'aumônier lors d'une prise de décision bioéthique." Healthcare Management Forum 7, no. 4 (December 1994): 11–17. http://dx.doi.org/10.1016/s0840-4704(10)61073-3.
Grimmett, Peter P. "Neoliberalism as a Prevailing Force on the Conditions of Teacher Education in Canada." Alberta Journal of Educational Research 64, no. 4 (March 7, 2019): 346–63. http://dx.doi.org/10.55016/ojs/ajer.v64i4.56347.
Gauthier, Yvon. "Vérité et vérification en logique mathématique et dans les théories physiques." Articles 9, no. 1 (January 9, 2007): 135–45. http://dx.doi.org/10.7202/203186ar.
Torres, Lucile, and Claudia Frydman. "Vérification et validation de modèles CommonKADS par réseaux de Petri." Revue d'intelligence artificielle 15, no. 2 (June 15, 2001): 247–76. http://dx.doi.org/10.3166/ria.15.247-276.
Gillet, Roland. "Efficience informationnelle du marché boursier: vérification empirique et implications théoriques." Recherches économiques de Louvain 57, no. 3 (1991): 297–308. http://dx.doi.org/10.1017/s0770451800031778.
Rougier, Éric. "Croissance démographique, capital humain et technologie : un modèle de croissance endogène «simonien» appliqué aux pays en développement." Économie appliquée 53, no. 4 (2000): 31–59. http://dx.doi.org/10.3406/ecoap.2000.1741.
Jellad, Asma. "Identification des propriétés élastoplastiques des films minces de CrN en utilisant la technique de nanoindentation et la modélisation par éléments finis (FEM)." Matériaux & Techniques 111, no. 4 (2023): 403. http://dx.doi.org/10.1051/mattech/2023029.
Cafiau, Sybille, Patrick Girard, Laurent Guittet, and Xavier Blanc. "Vérification de cohérence entre modèles de tâches et de dialogue en conception centrée-utilisateur." Ingénierie des systèmes d'information 16, no. 5 (October 30, 2011): 9–41. http://dx.doi.org/10.3166/isi.16.5.9-41.
Bourgeois, Pascale, and Arianne Robichaud. "La figure de l’enseignant intellectuel chez Hannah Arendt." Éthique en éducation et en formation, no. 5 (October 9, 2018): 39–54. http://dx.doi.org/10.7202/1052442ar.
Test, Mary Ann. "Modèles de traitement dans la communauté pour adultes ayant des maladies mentales graves et persistantes." Dossier : Le suivi communautaire 23, no. 2 (September 11, 2007): 119–47. http://dx.doi.org/10.7202/032456ar.
Dissertations / Theses on the topic "Vérification de programmes et de modèles":
Sellami, Yanis. "Raisonnement abductif modulo des théories et application à la vérification de programmes." Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALM018.
This thesis introduces a generic method to compute the prime implicates of a logical formula, i.e., the most general clausal consequences of a given logical formula, in any given decidable theory. The principle used is to recursively add to an initially empty set, literals taken from a preselected set of hypotheses until it can be proven that the disjunction of these literals is a consequence of the formula under consideration. Proofs of the termination, correctness and completeness of this algorithm are provided, which ensures that the clauses the method computes are indeed implicates and that all the prime implicates that can be constructed from the initial set are indeed returned. This algorithm is then applied in the context of program verification, in which it is used to generate loop invariants that permit to verify assertions on programs. The Abdulot framework, a C++ implementation of the system, is also introduced. Technical considerations required for the design of such systems are detailed, such as their insertion within a well-furnished ecosystem of provers and SMT-Solvers. This implemented framework will be used to perform an experimental evaluation of the method and will show its practical relevance, as it can be used to solve a large scope of problems.This thesis also presents introductory work on an implicant minimizer and applies it in the context of separation logic. The method described in this part could also be used to perform bi-abduction in separation logic, with an algorithm that is described but has not been implemented
Sangnier, Arnaud. "Vérification de systèmes avec compteurs et pointeurs." Cachan, Ecole normale supérieure, 2008. http://www.theses.fr/2008DENS0051.
In the past years, formal methods have shown to be a succesfull approach to ensure that the behavior of an informatic system will respect some properties. Among the different existing techniques, model-checking have been recently studied and successfully applied to a lot of models like counter systems, lossy channel systems, pushdown automata, timed automata, etc. In this thesis, we consider two different models to verify programs which manipulate integer variables and pointer variables. In a first part, we deal with counter systems. We define the model and the different restrictions which have been proposed. We then introduce a restricted class of counter systems, called the reversal-bounded counter machines, for which many reachability problems are decidable. We show that this class can be extended keeping the decidability results and we prove that we can decide whether a Vector Addition System with States is reversal-bounded or not, which is not possible for general counter systems. We then study the problem of model-checking counter systems with different temporal logics. The temporal logics we consider allow to speak about the data manipulated by the system. In particular, we show that the model-checking of deterministic one-counter automata with formulae of LTL with registers is decidable, and becomes undecidable when considering non deterministic one-counter automata and two counter automata. In a second part, we introduce the model of pointer systems, which is used to represent programs manipulating single linked lists. We propose an algorithm to translate any pointer system into a bisimilar counter system. This allows us to reuse existing techniques over counter systems to analyze these programs. We then propose an extension of CTL* to verify temporal properties for such programs, and we study the decidability of the model-checking problem for this new logic. Finally we present the tool TOPICS (Translation of Programs Into Counter Systems) which translates a C-like program with pointers and integer variables into a counter system
Blanchard, Allan. "Aide à la vérification de programmes concurrents par transformation de code et de spécifications." Thesis, Orléans, 2016. http://www.theses.fr/2016ORLE2073/document.
Formal verification of concurrent programs is a hard task. There exists different methods to perform such a task, but very few are applied to the verification of programs written using real life programming languages. On the other side, formal verification of sequential programs is successfully applied for many years, and allows to get high confidence in our systems. As an alternative to dedicated concurrent program analyses, we propose a method to transform concurrent programs into sequential ones to make them analyzable by tools dedicated to sequential programs. This work takes place within the analysis framework FRAMA-C, dedicated to the analysis of C code specified with ACSL. The different analyses provided by FRAMA-C are plugins to the framework, which are currently mostly dedicated to sequential programs. We apply this method to the verification of a concurrent code taken from an hypervisor. We describe the automation of the method implemented by a new plugin to FRAMAC that allow to produce, from a specified concurrent program, an equivalent specified sequential program. We present the basis of a formalization of the method with the objective to prove its validity. This validity is admissible only for the class of sequentially consistent programs. So, we finally propose a prototype of constraint solver for weak memory models, which is able to determine whether a program is in this class or not, depending on the targeted hardware
Jahier, Erwan. "Analyse dynamique de programme : Mise en oeuvre automatisée d'analyseurs performants et spécifications de modèles d'exécution." Rennes, INSA, 2000. http://www.theses.fr/2000ISAR0009.
Several studies show that most of the software production cost is spent during the maintenance phase. During that phase, to locate bugs, to optimize programs, or to add new functionalities, it is essential to understand programs, and in particular to understand their runtime behavior. Dynamic analysis tools such as debuggers, profilers, or monitors, are very useful in that respect. However, such tools are expensive to implement because: (1) it generally requires to modify the compiling system, which is tedious and not always possible; (2) the needs in dynamic analysis tools vary from one user to another, depending on its competence, on its experience of the programming system, and on its knowledge of the code to maintain; (3) such tools are generally difficult to reuse. It is therefore desirable that each user is able to specify easily the dynamic analyses he needs. Hence, we propose an architecture that eases dynamic analysis tools implementation. This architecture is based on: (1) a systematic instrumentation of the program which gives a detailed image of the execution, the trace; (2) a set of trace processing primitives that lets one analyse the trace efficiently. The resulting analysers have performance of the same order of magnitude that their equivalent implemented ``by hand'' by modifying the compiling system. They can be implemented by programmers without any knowledge of the compiling system. This architecture let them implement the tools they need, adapted to their level of comprehension of the code they are in charge to maintain. Furthermore, the modular structure of the proposed architecture should ease the analysers reuse. This work has been held within the context of the logical and functional programming language Mercury. However, the concepts we used do not depend on the programming paradigm. The trace on which we base the implementation of our dynamic analysis tools should reflect as much as possible the runtime behavior of programs. Therefore, we also propose a framework to specify execution traces. This framework is based on an operational semantics of the language to analyse. Such formal specifications of the trace let us experimentally validate tracers, and prove their correctness. This work have been held within the context of the logical programming language Prolog
Bobot, François. "Logique de séparation et vérification déductive." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00652508.
Fernandes, Pires Anthony. "Amélioration des processus de vérification de programmes par combinaison des méthodes formelles avec l’Ingénierie Dirigée par les Modèles." Thesis, Toulouse, ISAE, 2014. http://www.theses.fr/2014ESAE0023/document.
During software development, and more specifically embedded avionics applications development, verification is very expensive. A promising lead to reduce its costs is the use of formal methods. Formal methods are mathematical techniques which allow performing rigorous and high-valued verification tasks during software development. They are already applied in industry. However, the high level of expertise required for their use is a major obstacle for their massive use. In addition to the verification costs issue, today software and their development are subject to an increase in complexity. Model Driven Engineering (MDE) allows dealing with these difficulties by offering models, and tasks to capitalize on these models all along the development lifecycle. The goal of this PhD thesis is to establish a link between formal methods and MDE in order to propose to non-expert users a formal and automatic software verification approach which helps to improve software verification processes. We propose to automatically generate annotations, corresponding to the expected behavioural properties of the software, from the design model to the source code. Then, these annotations can be verified using deductive proof tools in order to ensure that the behaviour of the code conforms to the design model. This PhD thesis takes place in the industrial context of Atos. So, it is necessary to take into account its technical specificities. We use UML for the design modeling, the C language for the software implementation and the Frama-C tool for the proof of this implementation. We also take into account the constraints of the avionics field in which Atos intervenes, and specifically the certification constraints. The contributions of this PhD thesis are the definition of a subset of UML state machine dedicated to the behavioural design of embedded avionics software and in line with current industrial practices, the definition of a C implementation pattern, the definition of generation patterns for the behavioural properties from the design model to the source code and the implementation of the whole approach in a prototype in accordance with the working environment of the potential users associated with Atos. The proposed approach is then assessed with respect to the starting goal of the thesis, to the expectation of the software engineering community and to related work
Bardou, Romain. "Vérification de programmes avec pointeurs à l'aide de régions et de permissions." Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112220/document.
Deductive verification consists in annotating programs by a specification, i.e. logic formulas which describe the behavior of the program, and prove that programs verify their specification. Tools such as the Why platform take a program and its specification as input and compute logic formulas such that, if they are valid, the program verifies its specification. These logic formulas can be proven automatically or using proof assistants.When a program is written in a language supporting pointer aliasing, i.e. if several variables may denote the same memory cell, then reasoning about the program becomes particularly tricky. It is necessary to specify which pointers may or may not be equal. Invariants of data structures, in particular, are harder to maintain.This thesis proposes a type system which allows to structure the heap in a modular fashion in order to control pointer aliases and data invariants. It is based on the notions of region and permission. Programs are then translated to Why such that pointers are separated as best as possible, to facilitate reasoning. This thesis also proposes an inference mechanism to alleviate the need to write region operations introduced by the language. A model is introduced to describe the semantics of the language and prove its safety. In particular, it is proven that if the type of a pointer tells that its invariant holds, then this invariant indeed holds in the model. This work has been implemented as a tool named Capucine. Several examples have been written to illustrate the language, and where verified using Capucine
Bardou, Romain. "Verification de programmes avec pointeurs a l'aide de regions et de permissions." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00647331.
Clouet, Myriam. "Langage de spécification et outil de vérification pour le consentement et la nécessité des données fondés sur une classification relative au respect de la vie privée." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG023.
Privacy is a fundamental right implemented in many laws around the world. Therefore, verifying that a system complies with privacy is crucial. However, privacy is also a complex notion. Besides, ensuring compliance of a software system with respect to privacy requires to verify that the expected privacy properties hold during the whole system lifecycle. It usually involves different abstraction levels, which complicates the verification process. Many different solutions have been proposed to enhance privacy. It is often quite hard to precisely identify whether they target the same problem.This thesis addresses these issues by proposing a way to classify privacy papers and an approach to verify privacy properties at two different development stages. It proposes GePyR, a new generic and specializable representation, and an instantiable ontology, PyCO, that models key privacy elements and their relationships. This classification is evaluated on the literature, by using a Systematic Mapping Study. This thesis also formalizes two privacy properties, purpose compliance and necessity compliance. It proposes a new specification language, named CSpeL, that allows engineers to formally specify key system elements with regards to these properties, and introduces a new tool, CASTT, to verify the aforementioned properties on execution traces, on a model or on a program. This approach is applied on two use cases, both at two abstraction levels (model and code), in order to evaluate its correctness, its efficiency and its usefulness
Ngo, Van Chan. "Vérification Formelle d'un Compilateur Synchrone: de Signal vers C." Phd thesis, Université Rennes 1, 2014. http://tel.archives-ouvertes.fr/tel-01058041.
Books on the topic "Vérification de programmes et de modèles":
Backhouse, Roland C. Construction et vérification de programmes. Paris: Masson, 1989.
Ohia, Nwabueze. Audit de Vos Systèmes d'information et de Votre Infrastructure Informatique: Programmes de Vérification Pratiques/Listes de Contrôle Pour les Auditeurs Internes. Independently Published, 2018.
Book chapters on the topic "Vérification de programmes et de modèles":
PAULEVÉ, Loïc. "Réseaux booléens : formalisme, sémantiques et complexité." In Approches symboliques de la modélisation et de l’analyse des systèmes biologiques, 163–200. ISTE Group, 2022. http://dx.doi.org/10.51926/iste.9029.ch5.
"Modèles d’enseignement créatif intégrables aux programmes scolaires." In Pour une pédagogie active et créative, 137–56. Presses de l'Université du Québec, 2011. http://dx.doi.org/10.2307/j.ctv18ph1wj.10.
Alain, Marc. "Des systèmes de classification des modèles d’évaluation de programmes d’intervention psychosociale à une proposition de modèle intégrateur." In Élaborer et évaluer les programmes d'intervention psychosociale, 9–28. Presses de l'Université du Québec, 2009. http://dx.doi.org/10.2307/j.ctv18ph454.4.
Alain, Marc. "Des systèmes de classification des modèles d’évaluation de programmes d’intervention psychosociale à une proposition de modèle intégrateur." In Élaborer et évaluer les programmes d'intervention psychosociale, 9–28. Presses de l'Université du Québec, 2009. http://dx.doi.org/10.1515/9782760523470-002.
Nader-Grosbois, Nathalie. "Chapitre 5. Évaluation et intervention précoce et préscolaire à l’égard des parents : modèles, outils et programmes." In Psychologie du handicap, 135–64. De Boeck Supérieur, 2020. http://dx.doi.org/10.3917/dbu.nader.2020.01.0135.
Nader-Grosbois, Nathalie. "Chapitre 4. Évaluation et intervention précoce et préscolaire à l’égard de l’enfant : modèles, outils et programmes." In Psychologie du handicap, 65–133. De Boeck Supérieur, 2020. http://dx.doi.org/10.3917/dbu.nader.2020.01.0065.
Stokes, Peter, and Simon M. Smith. "Recherches sur la Sustainability." In Recherches sur la Sustainability, 158–71. EMS Editions, 2023. http://dx.doi.org/10.3917/ems.cheva.2023.01.0158.
CHAPLAIS, Christelle, and Sophie MARMORAT. "L’enseignement de la comptabilité face à l’urgence climatique." In Expériences pédagogiques depuis l'Anthropocène, 113–26. Editions des archives contemporaines, 2021. http://dx.doi.org/10.17184/eac.5391.