Abstract Predicate Entailment over Points-To Heaplets is Syntax Recognition

Abstract

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.

9 pages, 3 figures

References in corpus (2)

• Dynamically Allocated Memory Verification in Object-Oriented Programs using Prolog
• Transformation of XML Documents with Prolog

Cited by in corpus (1)

• A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory