EDBT 2026 Demo / reviewers in the wild / expert
Weiwei Xiong
dblp:61/2220
· DBLP profile ↗
7ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4Software engineering, systems software and programming languages · 4 · 1 first-authorSecurity and privacy · 1
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
6 papers |
Debugging and program repair · 33% Concurrent programming · 32% Program analysis · 19% | |
| Network and information security
1 paper |
Systems and software security · 100% |
Topics — the 15 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Concurrent programming
concurrency bugs |
0.2 | 2 | 2010 | Ad Hoc Synchronization Considered Harmful · OSDI 2010 PRES: probabilistic replay with execution sketching on multiprocessors · SOSP 2009 |
Concurrent programming › concurrency bug detection
data race detection |
0.1 | 1 | 2011 | ATDetector: improving the accuracy of a commercial data race detector by identifying address transfer · MICRO 2011 |
Program analysis
dynamic analysis |
0.1 | 1 | 2011 | ATDetector: improving the accuracy of a commercial data race detector by identifying address transfer · MICRO 2011 |
Program analysis › static analysis › bug detection
false positive reduction |
0.1 | 1 | 2011 | ATDetector: improving the accuracy of a commercial data race detector by identifying address transfer · MICRO 2011 |
Debugging and program repair
root cause analysis |
0.1 | 1 | 2010 | SherLog: error diagnosis by connecting clues from run-time logs · ASPLOS 2010 |
Concurrent programming
synchronization |
0.1 | 1 | 2010 | Ad Hoc Synchronization Considered Harmful · OSDI 2010 |
Debugging and program repair
bug reproduction |
0.1 | 1 | 2009 | PRES: probabilistic replay with execution sketching on multiprocessors · SOSP 2009 |
Debugging and program repair › record and replay
deterministic replay |
0.1 | 1 | 2009 | PRES: probabilistic replay with execution sketching on multiprocessors · SOSP 2009 |
Debugging and program repair
fault localization |
0.1 | 1 | 2009 | PRES: probabilistic replay with execution sketching on multiprocessors · SOSP 2009 |
Debugging and program repair › automated program repair
patch validation |
0.1 | 1 | 2009 | Efficient online validation with delta execution · ASPLOS 2009 |
Software testing
software validation |
0.1 | 1 | 2009 | Efficient online validation with delta execution · ASPLOS 2009 |
Concurrent programming
concurrency bug detection |
0.0 | 1 | 2011 | ATDetector: improving the accuracy of a commercial data race detector by identifying address transfer · MICRO 2011 |
Software testing
regression testing |
0.0 | 1 | 2009 | Efficient online validation with delta execution · ASPLOS 2009 |
Processor architecture and microarchitecture
multicore design |
0.0 | 1 | 2009 | PRES: probabilistic replay with execution sketching on multiprocessors · SOSP 2009 |
Program analysis
specification mining |
0.0 | 1 | 2008 | AutoISES: Automatically Inferring Security Specification and Detecting Violations · USENIX Security Symposium 2008 |
Methods — techniques the papers use, named apart from their topics
probabilistic replay · 0.2execution sketching · 0.2address transfer identification · 0.1synchronization analysis · 0.1log analysis · 0.1causality inference · 0.1delta execution · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | ATDetector: improving the accuracy of a commercial data race detector by identifying address transferabstractIn order to take advantage of multi-core hardware, more and more applications are becoming multi-threaded. Unfortunately concurrent programs are prone to bugs, such as data races. Recently much work has been devoted to detecting data races in multi-threaded programs. Most tools, however, require the accurate knowledge of synchronizations in the program, and may otherwise suffer from false positives in race detection, limiting their usability. To address this problem, some tools such as Intel® Inspector provide mechanisms for suppressing false positives and/or annotating synchronizations not automatically recognized by the tools. However, they require users' input or even changes of the source code. Weiwei Xiong, Yang Liu 0044, Yuanyuan Zhou 0001 |
MICRO | 2 |
| 2010 | SherLog: error diagnosis by connecting clues from run-time logsabstractComputer systems often fail due to many factors such as software bugs or administrator errors. Diagnosing such production run failures is an important but challenging task since it is difficult to reproduce them in house due to various reasons: (1) unavailability of users' inputs and file content due to privacy concerns; (2) difficulty in building the exact same execution environment; and (3) non-determinism of concurrent executions on multi-processors. Ding Yuan 0004, Haohui Mai, Weiwei Xiong, Lin Tan 0001, Yuanyuan Zhou 0001, Shankar Pasupathy |
ASPLOS | 3 |
| 2010 | Ad Hoc Synchronization Considered Harmful
Weiwei Xiong, Yuanyuan Zhou 0001 |
OSDI | 1 |
| 2009 | StealthTest: Low Overhead Online Software Testing Using Transactional MemoryabstractSoftware testing is hard. The emergence of multicore architectures and the proliferation of bug-prone multithreaded software makes testing even harder. To this end, researchers have proposed methods to continue testing software after deployment, e.g., in vivo (IV) testing and delta execution (DE) patch testing. These on-line techniques typically fork new processes to hide the functional impact of testing. Unfortunately, the high overhead of fork() significantly degrades performance. To reduce the performance overhead of online testing, we adapt transactional memory (TM) to isolate the functional effects of tests with minimal impact on system performance. We propose StealthTest, an interface that exposes TM transactions as the key mechanism for executing tests. It allows online tests to work on a consistent view of memory without the overhead of creating new processes. Moreover, explicitly aborting the test transaction after it is done guarantees that its changes are invisible to the rest of the system. Thus, StealthTest promises transparent online testing. We demonstrate two test frameworks utilizing StealthTest - StealthlV and StealthDE - that improve on previously proposed fork-based in vivo testing and delta execution frameworks respectively. Implementing StealthTest on top of three software TM (STM) systems - TL2 STM, Intel STM and a pin-based STM- we demonstrate that StealthTest-based frameworks can (a) run a wide range of online tests and (b) execute many more tests with low overhead. StealthTest provides another motivation for efficient TM implementations by extending TM's applicability to a critical software engineering challenge. Jayaram Bobba, Weiwei Xiong, Luke Yen, Mark D. Hill, David A. Wood 0001 |
PACT | 2 |
| 2009 | Efficient online validation with delta executionabstractSoftware systems are constantly changing. Patches to fix bugs and patches to add features are all too common. Every change risks breaking a previously working system. Hence administrators loathe change, and are willing to delay even critical security patches until after fully validating their correctness. Compared to off-line validation, on-line validation has clear advantages since it tests against real life workloads. Yet unfortunately it imposes restrictive overheads as it requires running the old and new versions side-by-side. Moreover, due to spurious differences (e.g. event timing, random number generation, and thread interleavings), it is difficult to compare the two for validation. Joseph A. Tucek, Weiwei Xiong, Yuanyuan Zhou 0001 |
ASPLOS | 2 |
| 2009 | PRES: probabilistic replay with execution sketching on multiprocessorsabstractBug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challenging. Previous techniques either incur large overhead or require new non-trivial hardware extensions. Yuanyuan Zhou 0001, Weiwei Xiong, Zuoning Yin, Rini T. Kaushik, Kyu H. Lee, Shan Lu 0001 |
SOSP | 3 |
| 2008 | AutoISES: Automatically Inferring Security Specification and Detecting Violations
Lin Tan 0001, Xiaolan Zhang 0001, Xiao Ma 0014, Weiwei Xiong, Yuanyuan Zhou 0001 |
USENIX Security Symposium | 4 |