Demo Data from EDBT 2026 / reviewers in the wild / expert
Laesang Jung
dblp:425/9438
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 since 2021
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 |
Electronic design automation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › hardware verification and test
design for testability |
1.0 | 1 | 2026 | CLAPS: A Graph Clustering-Based Approach for Partial Scan Design · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Electronic design automation › hardware verification and test › design for testability › scan design
partial scan |
1.0 | 1 | 2026 | CLAPS: A Graph Clustering-Based Approach for Partial Scan Design · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Electronic design automation › hardware verification and test › test generation
sequential circuit test generation |
0.3 | 1 | 2026 | CLAPS: A Graph Clustering-Based Approach for Partial Scan Design · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Electronic design automation › hardware verification and test
test generation |
0.3 | 1 | 2026 | CLAPS: A Graph Clustering-Based Approach for Partial Scan Design · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Methods — techniques the papers use, named apart from their topics
graph clustering · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | CLAPS: A Graph Clustering-Based Approach for Partial Scan DesignabstractScan is one of the representative Design for Testability (DFT) techniques designed to test sequential circuits. However, the additional hardware overhead and performance degradation caused by scan insertion can be unacceptable in specific designs. Partial scan has been applied as an alternative to the scan to balance these issues. However, previous cell selection algorithms accompany high computational complexity depending on the number of circuit components including flip-flops, and do not sufficiently consider the analysis of large-scale circuits. In this paper, a graph theory-based partial scan approach is proposed to effectively address the issues caused by scan insertion and reduce the load of structural analysis. The proposed algorithm partitions the circuit into multiple portions using graph clustering. Scan cells are selected from each subgraph to reduce sequential test generation complexity and improve testability. By partially analyzing the circuit, the proposed approach not only addresses the complexity problem of structural analysis in large-scale circuits but also can be generally applied regardless of circuit size or the number of components. The experimental results show that the proposed algorithm achieves significantly reduced processing time in seconds and reduces scan cells by approximately 11.47% with only 0.21% of test coverage loss on average compared to full scan design. Jaeyoung Joung, Laesang Jung, Sungho Kang 0001 |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 5 |
| 2026 | TOPS: Topology-Based Partial Scan for Stuck-At and Delay TestingabstractPartial scan design reduces the shortcomings of full-scan design while retaining its advantages by selectively converting flip-flops in a circuit. In many cases, specific flip-flops cannot be converted to scan cells due to design constraints. In this paper, a topology-based partial scan method is proposed to consider both stuck-at and delay testing. The need for delay testing is growing, yet conventional partial scan methods are ineffective for delay fault models. The proposed method should consider not only stuck-at fault models but also delay fault models. The proposed method introduces three processes. First, controllable flip-flops are selected for the shift operation without reducing circuit controllability. Second, observable flip-flops are selected for the capture operation without reducing circuit observability. Third, a logic topology-based algorithm is applied to ensure that both stuck-at and delay testing are considered in the selection process. As a result, the chosen flip-flops preserve controllability and observability close to that of a full-scan design, allowing the partial scan to remain effective for delay testing. Experimental results show that the proposed method achieves higher test coverage than the previous methods and enables efficient scan-based testing for both stuck-at and transition-delay fault models. Jaeyoung Joung, Laesang Jung, Sungho Kang 0001 |
IEEE Trans. Circuits Syst. I Regul. Pap. | 5 |