Demo Data from EDBT 2026 / reviewers in the wild / expert
Lucas Brutschy
dblp:07/9126
· DBLP profile ↗
6ranked-venue papers
4as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 6 · 4 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
3 papers |
Program analysis · 62% Compilers and program optimization · 14% Empirical software engineering · 12% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Distributed systems · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Transaction processing and concurrency control · 100% | |
| Network and information security
1 paper |
Web and mobile security · 50% Authentication and access control · 50% |
Topics — the 13 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis
static analysis |
0.7 | 3 | 2018 | Static serializability analysis for causal consistency · PLDI 2018 ShamDroid: gracefully degrading functionality in the presence of limited resource access · OOPSLA 2015 Static analysis for independent app developers · OOPSLA 2014 |
Distributed systems
consistency models |
0.6 | 2 | 2018 | Static serializability analysis for causal consistency · PLDI 2018 Serializability for eventual consistency: criterion, analysis, and applications · POPL 2017 |
Distributed systems › consistency models
causal consistency |
0.3 | 1 | 2018 | Static serializability analysis for causal consistency · PLDI 2018 |
Transaction processing and concurrency control
correctness criteria |
0.3 | 1 | 2017 | Serializability for eventual consistency: criterion, analysis, and applications · POPL 2017 |
Transaction processing and concurrency control
serializability |
0.3 | 1 | 2017 | Serializability for eventual consistency: criterion, analysis, and applications · POPL 2017 |
Distributed systems › consistency models
eventual consistency |
0.3 | 1 | 2017 | Serializability for eventual consistency: criterion, analysis, and applications · POPL 2017 |
Distributed systems › replication › replicated data management
replicated data stores |
0.3 | 1 | 2017 | Serializability for eventual consistency: criterion, analysis, and applications · POPL 2017 |
Web and mobile security
mobile security |
0.2 | 1 | 2015 | ShamDroid: gracefully degrading functionality in the presence of limited resource access · OOPSLA 2015 |
Authentication and access control › access control models
permission models |
0.2 | 1 | 2015 | ShamDroid: gracefully degrading functionality in the presence of limited resource access · OOPSLA 2015 |
Program analysis › static analysis
program slicing |
0.2 | 1 | 2015 | ShamDroid: gracefully degrading functionality in the presence of limited resource access · OOPSLA 2015 |
Compilers and program optimization
program transformation |
0.2 | 1 | 2015 | ShamDroid: gracefully degrading functionality in the presence of limited resource access · OOPSLA 2015 |
Empirical software engineering › mining software repositories
mobile app analysis |
0.2 | 1 | 2014 | Static analysis for independent app developers · OOPSLA 2014 |
Software maintenance and evolution
software ecosystems |
0.2 | 1 | 2014 | Static analysis for independent app developers · OOPSLA 2014 |
Methods — techniques the papers use, named apart from their topics
static analysis · 0.7formal specification · 0.6program slicing · 0.4constraint solving · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Static serializability analysis for causal consistencyabstractMany distributed databases provide only weak consistency guarantees to reduce synchronization overhead and remain available under network partitions. However, this leads to behaviors not possible under stronger guarantees. Such behaviors can easily defy programmer intuition and lead to errors that are notoriously hard to detect. Lucas Brutschy, Dimitar Dimitrov 0004, Peter Müller 0001, Martin T. Vechev |
PLDI | 1 |
| 2017 | Serializability for eventual consistency: criterion, analysis, and applicationsabstractDeveloping and reasoning about systems using eventually consistent data stores is a difficult challenge due to the presence of unexpected behaviors that do not occur under sequential consistency. A fundamental problem in this setting is to identify a correctness criterion that precisely captures intended application behaviors yet is generic enough to be applicable to a wide range of applications. Lucas Brutschy, Dimitar Dimitrov 0004, Peter Müller 0001, Martin T. Vechev |
POPL | 1 |
| 2015 | ShamDroid: gracefully degrading functionality in the presence of limited resource accessabstractGiven a program whose functionality depends on access to certain external resources, we investigate the question of how to gracefully degrade functionality when a subset of those resources is unavailable. The concrete setting motivating this problem statement is mobile applications, which rely on contextual data (e.g., device identifiers, user location and contacts, etc.) to fulfill their functionality. In particular, we focus on the Android platform, which mediates access to resources via an installation-time permission model. On the one hand, granting an app the permission to access a resource (e.g., the device ID) entails privacy threats (e.g., releasing the device ID to advertising servers). On the other hand, denying access to a resource could render the app useless (e.g., if inability to read the device ID is treated as an error state). Our goal is to specialize an existing Android app in such a way that it is disabled from accessing certain sensitive resources (or contextual data) as specified by the user, while still being able to execute functionality that does not depend on those resources. We present ShamDroid, a program transformation algorithm, based on specialized forms of program slicing, backwards static analysis and constraint solving, that enables the use of Android apps with partial permissions. We rigorously state the guarantees provided by ShamDroid w.r.t. functionality maximization. We provide an evaluation over the top 500 Google Play apps and report on an extensive comparative evaluation of ShamDroid against three other state-of-the-art solutions (APM, XPrivacy, and Google App Ops) that mediate resource access at the system (rather than app) level. ShamDroid performs better than all of these tools by a significant margin, leading to abnormal behavior in only 1 out of 27 apps we manually investigated, compared to the other solutions, which cause crashes and abnormalities in 9 or more of the apps. This demonstrates the importance of performing app-sensitive mocking. Lucas Brutschy, Pietro Ferrara 0001, Omer Tripp, Marco Pistoia |
OOPSLA | 1 |
| 2014 | TouchCost: Cost Analysis of TouchDevelop Scripts
Pietro Ferrara 0001, Daniel Schweizer, Lucas Brutschy |
FASE | 3 |
| 2014 | Static analysis for independent app developersabstractMobile app markets have lowered the barrier to market entry for software producers. As a consequence, an increasing number of independent app developers offer their products, and recent platforms such as the MIT App Inventor and Microsoft's TouchDevelop enable even lay programmers to develop apps and distribute them in app markets. Lucas Brutschy, Pietro Ferrara 0001, Peter Müller 0001 |
OOPSLA | 1 |
| 2011 | Access Analysis-Based Tight Localization of Abstract Memories
Hakjoo Oh, Lucas Brutschy, Kwangkeun Yi |
VMCAI | 2 |