A CIL Tutorial - Department of Computer Science - ETH ZÃ¼rich

More documents

Recommendations

Info

CHAPTER 6. OVERRIDING FUNCTIONS 50 # include # include ../test/tut6.c int counter = 0; pthread_mutex_t mtx = PTHREAD_MUTEX_INITIALIZER; int main() { toggle_lock_tracking(); pthread_mutex_lock(&mtx); counter++; pthread_mutex_unlock(&mtx); return 0; } Now, we can compile this test by doing: $ ciltutcc --enable-tut6 -lpthread -o tut6 test/tut6.c Then, when we run tut6, we should get something similar to the following output: $ ./tut6 thread: thread: 32646 - pthread mutex lock(0x602180) 32646 - pthread mutex unlock(0x602180) 6.5 Further Reading Many researchers have studied overriding memory allocation calls (along with the instrumentation of some memory accesses) with the goal of catching memory management errors. Examples are Libsafe [2], LibsafePlus [1], and HeapShield [3] (which is a part of DieHard [4]). The Trickle [5] userspace bandwidth shaper operates by using the dynamic linker to override IO calls with ones that track the number of bytes sent per unit time. Then, it puts the calling process to sleep when the sending or receiving rate exceeds a user given limit.
References [1] Kumar Avijit, Prateek Gupta, and Deepak Gupta. TIED, libsafeplus: tools for runtime buer overow protection. In Proceedings of the 13th conference on USENIX Security Symposium - Volume 13, SSYM'04, pages 44, Berkeley, CA, USA, 2004. USENIX Association. [2] A. Baratloo, N. Singh, and T. Tsai. Transparent run-time defense against stack smashing attacks. In Proceedings of the 2000 USENIX Annual Technical Conference, USENIX'00, 2000. [3] Emery D. Berger. Heapshield: Library-based heap overow protection for free. Technical Report UMass CS TR 06-28, Department of Computer Science, University of Massachusetts, 2006. [4] Emery D. Berger and Benjamin G. Zorn. Diehard: probabilistic memory safety for unsafe languages. In Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation, PLDI '06, pages 158168, New York, NY, USA, 2006. ACM. [5] Marius A. Eriksen. Trickle: A userland bandwidth shaper for unix-like systems. In Proceedings of the USENIX 2005 Annual Technical Conference, FREENIX Track, USENIX'05, pages 6170, 2005. 51
Page 1 and 2: A CIL Tutorial Using CIL for langua
Page 3 and 4: Contents Preface 4 Introduction 5 0
Page 5 and 6: CONTENTS 3 13 Whole-program Analysi
Page 7 and 8: Introduction The C Intermediate Lan
Page 9 and 10: References [1] clang: a C language
Page 11 and 12: CHAPTER 0. OVERVIEW AND ORGANIZATIO
Page 13 and 14: Chapter 1 The AST The Concrete Synt
Page 15 and 16: CHAPTER 1. THE AST 13 1.2 Printing
Page 17 and 18: References [1] Andrew W. Appel. Mod
Page 19 and 20: CHAPTER 2. VISITING THE AST 17 open
Page 21 and 22: CHAPTER 2. VISITING THE AST 19 $ ci
Page 23 and 24: Chapter 3 Dataow Analysis Dataow An
Page 25 and 26: CHAPTER 3. DATAFLOW ANALYSIS 23 Cod
Page 27 and 28: CHAPTER 3. DATAFLOW ANALYSIS 25 let
Page 29 and 30: CHAPTER 3. DATAFLOW ANALYSIS 27 and
Page 31 and 32: CHAPTER 3. DATAFLOW ANALYSIS 29 let
Page 33 and 34: CHAPTER 3. DATAFLOW ANALYSIS 31 DoC
Page 35 and 36: CHAPTER 3. DATAFLOW ANALYSIS 33 tes
Page 37 and 38: References [1] Aws Albarghouthi, Ra
Page 39 and 40: CHAPTER 4. INSTRUMENTATION 37 type
Page 41 and 42: CHAPTER 4. INSTRUMENTATION 39 metho
Page 43 and 44: CHAPTER 4. INSTRUMENTATION 41 $ cil
Page 45 and 46: CHAPTER 5. INTERPRETED CONSTRUCTORS
Page 47 and 48: CHAPTER 5. INTERPRETED CONSTRUCTORS
Page 49 and 50: Chapter 6 Overriding Functions When
Page 51: CHAPTER 6. OVERRIDING FUNCTIONS 49
Page 55 and 56: CHAPTER 7. TYPE QUALIFIERS 53 let c
Page 57 and 58: CHAPTER 7. TYPE QUALIFIERS 55 let w
Page 59 and 60: CHAPTER 7. TYPE QUALIFIERS 57 $ cil
Page 61 and 62: Chapter 8 Dependant Type Qualiers O
Page 63 and 64: CHAPTER 8. DEPENDANT TYPE QUALIFIER
Page 73 and 74: Chapter 9 Type Qualier Inference In
Page 75 and 76: CHAPTER 9. TYPE QUALIFIER INFERENCE
Page 83 and 84: Chapter 10 Adding a New Kind of Sta
Page 85 and 86: CHAPTER 10. ADDING A NEW KIND OF ST
Page 93 and 94: Chapter 11 Program Verication In th
Page 95 and 96: CHAPTER 11. PROGRAM VERIFICATION 93
Page 103 and 104:
CHAPTER 11. PROGRAM VERIFICATION 10
Page 105 and 106:
CHAPTER 11. PROGRAM VERIFICATION 10
Page 107 and 108:
Chapter 12 Comments CIL has a very
Page 109 and 110:
CHAPTER 12. COMMENTS 107 let printC
Page 111 and 112:
References [1] Lin Tan, Ding Yuan,
Page 113 and 114:
CHAPTER 13. WHOLE-PROGRAM ANALYSIS
Page 115 and 116:
CHAPTER 13. WHOLE-PROGRAM ANALYSIS
Page 117 and 118:
CHAPTER 14. IMPLEMENTING A SIMPLE D
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Chapter 15 Automated Test Generatio
Page 129 and 130:
CHAPTER 15. AUTOMATED TEST GENERATI
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Index A (module), 10, 13, 15, 10, 1
Page 137 and 138:
INDEX 135 isCacheReportType, 11, 11
show all

A CIL Tutorial - Department of Computer Science - ETH ZÃ¼rich

Create successful ePaper yourself

Delete template?

Save as template?