Abstract predicate entailment over points-to heaplets is syntax recognition

Rene Haberland, Kirill Krinkin, Sergey Ivanovskiy
2016 2016 18th Conference of Open Innovations Association and Seminar on Information Security and Protection of Information Technology (FRUCT-ISPIT)  
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.
doi:10.1109/fruct-ispit.2016.7561510 dblp:conf/fruct/HaberlandKI16 fatcat:nhcxe5faifcffk2jdx4e4xbyo4