This paper explores the use of object models for specifying verifiable heap invariants. We define a simple language based on sets and relations and illustrate its use through examples. We give formal semantics of the laguage by translation into predicate calculus and interpretation of predicates in terms of objects and references in the program heap.
