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

More documents

Recommendations

Info

References [1] Zachary Anderson, David Gay, and Mayur Naik. Lightweight annotations for controlling sharing in concurrent data structures. In Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation, PLDI '09, pages 98109, New York, NY, USA, 2009. ACM. [2] Jeremy Condit, Matthew Harren, Zachary Anderson, David Gay, and George Necula. Dependent types for low-level programming. In ESOP'07. 70
Chapter 9 Type Qualier Inference In the previous two sections, we saw how to add type-qualiers to the language, and how to do any extra type-checking that they might require. In this section, we'll see how one can begin to do type-qualier inference. This might be useful, for example, if we wish to make our changes to C more unobtrusive. That is, we would like to add expressiveness to the language and type-system without thrusting a large annotation burden onto the programmer. One way to accomplish this is by inferring as many type qualiers as possible. Additionally, analyses like this one, which push type qualiers around, can be used for purposes aside from type-inference. For example, type qualier inference can be used to perform an imprecise (though still very useful) thread-escape analysis. 9.1 tut9.ml We'll use the following method to infer type qualiers. First, we'll place a numeric IDs on each type node in the AST. Then we'll build a graph with these numeric IDs on each node and directed edges given by the relationships between types that we nd in the program. Next, we iterate over the nodes until we reach a x-point that satises the relationships encoded by the graph edges. Following that, we add the inferred type qualiers to the program. If an inferred type qualier doesn't match the one that the programmer has given explicitly, we emit a compile-time warning. This inference pass is intended to be followed by a type-checking phase as in one of the previous sections. Therefore, it is important that we don't infer anything that won't type-check! We'll need the standard library Queue module, and a few things from Chapter 7, in particular the denition of the color type. module Q = Queue module T = Tut7 type colors = T.color list Even though we are borrowing some OCaml types and functions from Tut7, the C type system for this analysis is slightly dierent. In Tut7 for two types to be compatible, their colors had to match exactly. In this tutorial, we use the same colors, with a dierent restriction: type A is {included 71
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 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 71: CHAPTER 8. DEPENDANT TYPE QUALIFIER
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 123 and 124:
CHAPTER 14. IMPLEMENTING A SIMPLE D
Page 125 and 126:
CHAPTER 14. IMPLEMENTING A SIMPLE D
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?