scispace - formally typeset
S

Sebastian Elbaum

Researcher at University of Virginia

Publications -  209
Citations -  9610

Sebastian Elbaum is an academic researcher from University of Virginia. The author has contributed to research in topics: Test suite & Regression testing. The author has an hindex of 44, co-authored 199 publications receiving 8704 citations. Previous affiliations of Sebastian Elbaum include Lincoln University (Pennsylvania) & University of Idaho.

Papers
More filters
Proceedings Article

Proceedings of the 37th International Conference on Software Engineering - Volume 1

TL;DR: The ICSE 2015 program spans from Saturday May 16th to Sunday May 24th, following the traditional structure of the core main conference from Wednesday to Friday, complemented by four days of pre-conference and two days of post-conference meetings as discussed by the authors.

The EUSES Web macro Scenario Corpus, Version 1.0

TL;DR: Based on observations of browser users, various scenarios describing tasks that end users would benefit from automating using web macros are compiled, which constitutes a benchmark for evaluating new and improved web macro tools.
Journal ArticleDOI

Characterizing User Responses to Failures in Aerial Autonomous Systems

TL;DR: This letter presents the first study characterizing a user ability to timely report and correct autonomous system failures in the context of small Unmanned Aerial Vehicles, and aims to explore the complex tradespace which designers will encounter when developing effective transitions of control in sUAVs.
Proceedings ArticleDOI

Limitations of Emulating Realistic Network Environments for Correctness Testing of Internet Applications

TL;DR: It is argued that emulating just realistic network environments may be inadequate for detecting hard-to-detect faults that have very low occurrence probabilities but potentially high impact if exposed in the real world.
Proceedings ArticleDOI

Blending kinematic and software models for tighter reachability analysis

TL;DR: This work explores the degree to which bounds manifested in the software can affect the computation of reachable sets, introduces an analysis approach to discover such bounds in code, and illustrates the potential of that approach on two systems.