An example (skipping lots of steps): Jackson & Vaziri

class List {List next; Val val;}

…

void static delete (List l, Val v) {

List prev = null;

while (l != NULL)

if (l.val == v) {

prev.next = l.next ;

return; }

else {

prev = l ;

l = l.next ;

}

• Procedure for deleting all elements with a given value from a singly linked list

• Relational formulae are automatically extracted

• Fields of List treated as binary relations
  • next: List ? List
  • val: List ? Val

Previous slide

Next slide

Back to first slide

View graphic version