Symbolic bounds analysis of pointers, array indices, and accessed memory regions
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 182-195
- https://doi.org/10.1145/349299.349325
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- ABCDPublished by Association for Computing Machinery (ACM) ,2000
- Type-based race detection for JavaPublished by Association for Computing Machinery (ACM) ,2000
- Bidwidth analysis with application to silicon compilationPublished by Association for Computing Machinery (ACM) ,2000
- Automatic parallelization of divide and conquer algorithmsPublished by Association for Computing Machinery (ACM) ,1999
- The implementation of the Cilk-5 multithreaded languagePublished by Association for Computing Machinery (ACM) ,1998
- Detecting data races in Cilk programs that use locksPublished by Association for Computing Machinery (ACM) ,1998
- Solving shape-analysis problems in languages with destructive updatingACM Transactions on Programming Languages and Systems, 1998
- Cilk: An Efficient Multithreaded Runtime SystemJournal of Parallel and Distributed Computing, 1996
- An implementation of interprocedural bounded regular section analysisIEEE Transactions on Parallel and Distributed Systems, 1991
- Analysis of pointers and structuresPublished by Association for Computing Machinery (ACM) ,1990