Výsledky vyhledávání - "Program proof"

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Verified code generation for the polyhedral model

Publikováno v: Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2021, 5 (POPL), pp.40:1-40:24. ⟨10.1145/3434321⟩
Proceedings of the ACM on Programming Languages, 2021, 5 (POPL), pp.40:1-40:24. ⟨10.1145/3434321⟩

International audience; The polyhedral model is a high-level intermediate representation for loop nests that supports elegantly a great many loop optimizations. In a compiler, after polyhedral loop optimizations have been performed, it is necessary a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00125cb3020a5f3df5f17d92e4d1f3b1
https://doi.org/10.1145/3434321

Zobrazit plný text záznamu

Dissertation/ Thesis

Vérification formelle de programmes de génération de données structurées

Autor: Genestier, Richard

Le problème général de la preuve de propriétés de programmes impératifs est indécidable. Pour deslangages de programmation et de propriétés plus restrictifs, des sous-problèmes décidables sontconnus. En pratique, grâce à des heuristiques

Externí odkaz: http://www.theses.fr/2016BESA2041/document

Zobrazit plný text záznamu

Formal verification of structured data generation programs

Autor: Genestier, Richard

Publikováno v: Approches Formelles dans l'Assistance au Développement de Logiciels
Approches Formelles dans l'Assistance au Développement de Logiciels, Jun 2016, Besançon, France
Performance et fiabilité [cs.PF]. Université de Franche-Comté, 2016. Français. ⟨NNT : 2016BESA2041⟩

The 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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::09b0a8799e85f462b1bbf43438f6a408
https://hal.archives-ouvertes.fr/hal-02991582

Zobrazit plný text záznamu

Dissertation/ Thesis

Certification of an Instruction Set Simulator

Autor: Shi, Xiaomu

Cette thèse expose nos travaux de certification d'une partie d'un programme C/C++ nommé SimSoC (Simulation of System on Chip), qui simule le comportement d'architectures basées sur des processeurs tels que ARM, PowerPC, MIPS ou SH4. Un simulateur

Externí odkaz: http://www.theses.fr/2013GRENM075/document

Zobrazit plný text záznamu

Certification d'un simulateur de jeu d'instructions

Autor: Shi, Xiaomu

Publikováno v: Embedded Systems. Université de Grenoble, 2013. English. ⟨NNT : 2013GRENM075⟩

Approaches based on axiomatic semantics (typically, Hoare logic) are the mostpopular for proving the correctness of imperative programs. However, we prefered totry a less usual but more direct approach, based on operational semantics : this wasmade p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::44514fa78fe77002104ff7ce4c08405f
https://theses.hal.science/tel-00937524v2

Zobrazit plný text záznamu

Echo: Practical Formal Verification by Reverse Synthesis

Safe operation is crucial to safety-critical systems, such as fly-by-wire flight-control systems in aircraft. Software in these systems has to be correct, or, more precisely, the risk of being incorrect has to be reduced to an acceptable level. Ensur

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::277101a40205e9af665994866b799f46

Zobrazit plný text záznamu

A formally verified compiler back-end

Autor: Xavier Leroy

Publikováno v: Journal of Automated Reasoning
Journal of Automated Reasoning, Springer Verlag, 2009, 43 (4), pp.363-446. ⟨10.1007/s10817-009-9155-4⟩
Journal of Automated Reasoning, 2009, 43 (4), pp.363-446. ⟨10.1007/s10817-009-9155-4⟩

International audience; This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assis

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::891ac8b02f6bd44937d4caa65ce7691b
https://hal.inria.fr/inria-00360768v3/document

Zobrazit plný text záznamu

Separation Logic for Small-step Cminor

Autor: Andrew W. Appel, Sandrine Blazy

Publikováno v: 20th Int. Conference on Theorem Proving in Higher Order Logics (TPHOLs 2007)
20th Int. Conference on Theorem Proving in Higher Order Logics (TPHOLs 2007), Sep 2007, Kaiserslautern, Germany. pp.5-21
Lecture Notes in Computer Science ISBN: 9783540745907
TPHOLs

Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor so that it is suitable for Hoare Logic reasoning and we have designed

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3391e909f66c097a2a20ca035c7c2e09
https://hal.inria.fr/inria-00165915

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání