Consolidation of Ground Truth Sets for Weakness Detection in Smart Contracts

Smart contracts are small programs on the blockchain that often handle valuable assets. Vulnerabilities in smart contracts can be costly, as time has shown over and over again. Countermeasures are high in demand and include best practice recommendations as well as tools supporting development, program verification, and post-deployment analysis. Many tools focus on detecting the absence or presence of a subset of the known vulnerabilities, delivering results of varying quality. Most comparative tool evaluations resort to selecting a handful of tools and testing them against each other. In the best case, the evaluation is based on a smallish ground truth. For Ethereum, there are commendable efforts by several author groups to manually classify contracts. However, a comprehensive ground truth is still lacking. In this work, we construct a ground truth based on publicly available benchmark sets for Ethereum smart contracts with manually checked ground truth data. We develop a method to unify these sets. Additionally, we devise strategies for matching entries that pertain to the same contract, such that we can determine overlaps and disagreements between the sets and consolidate the disagreements. Finally, we assess the quality of the included ground truth sets. Our work reduces inconsistencies, redundancies, and incompleteness while increasing the number of data points and heterogeneity

SmartBugs 2.0: An Execution Framework for Weakness Detection in Ethereum Smart Contracts

Smart contracts are blockchain programs that often handle valuable assets. Writing secure smart contracts is far from trivial, and any vulnerability may lead to significant financial losses. To support developers in identifying and eliminating vulnerabilities, methods and tools for the automated analysis have been proposed. However, the lack of commonly accepted benchmark suites and performance metrics makes it difficult to compare and evaluate such tools. Moreover, the tools are heterogeneous in their interfaces and reports as well as their runtime requirements, and installing several tools is time-consuming. In this paper, we present SmartBugs 2.0, a modular execution framework. It provides a uniform interface to 19 tools aimed at smart contract analysis and accepts both Solidity source code and EVM bytecode as input. After describing its architecture, we highlight the features of the framework. We evaluate the framework via its reception by the community and illustrate its scalability by describing its role in a study involving 3.25 million analyses

Labeled calculi and finite-valued logics

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite-valued logic if the labels are interpreted as sets of truth values (sets-as-signs). Furthermore, it is shown that any finitevalued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the number of truth values, and it is shown that this bound is tight. Keywords: finite-valued logic, labeled calculus, signed formula, sets-as-sign

Targeted Proteolysis of Plectin Isoform 1a Accounts for Hemidesmosome Dysfunction in Mice Mimicking the Dominant Skin Blistering Disease EBS-Ogna

Autosomal recessive mutations in the cytolinker protein plectin account for the multisystem disorders epidermolysis bullosa simplex (EBS) associated with muscular dystrophy (EBS-MD), pyloric atresia (EBS-PA), and congenital myasthenia (EBS-CMS). In contrast, a dominant missense mutation leads to the disease EBS-Ogna, manifesting exclusively as skin fragility. We have exploited this trait to study the molecular basis of hemidesmosome failure in EBS-Ogna and to reveal the contribution of plectin to hemidesmosome homeostasis. We generated EBS-Ogna knock-in mice mimicking the human phenotype and show that blistering reflects insufficient protein levels of the hemidesmosome-associated plectin isoform 1a. We found that plectin 1a, in contrast to plectin 1c, the major isoform expressed in epidermal keratinocytes, is proteolytically degraded, supporting the notion that degradation of hemidesmosome-anchored plectin is spatially controlled. Using recombinant proteins, we show that the mutation renders plectin's 190-nm-long coiled-coil rod domain more vulnerable to cleavage by calpains and other proteases activated in the epidermis but not in skeletal muscle. Accordingly, treatment of cultured EBS-Ogna keratinocytes as well as of EBS-Ogna mouse skin with calpain inhibitors resulted in increased plectin 1a protein expression levels. Moreover, we report that plectin's rod domain forms dimeric structures that can further associate laterally into remarkably stable (paracrystalline) polymers. We propose focal self-association of plectin molecules as a novel mechanism contributing to hemidesmosome homeostasis and stabilization

On the Word, Subsumption, and Complement Problems for Recurrent Term Schematizations

We investigate the word and the subsumption problems for recurrent term schematizations, which are a special type of constraints based on iteration. By means of unication, we reduce these problems to the 2 -fragment of linear Diophantine equations over non-negative integers. Our approach is applicable to all recurrent term schematizations having a nitary unication algorithm. Furthermore, we study a particular form of the complement problem. Given a nite set of terms, we ask whether its complement can be nitely represented by schematizations, using only the equality predicate without negation. The answer is negative as there are ground terms too complex to be represented by schematizations with limited resources. 1 Introduction Innite sets of rst-order terms with structural similarities appear frequently in several branches of automated deduction, like logic programming, model building, term rewriting, equational uni- cation, or clausal theorem proving. They are usually produ..