Skip to search formSkip to main contentSkip to account menu

Mi-Cho-Coq, a framework for certifying Tezos Smart Contracts

Mi-Cho-Coq, a Coq framework for verifying the functional correctness of Michelson smart contracts, is presented, and the certification of a Multisig contract with the Mi-Cho -Coq framework is detailed.
View PDF on arXiv (opens in a new tab)

Conditional Reactive Systems

It turns out that some constructions for graph transformation systems (such as computing weakest preconditions and strongest postconditions and showing local confluence by means of critical pair analysis) can be done very elegantly in the more general setting.
View via Publisher (opens in a new tab)

Checking Zenon Modulo Proofs in Dedukti

A shallow embedding is presented into Dedukti of proofs produced by Zenon Modulo, an extension of the tableau-based first-order theorem prover Zenon to deduction modulo and typing that is applied to the verification of programs in both academic and industrial projects.
View PDF on arXiv (opens in a new tab)

Dedukti : a Logical Framework based on the λ Π-Calculus Modulo Theory

Dedukti is a Logical Framework based on the λΠ-Calculus Modulo Theory that permits to used it to check large libraries of proofs developed in other proof systems: Zenon, iProver, FoCaLiZe, HOL Light, and Matita.

Mixing HOL and Coq in Dedukti (Rough Diamond)

We use Dedukti as a logical framework for interoperability. We use automated tools to translate different developments made in HOL and in Coq to Dedukti and we combine them to prove new results.

Objects and subtyping in the λΠ-calculus modulo

This embedding has been implemented as a translation tool from the Object Calculus to Dedukti, a type-checker for the λΠ-calculus modulo, and is proved correct with respect to the operational semantics and the type system of the ObjectCalculus.

Albert, an intermediate smart-contract language for the Tezos blockchain

Albert is presented, an intermediate language for Tezos smart contracts which abstracts Michelson stacks as linearly typed records and its compiler to Michelson, written in Coq, that targets Mi-Cho-Coq, a formal specification of Michelson implemented in CoQ.
View PDF on arXiv (opens in a new tab)

A Rewrite System for Proof Constructivization

  • Raphaël Cauderlier
  • Computer Science, Mathematics
    International Workshop on Logical Frameworks and…
  • 23 June 2016
The ability of rewrite systems to represent partial functions to implement heuristics for proof constructivization in Dedukti, a logical framework based on rewriting in which proofs are first-class objects which can be the subject of computation.
View on ACM (opens in a new tab)

First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice

This work describes two automated reasoning systems that have been built to extend other provers with Deduction modulo theory and describes the two backends of these systems to the Dedukti universal proof checker, which allows us to verify the proofs produced by these tools.
View on Springer (opens in a new tab)

Objects and Subtyping in the Lambda-Pi-Calculus Modulo

A translation tool from the Object Calculus to Dedukti, a type-checker for the lambda-Pi-calculus modulo, and proves this embedding correct with respect to the operational semantics and the type system of the ObjectCalculus.
View via Publisher (opens in a new tab)
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)