메뉴 건너뛰기




Volumn , Issue , 2009, Pages 34-41

CUDA accelerated LTL model checking

Author keywords

[No Author keywords available]

Indexed keywords

HARDWARE ARCHITECTURE; HARDWARE PLATFORM; LTL MODEL-CHECKING; MANY-CORE; MATRIX-VECTOR PRODUCTS; TECHNOLOGICAL DEVELOPMENT; VERIFICATION PROCESS;

EID: 77949635149     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2009.50     Document Type: Conference Paper
Times cited : (28)

References (19)
  • 2
    • 38349063046 scopus 로고    scopus 로고
    • Scalable Multi-core LTL Model-Checking
    • Model Checking Software SPIN 2007, of, Springer
    • J. Barnat, L. Brim, and P. Ročkai. Scalable Multi-core LTL Model-Checking. In Model Checking Software (SPIN 2007), volume 4595 of LNCS, pages 187-203. Springer, 2007.
    • (2007) LNCS , vol.4595 , pp. 187-203
    • Barnat, J.1    Brim, L.2    Ročkai, P.3
  • 3
    • 56749131114 scopus 로고    scopus 로고
    • DiVinE Multi-Core - A Parallel LTL Model-Checker
    • Automated Technology for Verification and Analysis, of, Springer
    • J. Barnat, L. Brim, and P. Ročkai. DiVinE Multi-Core - A Parallel LTL Model-Checker. In Automated Technology for Verification and Analysis, volume 5311 of LNCS, pages 234-239. Springer, 2008.
    • (2008) LNCS , vol.5311 , pp. 234-239
    • Barnat, J.1    Brim, L.2    Ročkai, P.3
  • 4
    • 77949599592 scopus 로고    scopus 로고
    • J. Barnat, L. Brim, and I. Černá. Property Driven Distribution of Nested DFS. In 3rd International Workshop on Verification and Computational Logic (VCL'02), pages 1-10. University of Southampton, UK, Technical Report DSSE-TR-2002-5, 2002.
    • J. Barnat, L. Brim, and I. Černá. Property Driven Distribution of Nested DFS. In 3rd International Workshop on Verification and Computational Logic (VCL'02), pages 1-10. University of Southampton, UK, Technical Report DSSE-TR-2002-5, 2002.
  • 6
    • 70350368872 scopus 로고    scopus 로고
    • Corporation
    • Efficient sparse matrix-vector multiplication on CUDA, NVR-2008-004, NVIDIA, December
    • Nathan Bell and Michael Garland. Efficient sparse matrix-vector multiplication on CUDA. NVIDIA Technical Report NVR-2008-004, NVIDIA Corporation, December 2008.
    • (2008) NVIDIA Technical Report
    • Bell, N.1    Garland, M.2
  • 7
    • 32044445465 scopus 로고    scopus 로고
    • Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking
    • Formal Methods in Computer-Aided Design FMCAD'04, of, Springer
    • L. Brim, I. Černá, P. Moravec, and J. Šimša. Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. In Formal Methods in Computer-Aided Design (FMCAD'04), volume 3312 of LNCS, pages 352-366. Springer, 2004.
    • (2004) LNCS , vol.3312 , pp. 352-366
    • Brim, L.1    Černá, I.2    Moravec, P.3    Šimša, J.4
  • 8
    • 32044467718 scopus 로고    scopus 로고
    • How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
    • L. Brim, I. Černá, P. Moravec, and J. Šimša. How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors. ENTCS, 132(2):3-18, 2006.
    • (2006) ENTCS , vol.132 , Issue.2 , pp. 3-18
    • Brim, L.1    Černá, I.2    Moravec, P.3    Šimša, J.4
  • 9
    • 33745787583 scopus 로고    scopus 로고
    • Distributed Explicit Fair Cycle Detection (Set Based Approach)
    • Model Checking Software SPIN'03, of, Springer
    • I. Černá and R. Pelánek. Distributed Explicit Fair Cycle Detection (Set Based Approach). In Model Checking Software (SPIN'03), volume 2648 of LNCS, pages 49-73. Springer, 2003.
    • (2003) LNCS , vol.2648 , pp. 49-73
    • Černá, I.1    Pelánek, R.2
  • 11
    • 77949626307 scopus 로고    scopus 로고
    • NVIDIA CUDA Compute Unified Device Architecture - Programming Guide Version 2.0,. http://www.nvidia.com/object/cuda develop.html, June 2009.
    • NVIDIA CUDA Compute Unified Device Architecture - Programming Guide Version 2.0,. http://www.nvidia.com/object/cuda develop.html, June 2009.
  • 12
    • 84903186573 scopus 로고    scopus 로고
    • Is there a best symbolic cycle-detection algorithm?
    • Tools and Algorithms for the Construction and Analysis of Systems TACAS'01, of, Springer
    • K. Fisler, R. Fraer, G. Kamhi, M. Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), volume 2031 of LNCS, pages 420-434. Springer, 2001.
    • (2001) LNCS , vol.2031 , pp. 420-434
    • Fisler, K.1    Fraer, R.2    Kamhi, G.3    Vardi, M.Y.4    Yang, Z.5
  • 15
    • 16244409154 scopus 로고    scopus 로고
    • Simplified distributed LTL model checking by localizing cycles
    • Technical Report 00176, Institut für Informatik, University Freiburg, Germany, July
    • A. L. Lafuente. Simplified distributed LTL model checking by localizing cycles. Technical Report 00176, Institut für Informatik, University Freiburg, Germany, July 2002.
    • (2002)
    • Lafuente, A.L.1
  • 16
    • 0022075817 scopus 로고
    • Depth-first search is inherrently sequential
    • J.H. Reif. Depth-first search is inherrently sequential. Information Processing Letters, 20(5):229-234, 1985.
    • (1985) Information Processing Letters , vol.20 , Issue.5 , pp. 229-234
    • Reif, J.H.1
  • 17
    • 24644509013 scopus 로고    scopus 로고
    • S. Schwoon and J. Esparza. A Note on On-The-Fly Verification Algorithms. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'05), 3440 of LNCS, pages 174-190. Springer, 2005.
    • S. Schwoon and J. Esparza. A Note on On-The-Fly Verification Algorithms. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'05), volume 3440 of LNCS, pages 174-190. Springer, 2005.
  • 18
    • 0001790593 scopus 로고
    • Depth First Search and Linear Graph Algorithms
    • Januar
    • R. Tarjan. Depth First Search and Linear Graph Algorithms. SIAM Journal on Computing, pages 146-160, Januar 1972.
    • (1972) SIAM Journal on Computing , pp. 146-160
    • Tarjan, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.