Abstract predicate entailment over points-to heaplets is syntax recognition
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 r...
Main Authors: | Rene Haberland, Kirill Krinkin, Sergey Ivanovskiy |
---|---|
Format: | Article |
Language: | English |
Published: |
FRUCT
2016-04-01
|
Series: | Proceedings of the XXth Conference of Open Innovations Association FRUCT |
Subjects: | |
Online Access: | https://fruct.org/publications/fruct18/files/Hab.pdf
|
Similar Items
-
Graph Inclusion and Matching Algorithms for Programs Manipulating Singly linked Heaps
by: Muhsin H. Atto
Published: (2021-03-01) -
AAHEG: Automatic Advanced Heap Exploit Generation Based on Abstract Syntax Tree
by: Yu Wang, et al.
Published: (2023-12-01) -
Abstraction of Dynamical Systems by Timed Automata
by: Rafael Wisniewski, et al.
Published: (2011-04-01) -
The memory forensic research oriented to segment heap in Windows 10 system
by: ZHAI Jiqiang, et al.
Published: (2021-10-01) -
Applicable to Key Carrier Attacks
by: Sergey Sergeevich Agafyin, et al.
Published: (2014-02-01)