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

Zhifeng Lai

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

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

Software engineering, systems software and programming languages · 2 · 2 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
Software testing · 51% Concurrent programming · 49%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Concurrent programming › concurrency bugs
atomicity violation
0.112010
Detecting atomic-set serializability violations in multithreaded programs through active randomized testing · ICSE (1) 2010
Concurrent programming
concurrency bugs
0.112010
Detecting atomic-set serializability violations in multithreaded programs through active randomized testing · ICSE (1) 2010
Software testing
concurrency testing
0.112010
Detecting atomic-set serializability violations in multithreaded programs through active randomized testing · ICSE (1) 2010
Software testing › test adequacy
test adequacy criteria
0.112008
Inter-context control-flow and data-flow test adequacy criteria for nesC applications · SIGSOFT FSE 2008
Software testing
random testing
0.012010
Detecting atomic-set serializability violations in multithreaded programs through active randomized testing · ICSE (1) 2010
Internet of things and sensor networks
wireless sensor network
0.012008
Inter-context control-flow and data-flow test adequacy criteria for nesC applications · SIGSOFT FSE 2008

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

thread scheduler control · 0.1active randomized testing · 0.1flowgraph modeling · 0.1flow graph modeling · 0.1
YearPublicationVenuePosition
2010 Detecting atomic-set serializability violations in multithreaded programs through active randomized testing
abstract
Concurrency bugs are notoriously difficult to detect because there can be vast combinations of interleavings among concurrent threads, yet only a small fraction can reveal them. Atomic-set serializability characterizes a wide range of concurrency bugs, including data races and atomicity violations. In this paper, we propose a two-phase testing technique that can effectively detect atomic-set serializability violations. In Phase I, our technique infers potential violations that do not appear in a concrete execution and prunes those interleavings that are violation-free. In Phase II, our technique actively controls a thread scheduler to enumerate these potential scenarios identified in Phase I to look for real violations. We have implemented our technique as a prototype system AssetFuzzer and applied it to a number of subject programs for evaluating concurrency defect analysis techniques. The experimental results show that AssetFuzzer can identify more concurrency bugs than two recent testing tools RaceFuzzer and AtomFuzzer.
Zhifeng Lai, Shing-Chi Cheung, Wing Kwong Chan
ICSE (1)1
2008 Inter-context control-flow and data-flow test adequacy criteria for nesC applications
abstract
NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known as contexts, to perform its actions. However, a high degree of inter-context interleaving in an application can cause it to be error-prone. For instance, a context may mistakenly alter another context's data kept at a shared variable. Existing concurrency testing techniques target testing programs written in general-purpose programming languages, where a small scale of inter-context interleaving between program executions may make these techniques inapplicable. We observe that nesC blocks new context interleaving when handling interrupts, and this feature significantly restricts the scale of inter-context interleaving that may occur in a nesC application. This paper models how operations on different contexts may interleave as inter-context flow graphs. Based on these graphs, it proposes two test adequacy criteria, one on inter-context data-flows and another on inter-context control-flows. It evaluates the proposal by a real-life open-source nesC application. The empirical results show that the new criteria detect significantly more failures than their conventional counterparts.
Zhifeng Lai, Shing-Chi Cheung, Wing Kwong Chan
SIGSOFT FSE1