Name
Abstract | ||
|---|---|---|
Automatic race detection of C programs requires fast, yet sufficiently precise analysis of dynamic memory. Therefore, we present
a region-based pointer analysis which seeks to identify disjoint regions of dynamically allocated objects to ensure that write accesses to the same region are always protected by the same mutexes.
Our approach has been implemented within the interprocedural analyzer of concurrent C programs GobLint and we have successfully
applied it on code from the Linux kernel, such as the access vector cache. This code relies on a synchronized hash table where
an array of doubly linked lists is protected by an array of locks.
|
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-03237-0_13 | Static Analysis Symposium/Workshop on Static Analysis |
Keywords | Field | DocType |
automatic race detection,concurrent c program,hash table,race detection,precise analysis,region analysis,c program,disjoint region,region-based pointer analysis,linux kernel,dynamic memory,access vector cache,pointer analysis | Dynamic random-access memory,Pointer (computer programming),Pointer analysis,Disjoint sets,Linked list,Computer science,Cache,Parallel computing,Real-time computing,Linux kernel,Hash table | Conference |
Volume | ISSN | Citations |
5673 | 0302-9743 | 12 |
PageRank | References | Authors |
0.60 | 23 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Helmut Seidl | 1 | 1468 | 103.61 |
| Vesal Vojdani | 2 | 68 | 5.45 |