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

Deepali Bhardwaj

dblp:60/5093 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Software engineering, systems software and programming languages · 2

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 83% Cloud and datacenter computing · 17%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cloud storage
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems
fault tolerance
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems › replication
geo-replication
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems › fault tolerance
high availability
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems
replication
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems › consistency models
strong consistency
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Program analysis
dynamic analysis
0.112006
Perracotta: mining temporal API rules from imperfect traces · ICSE 2006

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

trace analysis · 0.1approximate inference · 0.1
YearPublicationVenuePosition
2011 Windows Azure Storage: a highly available cloud storage service with strong consistency
abstract
Windows Azure Storage (WAS) is a cloud storage system that provides customers the ability to store seemingly limitless amounts of data for any duration of time. WAS customers have access to their data from anywhere at any time and only pay for what they use and store. In WAS, data is stored durably using both local and geographic replication to facilitate disaster recovery. Currently, WAS storage comes in the form of Blobs (files), Tables (structured storage), and Queues (message delivery). In this paper, we describe the WAS architecture, global namespace, and data model, as well as its resource provisioning, load balancing, and replication systems.
Brad Calder, Ju Wang 0010, Aaron Ogus, Niranjan Nilakantan, Arild Skjolsvold, Sam McKelvie, Yikang Xu, Shashwat Srivastav, Jiesheng Wu, Huseyin Simitci, Jaidev Haridas, Chakravarthy Uddaraju, Hemal Khatri, Andrew Edwards, Vaman Bedekar, Shane Mainali, Rafay Abbasi, Mian Fahim ul Haq, Muhammad Ikram ul Haq, Deepali Bhardwaj, Sowmya Dayanand, Anitha Adusumilli, Marvin McNett, Sriram Sankaran, Kavitha Manivannan, Leonidas Rigas
SOSP21
2006 Perracotta: mining temporal API rules from imperfect traces
abstract
Dynamic inference techniques have been demonstrated to provide useful support for various software engineering tasks including bug finding, test suite evaluation and improvement, and specification generation. To date, however, dynamic inference has only been used effectively on small programs under controlled conditions. In this paper, we identify reasons why scaling dynamic inference techniques has proven difficult, and introduce solutions that enable a dynamic inference technique to scale to large programs and work effectively with the imperfect traces typically available in industrial scenarios. We describe our approximate inference algorithm, present and evaluate heuristics for winnowing the large number of inferred properties to a manageable set of interesting properties, and report on experiments using inferred properties. We evaluate our techniques on JBoss and the Windows kernel. Our tool is able to infer many of the properties checked by the Static Driver Verifier and leads us to discover a previously unknown bug in Windows.
Jinlin Yang, David Evans 0001, Deepali Bhardwaj, Thirumalesh Bhat, Manuvir Das
ICSE3