Literatura científica selecionada sobre o tema "Programmation certifiée"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Programmation certifiée".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Programmation certifiée"
Potteiger, Kelly, e Andrew Lundgren. "Using an Audience Response System to Prepare Athletic Training Students for the Board of Certification Exam". Athletic Training Education Journal 7, n.º 4 (1 de outubro de 2012): 198–204. http://dx.doi.org/10.4085/0704198.
Texto completo da fonteSciarappa, William, Sridhar Polavarapu, James Barry, Peter Oudemans, Mark Ehlenfeldt, Gary Pavlis, Dean Polk e Robert Holdcraft. "Developing an Organic Production System for Highbush Blueberry". HortScience 43, n.º 1 (fevereiro de 2008): 51–57. http://dx.doi.org/10.21273/hortsci.43.1.51.
Texto completo da fonteWu, Eugenia, Olga Arsovska, Monita Sundar, Michaela Vivar, Christopher Pang, Maria Spillane, Lindsay Hedden, Larry Goldenberg e Celestia S. Higano. "Four-year overview of enrollment and participation in research studies conducted at the Prostate Cancer Supportive Care (PCSC) Program." Journal of Clinical Oncology 37, n.º 31_suppl (1 de novembro de 2019): 39. http://dx.doi.org/10.1200/jco.2019.37.31_suppl.39.
Texto completo da fonteGessel, Chyrsten L., Stephanie M. Singe e Heidi M. Crocker. "An Exploratory Case Study: Examining the Design of Clinical Immersion from the Preceptors’ Perspective". Athletic Training Education Journal 19, n.º 1 (1 de janeiro de 2024): 62–69. http://dx.doi.org/10.4085/1947-380x-22-072.
Texto completo da fonteChoko, Augustine T., Thomas J. Coates, Misheck Mphande, Kelvin Balakasi, Isabella Robson, Khumbo Phiri, Sam Phiri et al. "Engaging men through HIV self-testing with differentiated care to improve ART initiation and viral suppression among men in Malawi (ENGAGE): A study protocol for a randomized control trial". PLOS ONE 18, n.º 2 (24 de fevereiro de 2023): e0281472. http://dx.doi.org/10.1371/journal.pone.0281472.
Texto completo da fonteKrug, Aaron, Lucas Ramirez, Heng Nhoung, Joshua Perese, Gregory Gasparian, Suzie Kazaryan, Cade Kelly, Justina Breen, Jennifer J. Majersik e Nerses Sanossian. "Abstract T P283: A Survey of Certified Stroke Center Medical Directors in the United States". Stroke 46, suppl_1 (fevereiro de 2015). http://dx.doi.org/10.1161/str.46.suppl_1.tp283.
Texto completo da fonteHaegele, Justin A., Wesley J. Wilson, Xihe Zhu, Justin J. Bueche, Ellie Brady e Chunxiao Li. "Barriers and facilitators to inclusion in integrated physical education: Adapted physical educators’ perspectives". European Physical Education Review, 4 de agosto de 2020, 1356336X2094442. http://dx.doi.org/10.1177/1356336x20944429.
Texto completo da fonteRaynolds, Laura T. "Can certification increase trade fairness and worker empowerment? Lessons from Fairtrade International-certified plantations in Ecuador". International Sociology, 21 de julho de 2022, 026858092211035. http://dx.doi.org/10.1177/02685809221103598.
Texto completo da fonte"Accreditation in Tourism and Hospitality Undergraduate Education in the ASEAN context: the Case of Thailand from the Ted Qual Perspective". Journal of Social Sciences Research, n.º 52 (30 de janeiro de 2019): 275–83. http://dx.doi.org/10.32861/jssr.52.275.283.
Texto completo da fonteD. Nash, Scott, Ambahun Chernet, Paul Weiss, Andrew W. Nute, Mulat Zerihun, Eshetu Sata, Demelash Gessese et al. "Prevalence of Ocular Chlamydia trachomatis Infection in Amhara Region, Ethiopia, after 8 Years of Trachoma Control Interventions". American Journal of Tropical Medicine and Hygiene, 9 de janeiro de 2023. http://dx.doi.org/10.4269/ajtmh.22-0535.
Texto completo da fonteTeses / dissertações sobre o assunto "Programmation certifiée"
Letouzey, Pierre. "Programmation fonctionnelle certifiée : L'extraction de programmes dans l'assistant Coq". Phd thesis, Université Paris Sud - Paris XI, 2004. http://tel.archives-ouvertes.fr/tel-00150912.
Texto completo da fontecorrects par construction. Ces programmes sont obtenus en
extrayant l'information pertinente de preuves constructives réalisées
dans l'assistant de preuves Coq.
Une telle traduction, ou "extraction", des preuves constructives
en programmes fonctionnels n'est pas nouvelle, elle correspond
à un isomorphisme bien connu sous le nom de Curry-Howard. Et
l'assistant Coq comporte depuis longtemps un tel outil d'extraction.
Mais l'outil précédent présentait d'importantes limitations. Certaines
preuves Coq étaient ainsi hors de son champ d'application, alors que
d'autres engendraient des programmes incorrects.
Afin de résoudre ces limitations, nous avons effectué une refonte
complète de l'extraction dans Coq, tant du point de vue de la théorie
que de l'implantation. Au niveau théorique, cette refonte a entraîné
la réalisation de nouvelles preuves de correction de ce mécanisme
d'extraction, preuves à la fois complexes et originales. Concernant
l'implantation, nous nous sommes efforcés d'engendrer du code
extrait efficace et réaliste, pouvant en particulier être intégré dans des
développement logiciels de plus grande échelle, par le biais de
modules et d'interfaces.
Enfin, nous présentons également plusieurs études de cas illustrant
les possibilités de notre nouvelle extraction. Nous décrivons ainsi la
certification d'une bibliothèque modulaire d'ensembles finis, et
l'obtention de programmes d'arithmétique réelle exacte à partir d'une
formalisation d'analyse réelle constructive. Même si des progrès
restent encore à obtenir, surtout dans ce dernier cas, ces exemples
mettent en évidence le chemin déjà parcouru.
Sall, Boubacar Demba. "Programmation impérative par raffinements avec l'assistant de preuve Coq". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS181.
Texto completo da fonteThis thesis investigates certified programming by stepwise refinement in the framework of the Coq proof assistant. This allows the construction of programs that are correct by construction. The programming language that is considered is a simple imperative language with assignment, selection, sequence, and iteration. The semantics of this language is formalized in a relational and predicative setting, and is shown to be equivalent to an axiomatic semantics in the style of a Hoare logic. The stepwise refinement approach to programming requires that refinement steps from the specification to the program be proved correct. For so doing, we use a calculus of weakest pre-specifications which is a generalisation of the calculus of weakest pre-conditions. Finally, to capture the whole refinement history of a program development, we formalize a design language and a logic for reasoning about program designs in order to establish that all refinement steps are indeed correct. The approach developed during this thesis is entirely mecanised using the Coq proof assistant
Auger, Cédric. "Compilation certifiée de SCADE/LUSTRE". Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00818169.
Texto completo da fonteHachmaoui, Mohammed Houssem Eddine. "Traduction mécanisée et certifiée en Coq d'une algèbre relationnelle étendue pour SQL vers une algèbre imbriquée". Thesis, université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG021.
Texto completo da fonteIn 1974, Boyce and Chamberlin created sql using the concepts of the relational algebra proposed by Codd in 1970, but as it evolved, its formal semantics became more and more complex. The small fragment select from where of SQL can be mapped to a relational algebra, with bag's semantics and by restricting expressions and formulae to those which can be expressed in relational algebra. To capture the semantics of the much more realistic fragment select from where group by having, taking into account all the expressions including those with aggregates, all forms of formulas, null values and, even more subtle, the specific SQL's environments, Benzaken and Contejean propose SQLalg which is an extension of relational algebra with a new operator for the group by having part designed specifically to take into account all the aspects of SQL cited above. Can this same fragment of SQL, with all its subtleties, be captured by nested relational algebra ? The present work formally proves that the answer to this question is yes. Indeed, we have built a certified translation, formalized in Coq, from SQLalg to NRAᵉ, which is a formalization in Coq of the nested relational algebra. The translation supports simple and complex expressions, SQL's formulae and perfectly reflects how environments are built and manipulated, especially for aggregates and for correlated queries. This work is part of a more global framework : the DBCert project which is a compilation chain certified in Coq from SQL to JavaScript
Demange, Delphine. "Semantic foundations of intermediate program representations". Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2012. http://tel.archives-ouvertes.fr/tel-00905442.
Texto completo da fonteDailler, Sylvain. "Extension paramétrée de compilateur certifié pour la programmation parallèle". Thesis, Orléans, 2015. http://www.theses.fr/2015ORLE2071/document.
Texto completo da fonteNowadays, we are using an increasing number of computer applications. Errors in critical applications (medicine, transport, . . .) may carry serious health or financial issues. Avoiding errors in programs is a challenge and may be achieved by deductive verification. Deductive verification applies to program written in a high-level languages, which are transformed into machine language by compilers. These compilers must be correct to ensure the nonpropagation of errors to machine code. Since 2005, multicore processors have spread in all electronic devices. So, these architectures need adapted compilers and proofs of correctness. Our work is the modular extension of a verified compiler for parallel languages targeting multicore architectures. Specifications of these languages (and their operational semantics) needed at all levels of the compiler and proofs of correctness of this compiler are parameterized by modules specifying elements of parallelism such as a relaxed memory model and notions of synchronization and scheduling between threads. This work is the first step in the conception of a certified compiler for high-level parallel languages such as algorithmic skeletons
BOULME, SYLVAIN. "Specification d'un environnement dedie a la programmation certifiee de bibliotheques de calcul formel". Paris 6, 2000. http://www.theses.fr/2000PA066492.
Texto completo da fontePrevosto, Virgile. "Conception et implantation du langage FoC pour le développement de logiciels certifiés". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2003. http://tel.archives-ouvertes.fr/tel-00007143.
Texto completo da fonteNigron, Pierre. "Effectful programs and their proofs in type theory : application to certified compilation and certified packet processing". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS480.
Texto completo da fonteOne way to reason about our programs is to write them directly into a proof assistant. Using the Curry-Howard correspondence, programs and proofs are then one. In order not to undermine the logical consistency of the proof assistant, the system is forced to restrict the programs to have no side effects. However, side effects are ubiquitous and essential in programming. Different techniques such as monads or algebraic effects have emerged to model them, thus offering a way to write imperative programs in purely functional languages. It is therefore quite natural that the results of decades of research invested in reasoning about imperative programs try to be adapted to reasoning about programs with effects. In this thesis, we are first interested in the use of separation logic to reason about programs with effects implemented in a proof assistant. We study an approach to describe the behaviour of effects using a predicate transformer. We focus first on freshness, then on packet processing and zero-copy. To study our approach, we rely on two concrete examples which are the SimplExpr module of CompCert and the decoder library Nom. Finally, in order to compile the packet parsers produced to C, we propose a refinement method removing the continuations introduced by the use of a free monad and performing some optimizations
Bodin, Martin. "Certified semantics and analysis of JavaScript". Thesis, Rennes 1, 2016. http://www.theses.fr/2016REN1S087/document.
Texto completo da fonteJavaScript is a trending programming language. It is not used in applications in which security may be an important issue. It thus becomes important to be able to control the quality of softwares written in JavaScript. This thesis explores a formal proof approach, which aims at giving a mathematical proof that a given program behaves as expected. To build this proof, we use proof assistants such as Coq—a trusted program enabling to check formal proofs. To state that a JavaScript program is behaving as expected, we first need a semantics of the JavaScript language. This thesis is thus part of the JSCert project, whose aim it to prove a formal semantics for JavaScript. Because of the size of JavaScript's semantics, it is crucial to know how it can be trusted: a typing mistake could compromise the whole semantics. To trust JSCert, we based ourselves on two trust sources. On one hand, JSCert has been designed to be the most similar it can be from the official JavaScript specification, the ECMAScript standard: they use the same data structures, and it is possible to relate each derivation rule in JSCert to a line of ECMAScript. On the other hand, we defined and proved correct with respect to JSCert an interpreter named JSRef. We have been able to run JSRef on JavaScript test suites. The JSCert semantics is not the first formal semantics of JavaScript, but it is the first to propose two distinct ways to relate the formal semantics to the JavaScript language: by having a semantics close to the official specification, and by testing this semantics and comparing it to other interpreters. Instead of independently proving that each JavaScript program behaves as expected, we chose to analyse programs using abstract interpretation. It consists of interpreting the semantics of a programming language with abstract domains. For instance, the concrete value 1 can be replaced by the abstract value +. Abstract interpretation is split into two steps : first, an abstract semantics is built and proven correct with respect to its concrete semantics, then, analysers are built from this abstract semantics. We only focus on the first step in this thesis. The JSCert semantics is huge - more than height hundred derivation rules. Building an abstract semantics using traditional techniques does not scale towards such sizes. We thus designed a new way to build abstract semantics from concrete semantics. Our approach is based on a careful analysis on the structure of derivation rules. It aims at minimising the proof effort needed to build an abstract semantics. We applied our method on several languages. With the goal of applying our approach to JavaScript, we built a domain based on separation logic. This logic require several adaptations to be able to apply in the context of abstract interpretation. This thesis precisely studies these interactions and introduces a new approach to solve them in our abstract interpretation framework. Our domains, although very simple compared to the memory model of JavaScript, seems to enable the proof of already existing analysers. This thesis has thus three main contributions : a trusted formal semantics for the JavaScript, a generic framework to build abstract semantics, and a non-trivial domain for this formalism
Livros sobre o assunto "Programmation certifiée"
author, Glenday David, ed. Teradata 12 SQL: An authorized Teradata Certified Professional Program study guide. Place of publication not identified]: [publisher not identified], 2011.
Encontre o texto completo da fonte