Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Pereira, M��rio"'
Autor:
Pereira, M��rio, Ravara, Ant��nio
OCaml is particularly well-fitted for formal verification. On one hand, it is a multi-paradigm language with a well-defined semantics, allowing one to write clean, concise, type-safe, and efficient code. On the other hand, it is a language of choice
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba5088d1f5f6efb2d7cad26122a375dc
In this paper we present a tool for the formal analysis of applications built on top of replicated databases, where data integrity can be at stake. To address this issue, one can introduce synchronization in the system. Introducing synchronization in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62751fb1bd2923c3244ee8b0e260f320
http://arxiv.org/abs/2010.06622
http://arxiv.org/abs/2010.06622
This paper introduces WhylSon, a deductive verification tool for smart contracts written in Michelson, which is the low-level language of the Tezos blockchain. WhylSon accepts a formally specified Michelson contract and automatically translates it to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be6ef6018c8f0e397cd2498f56d13b5e
Autor:
Pereira, M��rio
This paper explores the idea of using defunctionalization as a proof technique for higher-order programs. Defunctionalization builds on substituting functional values by a first-order representation. Thus, its interest is that one can use an existing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ba29e7ba8af19403f4a68172d044228
In this article we present a tool for the verification of programs built on top replicated databases. The tool evaluates a sequential specification and deduces which operations need to be synchronized for the program to function properly in a distrib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39f0a81df63dcc57fc68e6a0b0b93a8b
We present a new type system combining refinement types and the expressiveness of intersection type discipline. The use of such features makes it possible to derive more precise types than in the original refinement system. We have been able to prove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e75a71ab2d7496ec0e06abbe2d31ca39