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

Weijia Deng

dblp:15/1442 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 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
1 paper
Software testing · 100%

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

TopicWeightPapersLastEvidence papers
Software testing › test adequacy › coverage criteria
structural coverage criteria
0.112008
ReqsCov: A Tool for Measuring Test-Adequacy over Requirements · ASE 2008
Software testing
test adequacy
0.112008
ReqsCov: A Tool for Measuring Test-Adequacy over Requirements · ASE 2008

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

linear temporal logic · 0.1
YearPublicationVenuePosition
2008 ReqsCov: A Tool for Measuring Test-Adequacy over Requirements
abstract
When creating test cases for software, a common approach is to create tests that exercise requirements. Determining the adequacy of test cases, however, is generally done through inspection or indirectly by measuring structural coverage of an executable artifact (such as source code or a software model). We present ReqsCov, a tool to directly measure requirements coverage provided by test cases. ReqsCov allows users to measure Linear Temporal Logic requirements coverage using three increasingly rigorous requirements coverage metrics: naive coverage, antecedent coverage, and Unique First Cause coverage. By measuring requirements coverage, users are given insight into the quality of test suites beyond what is available when solely using structural coverage metrics over an implementation.
Matthew Staats, Weijia Deng, Ajitha Rajan, Mats P. E. Heimdahl, Kurt Woodham
ASE2
2005 Extended Symbolic Transition Graphs with Assignment
abstract
An extension of symbolic transition graphs with assignment is proposed which combines the advantages of both the assignment-before-action and the assignment-after-action approaches: like the former it allows a simple set of rules to be designed for generating finite symbolic graphs from regular value-passing process descriptions; like the later it avoids creating multiple copies in the graph for a recursive process definition. Experiences show that, in most cases, considerable reductions in verification time and space can be achieved using the new approach.
Weijia Deng, Huimin Lin
COMPSAC (1)1