Filters

89 Hits in 3.6 sec

### Formalizing O Notation in Isabelle/HOL [chapter]

2004 Lecture Notes in Computer Science
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.  ...  Our goal here is to describe an implementation of one important asymptotic notion -"big O notation" -using the Isabelle/HOL proof assistant.  ...  Moreover, in Isabelle/HOL types are grouped together into sorts. These sorts are ordered, and types of a sort inherit properties of any of the sort's ancestors.  ...

### Irrationality and Transcendence Criteria for Infinite Series in Isabelle/HOL [article]

Angeliki Koutsoukou-Argyraki, Wenda Li, Lawrence C. Paulson
2021 arXiv   pre-print
Our formalizations in Isabelle/HOL can be found on the Archive of Formal Proofs.  ...  Here we describe selected aspects of the formalization and discuss what this reveals about the use and potential of Isabelle/HOL in formalizing modern mathematical research, particularly in these parts  ...  preliminaries were already available in Isabelle/HOL.  ...

### Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL [chapter]

Ralph Bottesch, Max W. Haslbeck, Alban Reynaud, René Thiemann
2020 Lecture Notes in Computer Science
We implement a decision procedure for linear mixed integer arithmetic and formally verify its soundness in Isabelle/HOL.  ...  The procedure itself is then implemented as a branch-and-bound algorithm, and is available in several languages via Isabelle's code generator.  ...  The authors are listed in alphabetical order regardless of individual contributions or seniority.  ...

### Formalizing O Notation in Isabelle / HOL

2018
We describe a formalization of asymptotic O notation using the Isabelle / HOL proof assistant.  ...  Our goal here is to describe an implementation of one important asymptotic notion -"big O notation" -using the Isabelle/HOL proof assistant.  ...  Moreover, in Isabelle/HOL types are grouped together into sorts. These sorts are ordered, and types of a sort inherit properties of any of the sort's ancestors.  ...

### Verification Framework for Control System Functionality of Unmanned Aerial Vehicles [article]

Omar A. Jasim, Sandor M. Veres
2020 arXiv   pre-print
To illustrate the proceedures, a higher-order logic interactive theorem-prover and an automated theorem-prover are utilized to formally verify a nonlinear attitude control system of a generic multi-rotor  ...  using Isabelle/HOL prover.  ...  Isabelle/HOL expressions and symbols are described in Table 1 .  ...

### On the Formalisation of \$\$\varSigma \$\$ -Protocols and Commitment Schemes [chapter]

David Butler, David Aspinall, Adrià Gascón
2019 Research Series on the Chinese Dream and China's Development Path
Every definition and every theorem presented in this paper has been checked mechanically by the Isabelle/HOL proof assistant.  ...  In this work we provide the first formal analysis in a proof assistant of such a relationship and in doing so formalise Σ-protocols and commitment schemes and provide proofs of security for well known  ...  We formalise this in Isabelle/HOL, but the structure could be used in other proof assistants.  ...

### Coquelicot: A User-Friendly Library of Real Analysis for Coq

Sylvie Boldo, Catherine Lelay, Guillaume Melquiond
2014 Mathematics in Computer Science
As such, its support is warranted in proof assistants, so that the users have a way to formally verify mathematical theorems and correctness of critical systems.  ...  The Coq system comes with an axiomatization of standard real numbers and a library of theorems on real analysis. Unfortunately, this standard library is lacking some widely used results.  ...  Acknowledgements The authors are grateful to Pierre Michalak andÉvelyne Roudneff for allowing us to take the Baccalaureate exam in real-life conditions in a high school in Massy, and for organizing the  ...

### A Perron–Frobenius Theorem for Deciding Matrix Growth

René Thiemann
2021 Journal of Logical and Algebraic Methods in Programming
We further verify both the algorithm and the new Perron-Frobenius theorem in the proof assistant Isabelle/HOL, and integrate it into Ce T A, a verified certifier for various properties, including complexity  ...  Because of the new results, Ce T A no longer requires a verified implementation of algebraic numbers.  ...  We thank Manuel Eberl for his hints on performing reasoning on real asymptotics within Isabelle. Finally, we thank the anonymous reviewers for their helpful remarks.  ...

### A Formal Proof of the Irrationality of ζ(3) [article]

Assia Mahboubi, Thomas Sibut-Pinote
2021 arXiv   pre-print
The rest of the proof combines arithmetical ingredients and asymptotic analysis, which we conduct by extending the Mathematical Components libraries.  ...  We formally prove this result by an a posteriori verification of calculations performed by computer algebra algorithms in a Maple session.  ...  We also thank Cyril Cohen, Pierre Roux and Enrico Tassi for their help, in particular with the libraries this work depends on.  ...

### Directed Security Policies: A Stateful Network Implementation

Cornelius Diekmann, Lars Hupel, Georg Carle
2014 Electronic Proceedings in Theoretical Computer Science
The solution scales to large networks, which is confirmed by a large real-world case study. Its correctness is guaranteed by the Isabelle/HOL theorem prover.  ...  In particular, we provide a criterion to verify the lack of side effects in linear time.  ...  The Isabelle/HOL theory files can be obtained at https://github.com/diekmann/topoS.  ...

### Formalising \$\$\varSigma \$\$-Protocols and Commitment Schemes Using CryptHOL

D. Butler, A. Lochbihler, D. Aspinall, A. Gascón
2020 Journal of automated reasoning
We formalise this proof at an abstract level using the modularity available in Isabelle/HOL and CryptHOL. This way, the proofs of the instantiations come for free.  ...  \$\$\varSigma \$\$ Σ -protocols allow a prover to convince a verifier that they possess some knowledge without leaking information about the knowledge.  ...  Isabelle/HOL Isabelle/HOL is an interactive theorem prover that implements Higher Order Logic (HOL).  ...

### Efficient certification of complexity proofs: formalizing the Perron–Frobenius theorem (invited talk paper)

Jose Divasón, Sebastiaan Joosten, Ondřej Kunčar, René Thiemann, Akihisa Yamada
2018 Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018
To cover the theorem in its full extent, we establish a connection between two different Isabelle/HOL libraries on matrices, enabling an easy exchange of theorems between both libraries.  ...  In this work we formalize the Perron-Frobenius theorem.  ...  The authors are listed in alphabetical order regardless of individual contributions or seniority. We thank Fabian Immler for his explanations on how to perform continuity proofs in the HMA library.  ...

### Efficient certification of complexity proofs: formalizing the Perron–Frobenius theorem (invited talk paper)

Jose Divasón, Sebastiaan Joosten, Ondřej Kunčar, René Thiemann, Akihisa Yamada
2018 Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018
To cover the theorem in its full extent, we establish a connection between two different Isabelle/HOL libraries on matrices, enabling an easy exchange of theorems between both libraries.  ...  In this work we formalize the Perron-Frobenius theorem.  ...  The authors are listed in alphabetical order regardless of individual contributions or seniority. We thank Fabian Immler for his explanations on how to perform continuity proofs in the HMA library.  ...