Relevant bibliographies by topics / Why3 tool for deductive verification

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Why3 tool for deductive verification'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Why3 tool for deductive verification.'

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 "Why3 tool for deductive verification"

1

Shelekhov, Vladimir Ivanovich. "TRANSFORMATION AND VERIFICATION OF THE OS PROGRAM SORTING DEVICES IN A COMPUTER BUS." System Informatics, no. 18 (2021): 1–34. http://dx.doi.org/10.31144/si.2307-6410.2021.n18.p1-34.

Full text
Abstract:
The transformation and verification of the bus_sort_breadthfirst program, which belongs to the Linux OS kernel and implements sorting of devices are described. The C program is transformed into the cP language performing macros unfolding, structure changes, and elimination of pointers. Transformed program is translated into the WhyML functional language. For the received program, a specification is constructed. Deductive verification is carried out in the tool Why3.
APA, Harvard, Vancouver, ISO, and other styles
2

Fortin, Jean, and Frédéric Gava. "BSP-Why: A Tool for Deductive Verification of BSP Algorithms with Subgroup Synchronisation." International Journal of Parallel Programming 44, no. 3 (2015): 574–97. http://dx.doi.org/10.1007/s10766-015-0360-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Santos, César, Francisco Martins, and Vasco Thudichum Vasconcelos. "Deductive Verification of Parallel Programs Using Why3." Electronic Proceedings in Theoretical Computer Science 189 (August 19, 2015): 128–42. http://dx.doi.org/10.4204/eptcs.189.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shelekhov, V. I. "Applying Program Transformations for Deductive Verification of the List Reverse Program." Programmnaya Ingeneria 12, no. 3 (2021): 127–39. http://dx.doi.org/10.17587/prin.12.127-139.

Full text
Abstract:
The program transformation methods to simplify the deductive verification of programs with recursive data types are investigated. The list reversion program is considered as an example. A source program in the C language is translated to the cP functional language which includes no pointers. The resulting program is translated further to the WhyML language to perform deductive verification of the program. The cP language includes the same constructs of the C language except pointers. In the C program, all actions that include pointers are replaced by the equivalent fragments without pointers.
APA, Harvard, Vancouver, ISO, and other styles
5

Lanzinger, Florian, Alexander Weigl, Mattias Ulbrich, and Werner Dietl. "Scalability and precision by combining expressive type systems and deductive verification." Proceedings of the ACM on Programming Languages 5, OOPSLA (2021): 1–29. http://dx.doi.org/10.1145/3485520.

Full text
Abstract:
Type systems and modern type checkers can be used very successfully to obtain formal correctness guarantees with little specification overhead. However, type systems in practical scenarios have to trade precision for decidability and scalability. Tools for deductive verification, on the other hand, can prove general properties in more cases than a typical type checker can, but they do not scale well. We present a method to complement the scalability of expressive type systems with the precision of deductive program verification approaches. This is achieved by translating the type uses whose co
APA, Harvard, Vancouver, ISO, and other styles
6

Dardinier, Thibault, Anqi Li, and Peter Müller. "Hypra: A Deductive Program Verifier for Hyper Hoare Logic." Proceedings of the ACM on Programming Languages 8, OOPSLA2 (2024): 1279–308. http://dx.doi.org/10.1145/3689756.

Full text
Abstract:
Hyperproperties relate multiple executions of a program and are useful to express common correctness properties (such as determinism) and security properties (such as non-interference). While there are a number of powerful program logics for the deductive verification of hyperproperties, their automation falls behind. Most existing deductive verification tools are limited to safety properties, but cannot reason about the existence of executions, for instance, to prove the violation of a safety property. Others support more flexible hyperproperties such as generalized non-interference, but have
APA, Harvard, Vancouver, ISO, and other styles
7

Watanabe, Yasunari, Kiran Gopinathan, George Pîrlea, Nadia Polikarpova, and Ilya Sergey. "Certifying the synthesis of heap-manipulating programs." Proceedings of the ACM on Programming Languages 5, ICFP (2021): 1–29. http://dx.doi.org/10.1145/3473589.

Full text
Abstract:
Automated deductive program synthesis promises to generate executable programs from concise specifications, along with proofs of correctness that can be independently verified using third-party tools. However, an attempt to exercise this promise using existing proof-certification frameworks reveals significant discrepancies in how proof derivations are structured for two different purposes: program synthesis and program verification. These discrepancies make it difficult to use certified verifiers to validate synthesis results, forcing one to write an ad-hoc translation procedure from synthesi
APA, Harvard, Vancouver, ISO, and other styles
8

Parthasarathy, Gaurav, Thibault Dardinier, Benjamin Bonneau, Peter Müller, and Alexander J. Summers. "Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 1510–34. http://dx.doi.org/10.1145/3656438.

Full text
Abstract:
Automated program verifiers are typically implemented using an intermediate verification language (IVL), such as Boogie or Why3. A verifier front-end translates the input program and specification into an IVL program, while the back-end generates proof obligations for the IVL program and employs an SMT solver to discharge them. Soundness of such verifiers therefore requires that the front-end translation faithfully captures the semantics of the input program and specification in the IVL program, and that the back-end reports success only if the IVL program is actually correct. For a verificati
APA, Harvard, Vancouver, ISO, and other styles
9

Devyanin, P. N., and M. A. Leonova. "The techniques of formalization of OS Astra Linux Special Edition access control model using Event-B formal method for verification using Rodin and ProB." Prikladnaya Diskretnaya Matematika, no. 52 (2021): 83–96. http://dx.doi.org/10.17223/20710410/52/5.

Full text
Abstract:
The paper presents techniques to specification access control model of OS Astra Linux Special Edition (the MROSL DP-model) in the formalized notation (formalized using the Event-B formal method), that are based on the use of several global types, separation of general total functions into specific total functions, reduction in the number of invariants and guard of events, which iterate over subsets of a certain set. The result of using these techniques was the simplification of automated deductive verification of formalized notation using the Rodin tool and adaptation of the model to verificat
APA, Harvard, Vancouver, ISO, and other styles
10

Elad, Neta, Oded Padon, and Sharon Shoham. "An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification." Proceedings of the ACM on Programming Languages 8, POPL (2024): 970–1000. http://dx.doi.org/10.1145/3632875.

Full text
Abstract:
First-order logic, and quantifiers in particular, are widely used in deductive verification of programs and systems. Quantifiers are essential for describing systems with unbounded domains, but prove difficult for automated solvers. Significant effort has been dedicated to finding quantifier instantiations that establish unsatisfiability of quantified formulas, thus ensuring validity of a system’s verification conditions. However, in many cases the formulas are satisfiable—this is often the case in intermediate steps of the verification process, e.g., when an invariant is not yet inductive. Fo
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Why3 tool for deductive verification"

1

Parreira, Pereira Mário José. "Tools and Techniques for the Verification of Modular Stateful Code." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS605/document.

Full text
Abstract:
Cette thèse se place dans le cadre des méthodes formelles et plus précisément dans celui de la vérification déductive et du système Why3. Ce dernier fournit un ensemble d'outils pour la spécification, l'implémentation et la vérification à l'aide de démonstrateurs externes. Why3 propose en particulier un langage de programmation adapté à la preuve, appelé WhyML. Un aspect important de ce langage est le code fantôme, à savoir des éléments de programme introduits exclusivement pour les besoins de la spécification et de la preuve. Pour obtenir un code exécutable, le code fantôme est éliminé par un
APA, Harvard, Vancouver, ISO, and other styles
2

Garchery, Quentin. "Certification de la transformation de tâches de preuve." Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG006.

Full text
Abstract:
De nombreux prouveurs et outils de vérification font un usage instensif des transformations logiques afin de ramener un problème exprimé sous la forme d'une tâche de preuve à un certain nombre de tâches de preuve plus simples à valider. Les transformations font souvent partie de la base de confiance de l'outil de vérification. Cette thèse a pour objectif de renforcer la confiance accordée aux transformations logiques. Les transformations sont instrumentées pour produire des certificats puis ceux-ci sont vérifiés par un outil externe: c'est l'approche sceptique. De ce fait, notre méthode est in
APA, Harvard, Vancouver, ISO, and other styles
3

Herms, Paolo. "Certification of a Tool Chain for Deductive Program Verification." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00789543.

Full text
Abstract:
This thesis belongs to the domain of software verification. The goalof verifying software is to ensure that an implementation, a program,satisfies the requirements, the specification. This is especiallyimportant for critical computer programs, such as control systems forair planes, trains and power plants. Here a malfunctioning occurringduring operation would have catastrophic consequences. Software requirements can concern safety or functioning. Safetyrequirements, such as not accessing memory locations outside validbounds, are often implicit, in the sense that any implementation isexpected t
APA, Harvard, Vancouver, ISO, and other styles
4

Gondelman, Léon. "Un système de types pragmatique pour la vérification déductive des programmes." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS583/document.

Full text
Abstract:
Cette thèse se place dans le contexte de la vérification déductive des programmes et a pour objectif de formaliser un certain nombre de concepts qui sont mis en œuvre dans l'outil de vérification Why3.L'idée générale est d'explorer des solutions qu'une approche à base de systèmes de types peut apporter à la vérification. Nous commençons par nous intéresser à la notion du code fantôme, une technique implantée dans de nombreux outils de vérification modernes, qui consiste à donner à des éléments de la spécification les apparences d'un code opérationnel. L'utilisation correcte du code fantôme req
APA, Harvard, Vancouver, ISO, and other styles
5

Rieu, Raphaël. "Development and verification of arbitrary-precision integer arithmetic libraries." Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG023.

Full text
Abstract:
Les algorithmes d'arithmétique entière en précision arbitraire sont utilisés dans des contextes où leur correction et leurs performances sont critiques, comme les logiciels de cryptographie ou de calcul formel. GMP est une bibliothèque d'arithmétique entière en précision arbitraire très utilisée. Elle propose des algorithmes de pointe, suffisamment complexes pour qu'il soit à la fois justifié et difficile de les vérifier formellement. Cette thèse traite de la vérification formelle de la correction fonctionnelle d'une partie significative de GMP à l'aide de la plateforme de vérification déducti
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Why3 tool for deductive verification"

1

Pereira, Mário, and António Ravara. "Cameleer: A Deductive Verification Tool for OCaml." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_31.

Full text
Abstract:
AbstractWe present , an automated deductive verification tool for OCaml. We leverage on the recently proposed GOSPEL (Generic OCaml SPEcification Language) to attach rigorous, yet readable, behavioral specification to OCaml code. The formally-specified program is fed to our toolchain, which translates it into an equivalent one in WhyML, the programming and specification language of the Why3 verification framework. We report on successful case studies conducted in .
APA, Harvard, Vancouver, ISO, and other styles
2

Giunti, Marco, and Nobuko Yoshida. "Iso-Recursive Multiparty Sessions and their Automated Verification." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-91118-7_14.

Full text
Abstract:
Abstract "Image missing""Image missing" Most works on session types take an equi-recursive approach and do not distinguish among a recursive type and its unfolding. This becomes more important in recent type systems which do not require global types, also known as generalised multiparty session types (GMST). In GMST, in order to establish properties as deadlock-freedom, the environments which type processes are assumed to satisfy extensional properties holding in all infinite sequences. This is a problem because: (1) the mechanisation of GMST and equi-recursion in proof assistants is utterly c
APA, Harvard, Vancouver, ISO, and other styles
3

Dubois, Catherine. "Deductive Verification of Sparse Sets in Why3." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-86695-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Blazy, Sandrine. "Teaching Deductive Verification in Why3 to Undergraduate Students." In Formal Methods Teaching. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32441-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Beckert, Bernhard, Richard Bubel, Reiner Hähnle, and Mattias Ulbrich. "Towards a Usable and Sustainable Deductive Verification Tool." In Leveraging Applications of Formal Methods, Verification and Validation. Software Engineering. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-19756-7_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kawamoto, Yusuke, Kentaro Kobayashi, and Kohei Suenaga. "StatWhy: Formal Verification Tool for Statistical Hypothesis Testing Programs." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-98679-6_10.

Full text
Abstract:
Abstract Statistical methods have been widely misused and misinterpreted in various scientific fields, raising significant concerns about the integrity of scientific research. To mitigate this problem, we propose a tool-assisted method for formally specifying and automatically verifying the correctness of statistical programs. In this method, programmers are required to annotate the source code of the statistical programs with the requirements for these methods. Through this annotation, they are reminded to check the requirements for statistical methods, including those that cannot be formally
APA, Harvard, Vancouver, ISO, and other styles
7

Pereira, Mário. "Practical Deductive Verification of OCaml Programs." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-71177-0_29.

Full text
Abstract:
AbstractIn this paper, we provide a comprehensive, hands-on tutorial on how to apply deductive verification to programs written in . In particular, we show how one can use the specification language and the tool to conduct mostly-automated verification on code. In our presentation, we focus on two main classes of programs: first, purely functional programs with no mutable state; then on imperative programs, where one can mix mutable state with subtle control-flow primitives, such as locally-defined exceptions.
APA, Harvard, Vancouver, ISO, and other styles
8

Bernier, Téo, Yani Ziani, Nikolai Kosmatov, and Frédéric Loulergue. "Combining Deductive Verification with Shape Analysis." In Fundamental Approaches to Software Engineering. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57259-3_14.

Full text
Abstract:
AbstractDeductive verification tools can prove a large range of program properties, but often face issues on recursive data structures. Abstract interpretation tools based on separation logic and shape analysis can efficiently reason about such structures but cannot deal with so large classes of properties. This short paper presents an ongoing work on combining both techniques. We show how a deductive verifier for C programs, Frama-C/Wp, can benefit from a shape analysis tool, MemCAD, where structural and separation properties proved in the latter become assumptions for the former. A case stud
APA, Harvard, Vancouver, ISO, and other styles
9

Beckert, Bernhard, Richard Bubel, Daniel Drodt, et al. "The Java Verification Tool KeY:A Tutorial." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-71177-0_32.

Full text
Abstract:
AbstractThe KeY tool is a state-of-the-art deductive program verifier for the Java language. Its verification engine is based on a sequent calculus for dynamic logic, realizing forward symbolic execution of the target program, whereby all symbolic paths through a program are explored. Method contracts make verification scalable. KeY combines auto-active and fine-grained proof interaction, which is possible both at the level of the verification target and its specification, as well as at the level of proof rules and program logic. This makes KeY well-suited for teaching program verification, bu
APA, Harvard, Vancouver, ISO, and other styles
10

Nagasamudram, Ramana, Anindya Banerjee, and David A. Naumann. "The WhyRel Prototype for Modular Relational Verification of Pointer Programs." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_11.

Full text
Abstract:
Abstract Verifying relations between programs arises as a task in various verification contexts such as optimizing transformations, relating new versions of programs with older versions (regression verification), and noninterference. However, relational verification for programs acting on dynamically allocated mutable state is not well supported by existing tools, which provide a high level of automation at the cost of restricting the programs considered. Auto-active tools, on the other hand, require more user interaction but enable verification of a broader class of programs. This article pre
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Why3 tool for deductive verification"

1

Шелехов, В. И. "DEDUCTIVE VERIFICATION OF A SIMPLE MUTUAL EXCLUSION PROTOCOL." In Сборник трудов XVIII Российской конференции "РАСПРЕДЕЛЕННЫЕ ИНФОРМАЦИОННО-ВЫЧИСЛИТЕЛЬНЫЕ РЕСУРСЫ". Crossref, 2023. http://dx.doi.org/10.25743/dir.2022.88.64.040.

Full text
Abstract:
Механизм взаимного исключения традиционно применяется для защиты разделяемых структур данных в распределенных системах управления. Проведена дедуктивная верификация простого протокола взаимного исключения Маскарелла для произвольного числа процессов с дополнительным процессом-координатором. Верифицируются два основных свойства: два процесса не могут одновременно находиться в критической секции; любой процесс, пытающийся войти в критическую секцию, попадает в нее через конечное время. Доказательство свойств выполнено в системах верификации Why3 и Event-B. The mutual exclusion mechanism is tradi
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Why3 tool for deductive verification' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography