GitHub - formal-land/coq-of-rust: Formal verification tool for Rust: check 100% of execution cases of your programs 🦀 to make applications with no bugs! ✈️ 🚀 ⚕️ 🏦
Formal verification tool for Rust: check 100% of execution cases of your programs 🦀 to make applications with no bugs! ✈️ 🚀 ⚕️ 🏦 Even if Rust's type system prevents many mistakes, including memory errors, the code is still not immune to vulnerabilities, such as unexpected panics or wrongly implemented business rules. The way to go further is to mathematically prove that it is bug-free: this is
🦀 Translation of the Rust's core and alloc crates | Formal Land
We continue our work on formal verification of Rust programs with our tool coq-of-rust, to translate Rust code to the formal proof system Coq. One of the limitation we had was the handling of primitive constructs from the standard library of Rust, like Option::unwrap_or_default or all other primitive functions. For each of these functions, we had to make a Coq definition to represent its behavior.
Coq Tutorial at Proof Summit 2011
This document discusses the Coq proof assistant. It provides examples of defining concepts like booleans, natural numbers, and functions in Coq. It demonstrates tactics for proving properties like De Morgan's laws. It also shows how to define recursive functions over natural numbers like addition and equality testing. The document aims to introduce basic concepts and usage of the Coq system throug
Coq/SSReflect/MathCompの設定
[2024-10-11 Fri]: Sonoma 14.6, Coq 8.20, MathComp 2.2.0 [2023-02-24 Fri]: Ubuntu 22.04.1 LTS, Coq 8.16.1, MathComp 1.16 [2023-01-06 Fri]: Ubuntu 22.04.1, opam 2.1.4, ocaml 4.14.1, Coq 8.16.1, ProofGeneral 4.6, MathComp 1.15.0, MathComp-Analysys 0.6.0 [2022-09-09 Fri]: Ubuntu 22.04.1, Coq 8.15, MathComp 1.15 (opam), ProofGeneral 4.6 [2022-08-03 Wed]: Windows 11, Coq 8.15, MathComp 1.15 (WSL 2) [202
Coq のカリー・ハワード同型周辺について - Qiita
Coq のカリー・ハワード同型周辺についてメモ．間違いあればご指摘ください． Coq と CoC Coq は元々，Thierry Coquand 氏により提案された Calculus of Constructions (CoC) という型システムの実装として生まれました． その後 CoC は，帰納的データ型などが追加された Calculus of Inductive Constructions (CIC) に拡張され，現在の Coq は CIC の実装となっています． CoC/CIC は，基本的には型システムを定義しただけのものなのですが，実は Coq の証明システムはこの型システムがベース となっています． これは一体どういうことか，次からの節で，直観的な例を通して見ていくことにします． プログラム ≈ 証明 一般に，プログラムの型システムは，次の図みたいな推論木を組み立ててプログラムの
Reddit - Dive into anything
Computer Science Theory and Application. We share and discuss any content that computer scientists find interesting. People from all walks of life welcome, including hackers, hobbyists, professionals, and academics.
A Tale of Two Provers
A Tale of Two Provers Verifying Monoidal String Matching in Liquid Haskell and Coq Niki Vazou University of Maryland Leonidas Lampropoulos University of Pennsylvania Jeff Polakow Awake Networks Abstract We demonstrate for the first time that Liquid Haskell, a refinement type checker for Haskell programs, can be used for arbitrary the- orem proving by verifying a parallel, monoidal string matching
Using Coq to Write Fast and Correct Haskell
Using Coq to Write Fast and Correct Haskell John Wiegley BAE Systems USA john.wiegley@baesystems.com Benjamin Delaware Purdue University USA bendy@purdue.edu Abstract Correctness and performance are often at odds in the field of sys- tems engineering, either because correct programs are too costly to write or impractical to execute, or because well-performing code involves so many tricks of the tr
Cosette: An Automated SQL Solver
Cosette is an automated prover for checking equivalences of SQL queries. It formalizes a substantial fragment of SQL in the Coq Proof Assistant and the Rosette symbolic virtual machine. It returns either a formal proof of equivalance or a counterexample for a pair of given queries. Checking SQL Equivalences in Cosette You can try the Cosette demo online, using Cosette Web API or download its sourc
Computation and Logic: Winter Semester 2016
お知らせ 宿題を遅れて提出する場合の最終期限は 2/3(金) 17:00 です．要再提出が残っている人もこの時刻までに解決してください． スライド8と配布資料その4をアップロードしました．(2017.1.23) 1/17(火)は、(講義ホームページにある)予定を変更して2回目の演習とします。過去の期末試験(ホームページからダウンロードしてください。)の問題も演習の範囲とします。(2017.1.9) 過去の期末試験(2012年度, 2013年度, 2014年度, 2015年度)をアップロードしました(テキストと同じパスワードでダウンロードしてください)．演習の追加題材とします．(2016.12.31) スライド7アップロード．宿題その7がでました．(2016.12.19) 宿題その6の問題 or_distributes_over_and_2 は or_distributes_over_and
An afternoon of DTT/theorem provers: Agda and Coq
Note from 23rd August, 2017 I found this draft blog post lying around, written in the spring of 2015 while I was working at Imperial College London as a Research Associate in the Mobility Reading Group with Nobuko Yoshida. This was the fruit of a discussion with Tiago Cogumbreiro where we were comparing Coq and Agda for theorem proving. I believe we had a few more “side-by-side” comparisons writte
Writing a Formally-Verified Porn Browser in Coq and Haskell
It’s uncommon to use formal verification when developing software. Most people are unfamiliar with the tools and techniques, or assume they’re only for specialized use. This article will show how to write a simple image browser with: Core data structures and operations formally verified using the Coq theorem prover. A Haskell web server that handles HTTP requests An HTML/CSS/Javascript frontend De
PowerPoint プレゼンテーション
Ruby Extension Library Verified using Coq Proof-assistant Tanaka Akira National Institute of Advanced Industrial Science and Technology (AIST) RubyKaigi 2017 2017-09-20 2 About This Talk • Formal verification for fast & safe program in C • Quality assurance other than test 3 Materials • Ruby • Coq • C • HTML escape • Intel SSE Do you know all of them? 4 Coq Proof-assistant • Proof assistant – Prog
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
テスト駆動開発から証明駆動開発へ #JTF2019 / July Tech Festa 2019
ソフトウェアの基礎(beta) — ソフトウェアの基礎 1.0.2 documentation
collacoq
GitHub - krtx/agda-handson: agda handson
初めて学ぶCoq
Typeclasses: A Tutorial on Typeclasses in Coq
GitHub - mathink/Cat_on_Coq: Setoid-based Category Theory in Coq.
