Presentation 2010-10-14
Accelerating State Reachability Analysis with a GPU
Yoshimitsu NAKADA, Tatsuhiro TSUCHIYA, Tohru KIKUNO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Reachability analysis is the process of exploring the state space of a system under verification. This step is fundamental in automated verification, such as model checking. This paper propose to use a GPU (Graphics Processing Unit) to perform reachability analysis, aiming at speeding up this time-consuming process. A GPU can provide massive parallelism; but because of its high cost of accessing main memory, it has rarely been used for reachability analysis, which is a memory-access-intensive application. By designing a new, GPU-tailored state exploration algorithm, we overcome the difficulty of using a GPU for reachability analysis.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) state reachability analysis / GPGPU / parallel processing
Paper # DC2010-22
Date of Issue

Conference Information
Committee DC
Conference Date 2010/10/7(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Dependable Computing (DC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Accelerating State Reachability Analysis with a GPU
Sub Title (in English)
Keyword(1) state reachability analysis
Keyword(2) GPGPU
Keyword(3) parallel processing
1st Author's Name Yoshimitsu NAKADA
1st Author's Affiliation Osaka University Graduate School of Information Science and Technology()
2nd Author's Name Tatsuhiro TSUCHIYA
2nd Author's Affiliation Osaka University Graduate School of Information Science and Technology
3rd Author's Name Tohru KIKUNO
3rd Author's Affiliation Osaka University Graduate School of Information Science and Technology
Date 2010-10-14
Paper # DC2010-22
Volume (vol) vol.110
Number (no) 229
Page pp.pp.-
#Pages 5
Date of Issue