Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ariel Rabkin

dblp:50/560 · DBLP profile ↗
← Back
8ranked-venue papers
8as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 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
2 papers
Program analysis · 54% Software maintenance and evolution · 23% Debugging and program repair · 23%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
static analysis
0.222011
Precomputing possible configuration error diagnoses · ASE 2011
Static extraction of program configuration options · ICSE 2011
Data stream processing
streaming analytics
0.212014
Aggregation and Degradation in JetStream: Streaming Analytics in the Wide Area · NSDI 2014
Debugging and program repair › automated diagnosis
configuration error diagnosis
0.112011
Precomputing possible configuration error diagnoses · ASE 2011
Program analysis
data flow analysis
0.112011
Precomputing possible configuration error diagnoses · ASE 2011
Software maintenance and evolution
software configuration
0.112011
Precomputing possible configuration error diagnoses · ASE 2011
Distributed systems › distributed system architecture
geo-distributed systems
0.112014
Aggregation and Degradation in JetStream: Streaming Analytics in the Wide Area · NSDI 2014
Debugging and program repair
fault localization
0.012011
Precomputing possible configuration error diagnoses · ASE 2011
Software maintenance and evolution
program comprehension
0.012011
Static extraction of program configuration options · ICSE 2011

Methods — techniques the papers use, named apart from their topics

static dataflow analysis · 0.1static analysis · 0.1failure injection · 0.1
YearPublicationVenuePosition
2014 Aggregation and Degradation in JetStream: Streaming Analytics in the Wide Area
Ariel Rabkin, Matvey Arye, Siddhartha Sen 0001, Vivek S. Pai, Michael J. Freedman
NSDI1
2013 Making Every Bit Count in Wide-Area Analytics
Ariel Rabkin, Matvey Arye, Siddhartha Sen 0001, Vivek S. Pai, Michael J. Freedman
HotOS1
2013 Using clouds for MapReduce measurement assignments
abstract
We describe our experiences teaching MapReduce in a large undergraduate lecture course using public cloud services and the standard Hadoop API. Using the standard API, students directly experienced the quality of industrial big-data tools. Using the cloud, every student could carry out scalability benchmarking assignments on realistic hardware, which would have been impossible otherwise. Over two semesters, over 500 students took our course. We believe this is the first large-scale demonstration that it is feasible to use pay-as-you-go billing in the cloud for a large undergraduate course. Modest instructor effort was sufficient to prevent students from overspending. Average per-pupil expenses in the Cloud were under $45. Students were excited by the assignment: 90% said they thought it should be retained in future course offerings.
Ariel Rabkin, Charles Reiss, Randy H. Katz, David A. Patterson 0001
ACM Trans. Comput. Educ.1
2012 Experiences teaching MapReduce in the cloud
abstract
We describe our experiences teaching MapReduce in a large undergraduate lecture course using public cloud services. Using the cloud, every student could carry out scalability benchmarking assignments on realistic hardware, which would have been impossible otherwise. Over two semesters, over 500 students took our course. We believe this is the first large-scale demonstration that it is feasible to use pay-as-you-go billing in the Cloud for a large undergraduate course. Modest instructor effort was sufficient to prevent students from overspending. Average per-pupil expenses in the Cloud were under $45, less than half our available grant funding. Students were excited by the assignment: 90% said they thought it should be retained in future course offerings.
Ariel Rabkin, Charles Reiss, Randy H. Katz, David A. Patterson 0001
SIGCSE1
2011 Static extraction of program configuration options
abstract
Many programs use a key-value model for configuration options. We examined how this model is used in seven open source Java projects totaling over a million lines of code. We present a static analysis that extracts a list of configuration options for a program. Our analysis finds 95% of the options read by the programs in our sample, making it more complete than existing documentation.
Ariel Rabkin, Randy H. Katz
ICSE1
2011 Precomputing possible configuration error diagnoses
abstract
Complex software packages, particularly systems software, often require substantial customization before being used. Small mistakes in configuration can lead to hard-todiagnose error messages. We demonstrate how to build a map from each program point to the options that might cause an error at that point. This can aid users in troubleshooting these errors without any need to install or use additional tools. Our approach relies on static dataflow analysis, meaning all the analysis is done in advance. We evaluate our work in detail on two substantial systems, Hadoop and the JChord program analysis toolkit, using failure injection and also by using log messages as a source of labeled program points. When logs and stack traces are available, they can be incorporated into the analysis. This reduces the number of false positives by nearly a factor of four for Hadoop, at the cost of approximately one minute's work per unique query.
Ariel Rabkin, Randy H. Katz
ASE1
2010 Chukwa: A System for Reliable Large-Scale Log Collection
Ariel Rabkin, Randy H. Katz
LISA1
2008 Personal knowledge questions for fallback authentication: security questions in the era of Facebook
abstract
Security questions (or challenge questions) are commonly used to authenticate users who have lost their passwords. We examined the password retrieval mechanisms for a number of personal banking websites, and found that many of them rely in part on security questions with serious usability and security weaknesses. We discuss patterns in the security questions we observed. We argue that today's personal security questions owe their strength to the hardness of an information-retrieval problem. However, as personal information becomes ubiquitously available online, the hardness of this problem, and security provided by such questions, will likely diminish over time. We supplement our survey of bank security questions with a small user study that supplies some context for how such questions are used in practice.
Ariel Rabkin
SOUPS1