Scalable SMT-based verification of GPU kernel functions

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2010, Pages 187-196

  Li, Guodong ^a   Gopalakrishnan, Ganesh ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

concurrency; cuda; formal verification; gpu; satisfiability modulo theories (decision procedures)

Indexed keywords

CONCURRENCY; CUDA; FORMAL VERIFICATIONS; GPU; SATISFIABILITY MODULO THEORIES;

PROGRAM DEBUGGING; PROGRAM PROCESSORS; SOFTWARE ENGINEERING;

FORMAL LOGIC;

EID: 78751475159     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1882291.1882320     Document Type: Conference Paper

References (24)

1. AIKEN, A., AND GAY, D. Barrier inference. In Symposium on the Principles of Programming Languages (POPL) (1998).
2. ALLEN, R., AND KENNEDY, K. Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann, 2001.
3. BOYER, M., SKADRON, K., AND WEIMER, W. Automated dynamic analysis of CUDA programs. In Third Workshop on Software Tools for MultiCore Systems (2008).
4. CLARKE, E. M., GRUMBERG, O., AND PELED, D. A. Model Checking. MIT Press, 2000.
5. COBLEIGH, J. M., CLARKE, L. A., AND OSTERWEIL, L. J. Flavers: A finite state verification technique for software systems. IBM Systems Journal 41, 1 (2002).
6. CSALLNER, C., TILLMANN, N., AND SMARAGDAKIS, Y. DySy: Dynamic symbolic execution for invariant inference. In International Conference on Software Engineering (ICSE) (2008), pp. 281-290.
7. Cuda programming guide version 1.1. http://developer.download.nvidia.com/ compute/cuda/1-1/NVIDIA-CUDA-Programming-Guide-1.1.pdf.
8. EMERSON, E. A., AND KAHLON, V. Reducing model checking of the many to the few. In International Conference on Automated Deduction (CADE) (2000), pp. 236-254.
9. FENG, M., AND LEISERSON, C. E. Efficient detection of determinacy races in cilk programs. In Parallel Algorithms and Architectures (SPAA) (1997).
10. Fermi. http: //www.nvidia.com/object/fermiarchitecture.html.
11. FLANAGAN, C., AND FREUND, S. N. Type-based race detection for Java. In Programming Language Design and Implementation (PLDI) (2000).
12. FLANAGAN, C., AND GODEFROID, P. Dynamic partial-order reduction for model checking software. In Symposium on the Principles of Programming Languages (POPL) (2005), pp. 110-121.
13. GULWANI, S. Speed: Symbolic complexity bound analysis. In Computer Aided Verification (CAV) (2009), pp. 51-62.
14. KIRK, D. B., AND MEI W. HWU, W. Programming Massively Parallel Processors. Morgan Kauffman, 2010.
15. LAHIRI, S. K., QADEER, S., AND RAKAMARIC, Z. Static and precise detection of concurrency errors in systems code using SMT solvers. In Computer Aided Verification (CAV) (2009), pp. 509-524.
16. LI, G., AND GOPALAKRISHNAN, G. Technical Report and PUG Tool Download: http://www.cs.utah.edu/fv/PUG.
17. LI, G., GOPALAKRISHNAN, G., KIRBY, R. M., AND QUINLAN, D. A symbolic verifier for CUDA programs. In PPoPP, Poster Session (2010), pp. 357-358.
18. LI, G., PALMER, R., DELISI, M., GOPALAKRISHNAN, G., AND KIRBY, R. M. Formal specification of MPI 2.0: Case study in specifying a practical concurrent programming API. Sci. Comp. Prog. 75 (2010).
19. NIELSON, F., NIELSON, H. R., AND HANKIN, C. Principles of Program Analysis. Springer-Verlag, 1999.
20. OpenCL. http://www.khronos.org/opencl.
21. The ROSE compiler. http://www.rosecompiler.org/.
22. Satisfiability Modulo Theories Competition (SMT-COMP). http://www.smtcomp.org/2009.
23. TRIPAKIS, S., STERGIOU, C., AND LUBLINERMAN, R. Checking non-interference in SPMD programs. In 2nd USENIX Workshop on Hot Topics in Parallelism (HotPar) (2010).
24. Yices: An SMT solver. http://yices.csl.sri.com.