constructing static-analysis algorithms from an operational semantics, where the operational semantics
is specified using logical formulas in first order logic with transitive closure.
TVLA has been implemented in Java and was successfully used to perform shape analysis on programs
manipulating linked data structures, concurrent programs and to verify the partial correctness
of several algorithms (including sorting, destructive tree traversals and more).