Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Annenkov, Danil"'
Publikováno v:
FMBC: Formal Methods for Blockchains, 2022
We provide three detailed case studies of vulnerabilities in smart contracts, and show how property-based testing would have found them: 1. the Dexter1 token exchange; 2. the iToken; 3. the ICO of Brave's BAT token. The last example is, in fact, new,
Externí odkaz:
http://arxiv.org/abs/2208.00758
The number of attacks and accidents leading to significant losses of crypto-assets is growing. According to Chainalysis, in 2021, approx. $14 billion has been lost due to various incidents, and this number is dominated by Decentralized Finance (DeFi)
Externí odkaz:
http://arxiv.org/abs/2203.08016
Autor:
Annenkov, Danil, Elsman, Martin
Publikováno v:
20th International Symposium on Principles and Practice of Declarative Programming 2018 (PPDP'18)
We present an extension to a certified financial contract management system that allows for templated declarative financial contracts and for integration with financial stochastic models through verified compilation into so-called payoff-expressions.
Externí odkaz:
http://arxiv.org/abs/2108.03076
We implement extraction of Coq programs to functional languages based on MetaCoq's certified erasure. We extend the MetaCoq erasure output language with typing information and use it as an intermediate representation, which we call $\lambda^T_\square
Externí odkaz:
http://arxiv.org/abs/2108.02995
Publikováno v:
CPP'2021: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, January 18--19, 2021, Virtual, Denmark
We implement extraction of Coq programs to functional languages based on MetaCoq's certified erasure. As part of this, we implement an optimisation pass removing unused arguments. We prove the pass correct wrt. a conventional call-by-value operationa
Externí odkaz:
http://arxiv.org/abs/2012.09138
Publikováno v:
CPP 2020: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, January 2020, Pages 215-228
We present a new way of embedding functional languages into the Coq proof assistant by using meta-programming. This allows us to develop the meta-theory of the language using the deep embedding and provides a convenient way for reasoning about concre
Externí odkaz:
http://arxiv.org/abs/1907.10674
Autor:
Annenkov, Danil
We present three projects concerned with applications of proof assistants in the area of programming language theory and mathematics. The first project is about a certified compilation technique for a domain-specific programming language for financia
Externí odkaz:
http://arxiv.org/abs/1811.11317
Publikováno v:
Mathematical Structures in Computer Science. Special Issue: Homotopy Type Theory, 2023, pp. 1-56
We define and develop two-level type theory (2LTT), a version of Martin-L\"of type theory which combines two different type theories. We refer to them as the inner and the outer type theory. In our case of interest, the inner theory is homotopy type
Externí odkaz:
http://arxiv.org/abs/1705.03307
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.