coq   1276

« earlier    

Untitled (
Proving tree algorithms for succinct data structures. ~ R. Affeldt, J. Garrigue, X. Qi, K. Tanaka.
Coq  ITP  from twitter_favs
8 days ago by skchrko
BPF and formal verification
Note the simple BPF intro: it's really a VM with a simple RISC ISA(and cannot jump BACK, only forwards), so this verification attempt was to make sure programs would eventually terminate.
bpf  verification  formal_methods  coq  ocaml  2015 
11 days ago by mechazoidal
Randomised Property-Based Testing Plugin for Coq
coq  testing  formalmethods  quickcheck 
4 weeks ago by Z303
Coq'Art Chapter 13: Infinite Objects and Proofs
Reasoning about infinite objects while staying in the finite world of a computer is one of the most fascinating uses of proof tools.Inductive proof techniques already make it possible to prove statements for infinite collections of objects, that is, integers, binary trees, and so on. Of course, each of these objects is built in a finite number of steps and this is the intuitive justification for induction. We propose taking a further step, with techniques to build and handle infinite objects, integrated in the Coq systemby Gimenez. The main example that we use in this chapter consists in streams, which are especially adapted to model reactive systems. In domains such as communication, energy, or transportation, infinite execution is the norm rather than the exception
coq  coinduction 
8 weeks ago by daniil
Untitled (
Constructing inductive-inductive types in cubical type theory. ~ J. Hugunin.
Agda  Coq  ITP  from twitter_favs
10 weeks ago by tjweir

« earlier    

related tags

2015  acl  acl2  agda  algorithms  arm  assembly  assistant  au  automatic-proofs  book  books-to-read  books  bpf  caml  ccc  circuits  coinduction  computer-science  crypto  cryptocurrency  cryptography  database  de-bruijn  dependent-types  dependent_types  development  distributed  emacs  engineering  ethereum  evm  formal-methods  formal  formal_logic  formal_methods  formalization  formalmethods  geometry  haskell  higher  history  hol  hol98  homotopy  idris  inria  isabelle  isar  itp  l3  lambda  lambda_calculus  lang  language  lclam  lego  llvm  logic  math  mathematics  ocaml  order  paper  papers  parallel  pg  pgshell  phd_thesis  phox  plastic  polyhedral  programming  prolog  proof  quickcheck  raft  reference  research  research_program  rigor  rooster  rust  sat  set_theory  smart-contracts  smt  solver  sql  substitution  symbols  synthesis  systemprogramming  tdd  testing  theorem-prover  theory  tla+  trust  twelf  type-system  type-theory  type  typed-functional-programming  types  verification  vin 

Copy this bookmark: