SPLASH 2020
Sun 15 - Sat 21 November 2020 Online Conference
Wed 18 Nov 2020 15:00 - 15:20 at SPLASH-I - W-5 Chair(s): Mohsen Lesani, Dan Barowy
Thu 19 Nov 2020 03:00 - 03:20 at SPLASH-I - W-5 Chair(s): Nengkun Yu, Filip Křikava

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 definitions 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 (247 issues found in 47 open-source projects have been confirmed and fixed by the upstream developers), and (2) much faster than a state-of-the-art tool for Make builds (the median and average speedup is 39X and 74X respectively).

Conference Day
Wed 18 Nov

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

15:00 - 16:20
W-5OOPSLA at SPLASH-I +12h
Chair(s): Mohsen LesaniUniversity of California at Riverside, USA, Dan BarowyWilliams College
15:00
20m
Talk
A Model for Detecting Faults in Build Specifications
OOPSLA
Thodoris SotiropoulosAthens University of Economics and Business, Stefanos ChaliasosAthens University of Economics and Business, Dimitris MitropoulosAthens University of Economics and Business, Diomidis SpinellisAthens University of Economics and Business
Link to publication DOI Pre-print Media Attached
15:20
20m
Talk
Persistent Owicki-Gries Reasoning: A Program Logic for Reasoning about Persistent Programs on Intel-x86
OOPSLA
Azalea RaadImperial College London, Ori LahavTel Aviv University, Viktor VafeiadisMPI-SWS
Link to publication DOI Media Attached
15:40
20m
Talk
Structure Interpretation of Text Formats
OOPSLA
Sumit GulwaniMicrosoft, Vu LeMicrosoft, Arjun RadhakrishnaMicrosoft, Ivan RadičekMicrosoft, Mohammad RazaMicrosoft
Link to publication DOI Media Attached
16:00
20m
Talk
Statically Verified Refinements for Multiparty Protocols
OOPSLA
Fangyi ZhouImperial College London, Francisco FerreiraImperial College London, Raymond HuUniversity of Hertfordshire, Rumyana NeykovaBrunel University London, Nobuko YoshidaImperial College London
Link to publication DOI Pre-print Media Attached

Conference Day
Thu 19 Nov

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

03:00 - 04:20
W-5OOPSLA at SPLASH-I
Chair(s): Nengkun YuUniversity of Technology Sydney, Filip KřikavaCzech Technical University
03:00
20m
Talk
A Model for Detecting Faults in Build Specifications
OOPSLA
Thodoris SotiropoulosAthens University of Economics and Business, Stefanos ChaliasosAthens University of Economics and Business, Dimitris MitropoulosAthens University of Economics and Business, Diomidis SpinellisAthens University of Economics and Business
Link to publication DOI Pre-print Media Attached
03:20
20m
Talk
Persistent Owicki-Gries Reasoning: A Program Logic for Reasoning about Persistent Programs on Intel-x86
OOPSLA
Azalea RaadImperial College London, Ori LahavTel Aviv University, Viktor VafeiadisMPI-SWS
Link to publication DOI Media Attached
03:40
20m
Talk
Structure Interpretation of Text Formats
OOPSLA
Sumit GulwaniMicrosoft, Vu LeMicrosoft, Arjun RadhakrishnaMicrosoft, Ivan RadičekMicrosoft, Mohammad RazaMicrosoft
Link to publication DOI Media Attached
04:00
20m
Talk
Statically Verified Refinements for Multiparty Protocols
OOPSLA
Fangyi ZhouImperial College London, Francisco FerreiraImperial College London, Raymond HuUniversity of Hertfordshire, Rumyana NeykovaBrunel University London, Nobuko YoshidaImperial College London
Link to publication DOI Pre-print Media Attached