  Abstract predicates are considered in this paper as abstraction technique for
heap-separated configurations, and as genuine Prolog predicates which are
translated straight into a corresponding formal language grammar used as
validation scheme for intermediate heap states. The approach presented is
rule-based because the abstract predicates are rule-based, the parsing
technique can be interpreted as an automated fold/unfold of the corresponding
heap graph.
