Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Matteo Marescotti"'
Autor:
Rodrigo Otoni, Matteo Marescotti, Leonardo Alt, Patrick Eugster, Antti Hyvärinen, Natasha Sharygina
Publikováno v:
ACM Transactions on Privacy and Security. 26:1-28
Smart contracts are tempting targets of attacks, as they often hold and manipulate significant financial assets, are immutable after deployment, and have publicly available source code, with assets estimated in the order of millions of dollars being
Autor:
Ákos Hajdu, Matteo Marescotti, Thibault Suzanne, Ke Mao, Radu Grigore, Per Gustafsson, Dino Distefano
Publikováno v:
Proceedings of the 21st ACM SIGPLAN International Workshop on Erlang.
Autor:
Ke Mao, Timotej Kapus, Lambros Petrou, Akos Hajdu, Matteo Marescotti, Andreas Loscher, Mark Harman, Dino Distefano
Publikováno v:
2022 IEEE Conference on Software Testing, Verification and Validation (ICST).
Autor:
Antti E. J. Hyvärinen, Natasha Sharygina, Patrick Eugster, Rodrigo Otoni, Leonardo Alt, Matteo Marescotti
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030614669
ISoLA (3)
ISoLA (3)
Smart contracts challenge the existing, highly efficient techniques applied in symbolic model checking of software by their unique traits not present in standard programming models. Still, the majority of reported smart contract verification projects
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9159d3dba2caca293ff46c3465f9797
https://doi.org/10.1007/978-3-030-61467-6_12
https://doi.org/10.1007/978-3-030-61467-6_12
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
VMCAI
Recently presented, IC3-inspired symbolic model checking algorithms strengthen the procedure for showing inductiveness of lemmas expressing reachability of states. These approaches show an impressive performance gain in comparison to previous state-o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9389e52a2f8648ee090c519dc6ac49d5
https://doi.org/10.1007/978-3-030-39322-9_13
https://doi.org/10.1007/978-3-030-39322-9_13
Publikováno v:
LPAR
The inherent complexity of parallel computing makes development, resource monitor- ing, and debugging for parallel constraint-solving-based applications difficult. This paper presents SMTS, a framework for parallelizing sequential constraint solving
Publikováno v:
LPAR
King's College London
King's College London
The lookahead approach for binary-tree-based search in constraint solving favors branching that provide the lowest upper bound for the remaining search space. The approach has recently been applied in instance partitioning in divide-and-conquer-based
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030034269
ISoLA (4)
ISoLA (4)
The Ethereum platform is a public, distributed, blockchain-based database that is maintained by independent parties. A user interacts with Ethereum by writing programs and having miners execute them for a fee charged on-the-fly based on the complexit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0dd1a597e62127f234e7f25fe9206981
https://doi.org/10.1007/978-3-030-03427-6_33
https://doi.org/10.1007/978-3-030-03427-6_33
Publikováno v:
FMCAD
Property Directed Reachability (PDR) is an efficient model checking technique. However, the intrinsic high computational complexity prevents PDR from meeting the challenges of real world verification. To address this problem, this paper introduces th
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783319465197
ATVA
ATVA
Satisfiability modulo theories (SMT) allows the modeling and solving of constraint problems arising from practical domains by combining well-engineered and powerful solvers for propositional satisfiability with expressive, domain-specific background
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08681e5d1c5be144e2466c4c3c615ad6
https://doi.org/10.1007/978-3-319-46520-3_27
https://doi.org/10.1007/978-3-319-46520-3_27