1. Time Bounds for General Function Pointers Robert Dockins and Aquinas Hobor (Princeton University) (NUS) TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A

2. Goal Use step-indexed models to prove program time bounds in the presence of certain (approximated) recursive domain equations Testbed: soundness of a logic of total correctness for a language with 1.Function pointers 2.Semantic assertions (assert truth of a (classical) logical formula at the current program point) 2

3. Goal Use step-indexed models to prove program time bounds in the presence of certain (approximated) recursive domain equations For example, the kinds of domains that occur in semantic models of the assertions of concurrent separation logic with first-class locks and threads. 3

4. Goal Use step-indexed models to prove program time bounds in the presence of certain (approximated) recursive domain equations For example, the kinds of domains that occur in semantic models of the assertions of concurrent separation logic with first-class locks and threads. – But maybe this is a really hard domain to attack… 4

5. Goal Use step-indexed models to prove program time bounds in the presence of certain (approximated) recursive domain equations Testbed: soundness of a logic of time bounds for a language with 1.Function pointers 2.Semantic assertions (assert truth of a (classical) logical formula at the current program point) 5

6. A very simple language 6

7. Simple semantic definitions 7

8. 8 Uh oh…

9. We detail our predicates/assertions informally and refer to the paper for formal construction 9

10. We detail our predicates/assertions informally and refer to the paper for formal construction 10

11. We detail our predicates/assertions informally and refer to the paper for formal construction 11

12. We detail our predicates/assertions informally and refer to the paper for formal construction 12

13. What does funptr l t [ P ] [ Q ] mean? 13 1.The program has some code c at address l. (This is why we want predicates to be able to judge programs.) 2.When c is called with some initial store ½, if t( ½ ) is defined then c makes at most t( ½ ) function calls before returning to its caller. 3. P and Q are actually functions from some function-specific type A to predicates. If t( ½ ) is defined then for all a, if P ( a ) holds before the call then Q ( a ) will hold afterwards.

14. Hoare Judgment Our Hoare Judgment looks a bit complex: ¡, R ` n { P } c { Q } ¡ contains function pointer assertions and R is the postcondition of the current function n is an upper bound on the number of function calls c makes before it terminates 14

15. Hoare Rules, 1 15

16. Hoare Rules, 1 16

17. Hoare Rules, 2 17

18. Hoare Rules, 2 18

19. Hoare Rules, 3 19

20. Hoare Rules, 3 20

21. The Call Rule The interesting rule is for call… and it’s not too bad: 21

22. The Call Rule The interesting rule is for call… and it’s not too bad: 1. x must evaluate to a label l 22

23. The Call Rule The interesting rule is for call… and it’s not too bad: 2. l must be a pointer to a function with termination measure t, precondition P l and postcondition Q l 23

24. The Call Rule The interesting rule is for call… and it’s not too bad: 3. The termination measure t must evaluate to some n on the current store 24

25. The Call Rule The interesting rule is for call… and it’s not too bad: 3. The termination measure t must evaluate to some n on the current store… and so this call will take no more than n +1 calls. 25

26. The Call Rule The interesting rule is for call… and it’s not too bad: 4. We require the (parameterized) precondition to be true at call, and guarantee the (parameterized) postcondition will be true on return. 26

27. So, not too bad… Most of these rules are really nothing to get excited about… even the call rule is pretty simple when you understand the parts… (This is a virtue, of course…) But we’re not done. We’ve only shown the rule for using the funptr, not the rules for verifying that a function actually terminates 27

28. V-rules We need another judgment, written ª : ¡, that says that program ª contains functions verified to “funptr” specifications in ¡. We will verify functions one at a time (or in the case of mutually-recursive groups, as a group). The “base case” is an easy rule: 28

29. The “Vsimple” rule So this looks pretty bad, but we can take it apart: 29

30. The “Vsimple” rule 30 So this looks pretty bad, but we can take it apart: 1. We have verified part of ª to specification ¡

31. The “Vsimple” rule 31 So this looks pretty bad, but we can take it apart: 2. We want to add this specification for l

32. The “Vsimple” rule 32 So this looks pretty bad, but we can take it apart: 3. We must have verified the code for l

33. The “Vsimple” rule 33 So this looks pretty bad, but we can take it apart: 4. When the precondition P (a) holds

34. The “Vsimple” rule 34 So this looks pretty bad, but we can take it apart: 4. When the precondition P ( a ) holds and the termination measure is equal to some n.

35. The “Vsimple” rule 35 So this looks pretty bad, but we can take it apart: 5. This n is also an upper bound on the number of calls this function makes.

36. The “Vsimple” rule 36 So this looks pretty bad, but we can take it apart: 6. The postcondition is just ? : you can’t fall out the bottom

37. The “Vsimple” rule 37 So this looks pretty bad, but we can take it apart: 6. The postcondition is just ? : you can’t fall out the bottom, but the return condition is Q (a).

38. The “Vsimple” rule 38 So this looks pretty bad, but we can take it apart: 7. We can assume every funptr we have previously verified, and…

39. The “Vsimple” rule 39 So this looks pretty bad, but we can take it apart: 8. We can call ourselves using a modified function specification precondition: t has decreased.

40. The “Vsimple” rule 40 Here are the critical uses for t. If we assume the termination measure is equal to n at the function start, then we can make no more than n calls and can recurse only when t < n.

41. Vsimple, in a nutshell The Vsimple rule is fine for most functions, but it can only verify, well, simple recursive functions (as well as calls to both simple and complex functions previously verified). If we want “the goodies” (mutual recursion, polymorphic termination arguments, etc.) then we need to call in Vsimple’s big brother… 41

42. This is moderately horrible. We have (at least): 42 The “Vfull” rule

43. This is moderately horrible. We have (at least): 1. A set © of funptr specifications in the goal as well as the assumptions 43 The “Vfull” rule

44. This is moderately horrible. We have (at least): 2. The same basic termination measure trick 44 The “Vfull” rule

45. This is moderately horrible. We have (at least): 3. A parameter b used for higher-order functions 45 The “Vfull” rule

46. This is moderately horrible. We have (at least): 3. There can be a strong dependency between b and the other factors (e.g., the type of a ) 46 The “Vfull” rule

47. The Vsimple rule is just a special case of Vfull. 47 The “Vfull” rule

48. Using Vfull We are going to verify the simplest nontrivial higher order function we can, “apply”. It takes as an argument a pair of a function f and an argument v and just applies f to v. The “interesting” part is how the polymorphism is verified as opposed to the function behavior. 48

49. Defining a calling convention To specify the “apply” function, we must define a calling convention for the sub-function 49

50. Defining a calling convention The registers r 1 – r 4 are callee-saves; registers from r 5 ! 1 registers are caller-saves 50

51. Defining a calling convention A stdfun’s precondition, postcondition, and termination measure only depend on r 0. 51

52. Apply’s precondition, postcondition, and termination measure 52

53. Apply’s precondition, postcondition, and termination measure These look “obvious” until you realize that P, Q, and t seem free in the definition. We will see how the Vfull rule “pipes” these in. 53

54. 54 The code is simple, although the verification is a bit cluttered…

55. 55 Notice how we track the termination measure

56. The verification obligation from Vfull 56 This is somewhat large (thank goodness for machine-checking!). There are a few points of particular interest.

57. The verification obligation from Vfull 57 1. We can check this function first, — i.e., ¡ = > That is, we verify this function before we verify the functions we will pass to it.

58. The verification obligation from Vfull 58 2. The Vfull rule “pipes in” t, P, and Q – in fact, the triple ( t, P, Q ) is the “ b ” from Vfull.

59. The verification obligation from Vfull 59 3. We thread the termination argument into the verification required.

60. “Stacking” apply As it happens, the apply function, itself, is a standard function (r 1 – r 4 are preserved, argument passed in r 0, return in r 0 ). In fact, we can pass “apply” to itself without difficulty. The rules will prevent us from unbounded recursion. We can “apply (apply (apply … (apply (f))))” but the function f “at the bottom” must terminate “on its own”. 60

61. The key technical hurdle for soundness All our key definitions (Hoare tuple, funptr, etc.) are defined in terms of “halt”, which is not obviously hereditary/continuous/ monotonic/downward closed. A.What is hereditary? B.Why is halting not hereditary? 61

62. The key technical hurdle for soundness P hereditary ´ (w ² P Æ w à w’) ! w’ ² P Here à is the “age” or “approximate” operation on step-indexed worlds. We can only approximate a finite number of times before we “hit bottom”. The step relation approximates w during function call. 62

63. The key technical hurdle for soundness The standard definition: w ² halts( ¾ ) ´ 9 w h. (w, ¾ )  * (w h, []) Let w à w’. The problem is that the  relation approximates the world (at function call), so w’ might not have enough “time” left to actually reach the halting state []. 63

64. The key technical hurdle for soundness Our definition: w ² halts n ( ¾ ) ´ |w| > n ! ( 9 w h. (|w|-|w h | · n) Æ (w, ¾ )  * (w h, []) ) This is actually very similar to the basic definition. 64

65. The key technical hurdle for soundness Our definition: w ² halts n ( ¾ ) ´ |w| > n ! ( 9 w h. (|w|-|w h | · n) Æ (w, ¾ )  * (w h, []) ) Here is the exists and requirement that we step to the halt state. 65

66. The key technical hurdle for soundness Our definition: w ² halts n ( ¾ ) ´ |w| > n ! ( 9 w h. (|w|-|w h | · n) Æ (w, ¾ )  * (w h, []) ) This is the key “trick” – if the amount of time left in w is not enough, then we become true (and thus hereditary) trivially. 66

67. The key technical hurdle for soundness Our definition: w ² halts n ( ¾ ) ´ |w| > n ! ( 9 w h. (|w|-|w h | · n) Æ (w, ¾ )  * (w h, []) ) We must be sure that n is really a bound on the number of steps required to halt. 67

68. The key technical hurdle for soundness Our definition: w ² halts n ( ¾ ) ´ |w| > n ! ( 9 w h. (|w|-|w h | · n) Æ (w, ¾ )  * (w h, []) ) So, really not that bad. This is the “fundamental” trick that makes everything else possible. 68

69. The key technical hurdle for soundness See the paper (and/or Coq development) for how to use this definition to build up the Hoare tuple, etc. Our top-level “erased” theorems are in standard form: if a program is verified in our logic, then it terminates. All our proofs are machine checked in Coq. Our core proofs are quite compact. 69

70. Compact Proofs The main file is 826 lines long, and contains: A.Semantic model of the terminating function pointer, Hoare judgment, whole-program verification judgment B.10+ Hoare rules and soundness proofs C.3 whole-program rules and soundness proofs D.Top-level theorems (if P is verified, then it halts) Really quite short… 70