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

More documents

Recommendations

Info

References [1] Jerey S. Foster, Manuel Fähndrich, and Alexander Aiken. A theory of type qualiers. In Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, PLDI '99, pages 192203, New York, NY, USA, 1999. ACM. [2] Jerey S. Foster, Robert Johnson, John Kodumal, and Alex Aiken. Flow-insensitive type qualiers. ACM Trans. Program. Lang. Syst., 28(6):10351087, November 2006. [3] Jerey S. Foster, Tachio Terauchi, and Alex Aiken. Flow-sensitive type qualiers. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, PLDI '02, pages 112, New York, NY, USA, 2002. ACM. [4] David Greeneldboyce and Jerey S. Foster. Type qualier inference for java. In Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications, OOPSLA '07, pages 321336, New York, NY, USA, 2007. ACM. [5] George C. Necula, Jeremy Condit, Matthew Harren, Scott McPeak, and Westley Weimer. Ccured: type-safe retrotting of legacy software. ACM Trans. Program. Lang. Syst., 27(3):477 526, May 2005. 58
Chapter 8 Dependant Type Qualiers Of course, there are more colors than just red, green, and blue. Furthermore, the color of a type might depend on some other data in the program. In this example we introduce type qualiers parameterized by arbitrary C expressions. Since types may depend on runtime data, type-checking must happen partially at runtime, which we will accomplish by instrumenting the code with the appropriate checks. Furthermore, the information we know about the color of a type may be imprecise, or rather, for example, a function may accept a range of colors rather than only one exact color. We introduce type qualiers for expressing this. First, we'll dene OCaml types for representing the type qualiers. Then, we'll dene functions for extracting these qualiers from C type attributes. This will involve keeping a typing context that maps strings to expressions so that the identiers in type attributes may be translated into CIL variables. With the ability to extract colors from types, we will then be able to perform type checking as in the previous example. However, instead of generating a compile-time answer about correct typing, we must generate a list of instructions that test type compatibility at runtime. It will be possible to determine at compile time that some of these checks will always succeed. Writing an optimization pass to remove these checks is left as an exercise. OCaml Style Note: It would be better style to put each of these parts in separate OCaml modules: one for dening OCaml types; one for compiling the color qualiers in type attributes into CIL expressions; one for setting up the runtime checks; and one containing the visitors used for type checking. 59
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 and 52: CHAPTER 6. OVERRIDING FUNCTIONS 49
Page 53 and 54: References [1] Kumar Avijit, Pratee
Page 55 and 56: CHAPTER 7. TYPE QUALIFIERS 53 let c
Page 57 and 58: CHAPTER 7. TYPE QUALIFIERS 55 let w
Page 59: CHAPTER 7. TYPE QUALIFIERS 57 $ cil
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 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?