Bernhard Scholz

Dr. Bernhard Scholz


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
24 October 2018 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
PDF file
NGNeville Grech
Neville Grech
MKMichael Kong
Michael Kong
AJAnton Jurisevic
Anton Jurisevic
LBLexi Brent
Lexi Brent
BSBernhard Scholz
Bernhard Scholz
YSYannis Smaragdakis
Yannis Smaragdakis
Ethereum is a distributed blockchain platform, serving as an ecosystem for smart contracts: full-fledged inter-communicating programs that capture the transaction logic of an account. Unlike programs in mainstream languages, a gas limit restricts the execution of an Ethereum smart contract: execution proceeds as long as gas is available. Thus, gas is a valuable resource that can be manipulated by an attacker to provoke unwanted behavior in a victim's smart contract (e.g., wasting or blocking funds of said victim). Gas-focused vulnerabilities exploit undesired behavior when a contract (directly or through other interacting contracts) runs out of gas. Such vulnerabilities are among the hardest for programmers to protect against, as out-of-gas behavior may be uncommon in non-attack scenarios and reasoning about it is far from trivial. In this paper, we classify and identify gas-focused vulnerabilities, and present MadMax: a static program analysis technique to automatically detect gas-focused vulnerabilities with very high confidence. Our approach combines a control-flow-analysis-based decompiler and declarative program-structure queries. The combined analysis captures high-level domain-specific concepts (such as "dynamic data structure storage" and "safely resumable loops") and achieves high precision and scalability. MadMax analyzes the entirety of smart contracts in the Ethereum blockchain in just 10 hours (with decompilation timeouts in 8% of the cases) and flags contracts with a (highly volatile) monetary value of over $2.8B as vulnerable. Manual inspection of a sample of flagged contracts shows that 81% of the sampled warnings do indeed lead to vulnerabilities, which we report on in our experiment.

20 December 2019 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
PDF file
MRMukund Raghothaman
Mukund Raghothaman
JMJonathan Mendelson
Jonathan Mendelson
DZDavid Zhao
David Zhao
MNMayur Naik
Mayur Naik
BSBernhard Scholz
Bernhard Scholz
We propose a new approach to synthesize Datalog programs from input-output specifications. Our approach leverages query provenance to scale the counterexample-guided inductive synthesis (CEGIS) procedure for program synthesis. In each iteration of the procedure, a SAT solver proposes a candidate Datalog program, and a Datalog solver evaluates the proposed program to determine whether it meets the desired specification. Failure to satisfy the specification results in additional constraints to the SAT solver. We propose efficient algorithms to learn these constraints based on “ why ” and “ why not ” provenance information obtained from the Datalog solver. We have implemented our approach in a tool called ProSynth and present experimental results that demonstrate significant improvements over the state-of-the-art, including in synthesizing invented predicates, reducing running times, and in decreasing variances in synthesis performance. On a suite of 40 synthesis tasks from three different domains, ProSynth is able to synthesize the desired program in 10 seconds on average per task—an order of magnitude faster than baseline approaches—and takes only under a second each for 28 of them.

12 October 2021
Verified
Book Chapter
Closed access
PDF file
XHXiaowen Hu
Xiaowen Hu
JKJoshua Karp
Joshua Karp
DZDavid Zhao
David Zhao
AZAbdul Zreika
Abdul Zreika
XWXi Wu
Xi Wu
BSBernhard Scholz
Bernhard Scholz

18 June 2021
Verified
Conference Paper
Open access
XHXiaowen Hu
Xiaowen Hu
DZDavid Zhao
David Zhao
HJHerbert Jordan
Herbert Jordan
BSBernhard Scholz
Bernhard Scholz
Datalog is becoming increasingly popular as a standard tool for a variety of use cases. Modern Datalog engines can achieve high performance by specializing data structures for relational operations. For example, the Datalog engine Soufflé achieves high performance with a synthesizer that specializes data structures for relations. However, the synthesizer cannot always be deployed, and a fast interpreter is required. This work introduces the design and implementation of the Soufflé Tree Interpreter (STI). Key for the performance of the STI is the support for fast operations on relations. We obtain fast operations by de-specializing data structures so that they can work in a virtual execution environment. Our new interpreter achieves a competitive performance slowdown between 1.32 and 5.67× when compared to synthesized code. If compile time overheads of the synthesizer are also considered, the interpreter can be 6.46× faster on average for the first run.

11 September 2022
Verified
Book Chapter
Closed access
PDF file
SASamuel Arch
Samuel Arch
XHXiaowen Hu
Xiaowen Hu
DZDavid Zhao
David Zhao
PSPavle Subotić
Pavle Subotić
BSBernhard Scholz
Bernhard Scholz

16 April 2016 in European Radiology
Verified
Journal Article
Closed access
PDF file
AMAngelika Mennecke
Angelika Mennecke
SSStanislav Svergun
Stanislav Svergun
BSBernhard Scholz
Bernhard Scholz
KRKevin Royalty
Kevin Royalty
ADArnd Dörfler
Arnd Dörfler
TSTobias Struffert
Tobias Struffert