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

More documents

Recommendations

Info

CHAPTER 11. PROGRAM VERIFICATION 102 $ ciltutcc --enable-tut11 --prover=Alt-Ergo prover-version=0.94 -o tut11 test/tut11.c 11.3 Exercises 1. Use a chain of Why3 if-then-else terms to calculate the VC for C's switch statement. 2. Handle structure elds. 3. Verify an array sorting function. 4. Extend the translation of attribute parameters and terms to handle not only integer arithmetic, but also oating point arithmetic. To achieve this, the relevant theory must be added to the Why3 context, and the operations from these theories must be added to the ops type. 5. Extend the checking here to also verify that function preconditions are satised. Project: Create a tool that nds loop invariants given a post-condition and pre-condition for the loop. There are several approaches you might take. You could execute the program symbolically at the same time as it executes concretely (which we'll see how to do in Chapter 15), and assume to be symbolic invariants relationships that are concretely true at runtime. Alternately, you could repeatedly construct trial invariants out of every relationship among program variables that are live in the loop.
CHAPTER 11. PROGRAM VERIFICATION 103 11.4 Further Reading There are many approaches to, and implementations of, program verication. Here is a dated and incomplete list. This is a big area with many ongoing projects, so ask your local PL professor to point you in the right direction. • VC generation and checking: Boogie [1] • Software model checking: BLAST [4] • Explicit path model checking: CUTE [4]
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 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: 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 127 and 128: Chapter 15 Automated Test Generatio
Page 129 and 130: CHAPTER 15. AUTOMATED TEST GENERATI
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?