Checking memory safety with Blast

Lecture Notes in Computer Science

Volumn 3442, Issue , 2005, Pages 2-18

  Beyer, Dirk ^a   Henzinger, Thomas A ^a,b   Jhala, Ranjit ^c   Majumdar, Rupak ^d  

^a EPFL   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; C (PROGRAMMING LANGUAGE); INTERPOLATION; SECURITY OF DATA;

COMPUTER VERIFICATION TOOL - BLAST; MEMORY SAFETY; RUN-TIME CHECKS; TEMPORAL SAFETY;

STORAGE ALLOCATION (COMPUTER);

EID: 24644436530     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31984-9_2     Document Type: Conference Paper

References (26)

1. T. Andrews, S. Qadeer, S.K. Rajamani, J. Rehof, and Y. Xie. ZING: A model checker for concurrent software. In Proc. CAV, LNCS 3114, pages 484-487. Springer, 2004.
2. T.M. Austin, S.E. Breach, and G.S. Sohi. Efficient detection of all pointer and array access errors. In Proc. PLDI, pages 290-301. ACM, 1994.
3. T. Ball and S.K. Rajamani. The SLAM project: Debugging system software via static analysis. In Proc. POPL, pages 1-3. ACM, 2002.
4. R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating array bounds checks on demand. In Proc. PLDI, pages 321-333. ACM, 2000.
5. M.C. Carlisle. Olden: Parallelizing Programs with Dynamic Data Structures on Distributed Memory Machines. PhD thesis, Princeton University, 1996.
6. S. Chaki, E.M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. IEEE Trans. Software Engineering, 30:388-402, 2004.
7. J. Condit, M. Harren, S. McPeak, G.C. Necula, and W. Weimer. CCURED in the real world. In Proc. PLDI, pages 232-244. ACM, 2003.
8. J.C. Corbett, M.B. Dwyer, J. Hatcliff, C. Pasareanu, Robby, S. Laubach, and H. Zheng. BANDERA: Extracting finite-state models from Java source code. In Proc. ICSE, pages 439-448. ACM, 2000.
9. W. Craig. Linear reasoning. J. Symbolic Logic, 22:250-268, 1957.
10. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadek. Efficiently computing static single-assignment form and the program dependence graph. ACM Trans. Programming Languages and Systems, 13:451-490, 1991.
11. P. Godefroid. Model checking for programming languages using VERISOFT. In Proc. POPL, pages 174-186. ACM, 1997.
12. R. Hastings and B. Joyce. Purify: Fast detection of memory leaks and access errors. In Proc. USENIX, pages 125-136, 1992.
13. K. Havelund and T. Pressburger. Model checking Java programs using Java PATHFINDER. Software Tools for Technology Transfer, 2:72-84, 2000.
14. F. Henglein. Global tagging optimization by type inference. In Proc. LISP and Functional Programming, pages 205-215. ACM, 1992.
15. T.A. Henzinger, R. Jhala, R. Majumdar, and K.L. McMillan. Abstractions from proofs. In Proc. POPL, pages 232-244. ACM, 2004.
16. T.A. Henzinger, R. Jhala, R. Majumdar, G.C. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In Proc. CAV, LNCS 2404, pages 526-538. Springer, 2002.
17. T.A. Henzinger, R. Jhala, R. Majumdar, and M.A.A. Sanvido. Extreme model checking. In International Symposium on Verification: Theory and Practice, LNCS 2772, pages 332-358. Springer, 2003.
18. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proc. POPL, pages 58-70. ACM, 2002.
19. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with BLAST. In Proc. SPIN, LNCS 2648, pages 235-239. Springer, 2003.
20. G.J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, 2003.
21. S. Kaufer, R. Lopez, and S. Pratap. SABER-C: An interpreter-based programming environment for the C language. In Proc. USENIX, pages 161-171, 1988.
22. M. Musuvathi, D.Y.W. Park, A. Chou, D.R. Engler, and D.L. Dill. CMC: A pragmatic approach to model checking real code. In Proc. OSDI. USENIX, 2002.
23. G.C. Necula and P. Lee. Efficient representation and validation of proofs. In Proc. LICS, pages 93-104. IEEE, 1998.
24. G.C. Necula, S. McPeak, and W. Weimer. CCURED: Type-safe retrofitting of legacy code. In Proc. POPL, pages 128-139. ACM, 2002.
25. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. POPL, pages 49-61. ACM, 1995.
26. N. Suzuki and K. Ishihata. Implementation of an array bound checker. In Proc. POPL, pages 132-143. ACM, 1977.