LARA

Beyond simple imperative language: dynamic allocation and procedures

(Review of FOL results, a comment on Complete Recursive Axiomatizations from last lecture.)

Today we

  • use FOL to verify linked data structures
  • show how to specify and verify programs with procedures

Review Forward Symbolic Execution and note that the rules apply for any variable type, not just integers.

Symbolic Execution for Example Integer Program

Modeling Objects and References

Insertion into Doubly-Linked List

Program Memory as Graph

Language with Dynamic Allocation

Semantics of Dynamic Object Allocation

Semantics of Field Reads and Writes

Semantics of Array Manipulations

FOL with Update Expressions

Proving Programs with Dynamic Allocation

Procedures

Language with Specified Procedures

Relational Semantics of Procedures