Natasha Sharygina

Natasha Sharygina

Auto-generated profile, based on publicly available information

Natasha Sharygina

University of Lugano

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2008 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
DKDaniel Kroening
Daniel Kroening
NSNatasha Sharygina
Natasha Sharygina
STStefano Tonetta
Stefano Tonetta
ATAliaksei Tsitovich
Aliaksei Tsitovich
CWChristoph M. Wintersteiger
Christoph M. Wintersteiger

7 August 2022
Verified
Book Chapter
Open access
PDF file
LALeonardo Alt
Leonardo Alt
MBMartin Blicha
Martin Blicha
AHAntti E. J. Hyvärinen
Antti E. J. Hyvärinen
NSNatasha Sharygina
Natasha Sharygina
Formally verifying smart contracts is important due to their immutable nature, usual open source licenses, and high financial incentives for exploits. Since 2019 the Ethereum Foundation’s Solidity compiler ships with a model checker. The checker, called SolCMC, has two different reasoning engines and tracks closely the development of the Solidity language. We describe SolCMC’s architecture and use from the perspective of developers of both smart contracts and tools for software verification, and show how to analyze nontrivial properties of real life contracts in a fully automated manner.

11 June 2016
Verified
Book Chapter
Closed access
PDF file
AHAntti E. J. Hyvärinen
Antti E. J. Hyvärinen
MMMatteo Marescotti
Matteo Marescotti
LALeonardo Alt
Leonardo Alt
NSNatasha Sharygina
Natasha Sharygina

1 January 2005 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
BCByron Cook
Byron Cook
DKDaniel Kroening
Daniel Kroening
NSNatasha Sharygina
Natasha Sharygina

30 March 2022
Verified
Book Chapter
Open access
PDF file
MBMartin Blicha
Martin Blicha
GFGrigory Fedyukovich
Grigory Fedyukovich
AHAntti E. J. Hyvärinen
Antti E. J. Hyvärinen
NSNatasha Sharygina
Natasha Sharygina
While model checking safety of infinite-state systems by inferring state invariants has steadily improved recently, most verification tools still rely on a technique based on bounded model checking to detect safety violations. In particular, the current techniques typically analyze executions by unfolding transitions one step at a time, and the slow growth of execution length prevents detection of deep counterexamples before the tool reaches its limits on computations. We propose a novel model-checking algorithm that is capable of both proving unbounded safety and finding long counterexamples. The idea is to use Craig interpolation to guide the creation of symbolic abstractions ofexponentially longer sequences of transitions. Our experimental analysis shows that on unsafe benchmarks with deep counterexamples our implementation can detect faulty executions that are at least an order of magnitude longer than those detectable by the state-of-the-art tools.

13 March 2023 in ACM Transactions on Privacy and Security
Verified
Journal Article
Open access
RORodrigo Otoni
Rodrigo Otoni
MMMatteo Marescotti
Matteo Marescotti
LALeonardo Alt
Leonardo Alt
PEPatrick Eugster
Patrick Eugster
AHAntti E. J. Hyvärinen
Antti E. J. Hyvärinen
NSNatasha Sharygina
Natasha Sharygina
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 lost in the past due to vulnerabilities. Formal verification is thus a necessity, but smart contracts challenge the existing highly efficient techniques routinely applied in the symbolic verification of software, due to specificities not present in general programming languages. A common feature of existing works in this area is the attempt to reuse off-the-shelf verification tools designed for general programming languages. This reuse can lead to inefficiency and potentially unsound results, as domain translation is required. In this article, we describe a carefully crafted approach that directly models the central aspects of smart contracts natively, going from the contract to its logical representation without intermediary steps. We use the expressive and highly automatable logic of constrained Horn clauses for modeling and instantiate our approach to the Solidity language. A tool implementing our approach, called Solicitous , was developed and integrated into the SMTChecker module of the Solidity compiler solc. We evaluated our approach on an extensive benchmark set containing 22,446 real-world smart contracts deployed on the Ethereum blockchain over a 27-month period. The results show that our approach is able to establish safety of significantly more contracts than comparable, publicly available verification tools, with an order of magnitude increase in the percentage of formally verified contracts.