Thu 16 Jun 2022 15:30 - 15:50 at Cockatoo - Testing Chair(s): Yu Feng

Incremental and parallel builds are crucial features of modern build systems. Parallelism enables fast builds by running independent tasks simultaneously, while incrementality saves time and computing resources by processing the build operations that were affected by a particular code change. Writing build scripts that lead to error-free incremental and parallel builds is a challenging task. This is mainly because developers are often unable to predict the effects of build operations on the file system and how different build operations interact with each other. Faulty build scripts may seriously degrade the reliability of automated builds, as they cause build failures, and non-deterministic and incorrect outputs.

To reason about arbitrary build executions, we present BuildFS, a generally-applicable model that takes into account the specification (as declared in build scripts) and the actual behavior (low-level file system operation) of build operations. We then formally define different types of faults related to incremental and parallel builds in terms of the conditions under which a file system operation violates the specification of a build operation. Our testing approach, which relies on the proposed model, analyzes the execution of single full build, translates it into BuildFS, and uncovers faults by checking for corresponding violations.

We evaluate the effectiveness, efficiency, and applicability of our approach by examining 612 Make and Gradle projects. Notably, thanks to our treatment of build executions, our method is the first to handle JVM-oriented build systems. The results indicate that our approach is (1) able to uncover several important issues (245 issues found in 45 open-source projects have been confirmed and fixed by the upstream developers), and (2) up to six orders of magnitude faster than a state-of-the-art tool for Make builds.

Thu 16 Jun

Displayed time zone: Pacific Time (US & Canada) change

15:30 - 16:50
TestingSIGPLAN Track at Cockatoo
Chair(s): Yu Feng University of California, Santa Barbara
15:30
20m
Talk
(OOPSLA 2020) A Model for Detecting Faults in Build Specifications
SIGPLAN Track
Thodoris Sotiropoulos Athens University of Economics and Business, Stefanos Chaliasos Imperial College London, Dimitris Mitropoulos University of Athens, Diomidis Spinellis Athens University of Economics and Business & Delft University of Technology
15:50
20m
Talk
(OOPSLA 2020) Unifying Execution of Imperative Generators and Declarative Specifications
SIGPLAN Track
Pengyu Nie University of Texas at Austin, Marinela Parovic University of Texas at Austin, Zhiqiang Zang University of Texas at Austin, Sarfraz Khurshid University of Texas at Austin, Aleksandar Milicevic Microsoft, Milos Gligoric University of Texas at Austin
16:10
20m
Talk
(PLDI 2021) Logical Bytecode Reduction
SIGPLAN Track
Christian Gram Kalhauge Technical University of Denmark, Jens Palsberg University of California, Los Angeles (UCLA)
16:30
20m
Talk
(PLDI 2021) Quantum abstract interpretation
SIGPLAN Track
Nengkun Yu UTS, Jens Palsberg University of California, Los Angeles (UCLA)
Link to publication DOI Authorizer link Pre-print