PAriCheck: an efficient pointer arithmetic checker for C programs

  • Authors:
  • Yves Younan;Pieter Philippaerts;Lorenzo Cavallaro;R. Sekar;Frank Piessens;Wouter Joosen

  • Affiliations:
  • Katholieke Universiteit Leuven;Katholieke Universiteit Leuven;Vrije Universiteit Amsterdam, University of California at Santa Barbara;Stony Brook University;Katholieke Universiteit Leuven;Katholieke Universiteit Leuven

  • Venue:
  • ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Buffer overflows are still a significant problem in programs written in C and C++. In this paper we present a bounds checker, called PAriCheck, that inserts dynamic runtime checks to ensure that attackers are not able to abuse buffer overflow vulnerabilities. The main approach is based on checking pointer arithmetic rather than pointer dereferences when performing bounds checks. The checks are performed by assigning a unique label to each object and ensuring that the label is associated with each memory location that the object inhabits. Whenever pointer arithmetic occurs, the label of the base location is compared to the label of the resulting arithmetic. If the labels differ, an out-of-bounds calculation has occurred. Benchmarks show that PAriCheck has a very low performance overhead compared to similar bounds checkers. This paper demonstrates that using bounds checkers for programs or parts of programs running on high-security production systems is a realistic possibility.