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

Jia-Jen Yeh

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

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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.

Theoretical computer science
1 paper
Automated reasoning and model checking · 67% Mathematical optimization · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › submodular optimization
coverage problem
0.212014
Accelerating Coverage Estimation Through Partial Model Checking · IEEE Trans. Computers 2014
Automated reasoning and model checking
model checking
0.212014
Accelerating Coverage Estimation Through Partial Model Checking · IEEE Trans. Computers 2014
Electronic design automation › hardware verification and test
hardware verification
0.112014
Accelerating Coverage Estimation Through Partial Model Checking · IEEE Trans. Computers 2014

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

partial model checking · 0.4mutation analysis · 0.4
YearPublicationVenuePosition
2014 Accelerating Coverage Estimation Through Partial Model Checking
abstract
In model checking a system design against a set of properties, coverage estimation is frequently used to measure the amount of system behavior being checked by the properties. A popular coverage estimation method is to mutate the system model and check if the mutation can be detected by the given properties. For each mutation and each property, a full model check is required by some state-of-the-art coverage estimation methods. With such repeated model checking, mutation-based coverage estimation becomes significantly time-consuming. To alleviate this problem, a partial model checking (PMC) technique is proposed to recheck only those system states that were affected by a mutation, thus unnecessary rechecking of a large portion of the system states is avoided and time is saved. The PMC method has been integrated into the State Graph Manipulators model checker. Applying the proposed method to several examples showed that PMC has a saving of 50% to 70% in the coverage estimation time, and a reduction of 90% in mode visits.
Yean-Ru Chen, Jia-Jen Yeh, Pao-Ann Hsiung, Sao-Jie Chen
IEEE Trans. Computers2
2006 Model Checking Timed Systems with Urgencies
Pao-Ann Hsiung, Shangwei Lin 0001, Yean-Ru Chen, Chun-Hsian Huang, Jia-Jen Yeh, Chao-Sheng Lin, Hsiao-Win Liao
ATVA5