I am trying to find out if there is any work on applying the Codd's relational model (underlying relational databases) for reasoning about linked data structures. Any connections with UML models and reasoning about them (other than drawing diagrams) would also be of interest to me.
[There is of course a lot of work - and tool sets - for mapping data structures to relational databases and back. But my interest is in reasoning about in-memory data structures using relational models.]
[For example, a doubly-linked list can be represented in the relational model as a pair of relations: $successor$ and $predecessor$, tied together by a couple of integrity constraints $successor(x,y) \Rightarrow predecessor(y,x)$ and its converse (modulo boundary cases). In more interesting examples, we would have tons of relations and constraints. The question I am wondering about is whether the relational database theory can help us get handle on how to build good data structures, modularise them appropriately and provide some structure to the constraints (or "invariants") so that it is easier to verify them or to ensure correctness by construction.]