This work proposes a Prolog-dialect for the found and prioritised problems on expressibility and automation. Given some given C-like program, if dynamic memory is allocated, altered and freed on runtime, then a description of desired dynamic memory is a heap specification. The check of calculated memory state against a given specification is dynamic memory verification. This contribution only considers formal specification and verification in a Hoare calculus. Issues found include: invalid assignment, (temporary) unavailable data in memory cells, excessive memory allocation, (accidental) heap alteration in unexpected regions and others. Excessive memory allocation is nowadays successfully resolved by memory analysers like Valgrind. Essentially, papers in those areas did not bring any big breakthrough. Possible reasons may also include the decrease of tension due to more available memory and parallel threads. However, starting with Apt, problems related to variable modes have not yet been resolved -- neither entirely nor in an acceptable way. Research contributions over the last decades show again and again that heap issues remain and remain complex and still important. A significant contribution was reached in 2016 by Peter O'Hearn, who accepted the G\"{o}del prize for his parallel approach on a spatial heap operation.

中文翻译：

---

逻辑编程语言作为指定和验证动态内存的工具

这项工作为发现和优先考虑的可表达性和自动化问题提出了序言。给定某些给定的类似C的程序，如果在运行时分配，更改和释放了动态内存，则对所需动态内存的描述就是堆规范。根据给定的规范检查计算的内存状态是动态内存验证。此贡献仅考虑Hoare演算中的正式规范和验证。发现的问题包括：无效分配，内存单元中的（临时）不可用数据，过多的内存分配，意外区域中的（意外）堆更改等。如今，诸如Valgrind之类的内存分析器已成功解决了过多的内存分配问题。从本质上讲，这些领域的论文并没有带来任何重大突破。可能的原因还可能包括由于更多可用的内存和并行线程而导致的张力降低。但是，从Apt开始，与可变模式有关的问题尚未解决-既不是完全解决也不是可以接受的方式。过去几十年来的研究贡献一次又一次地表明，堆问题仍然存在，并且仍然很复杂并且仍然很重要。Peter O'Hearn在2016年做出了重大贡献，他以其在空间堆操作上的并行方法而获得了Gdeldel奖。过去几十年来的研究贡献一次又一次地表明，堆问题仍然存在，并且仍然很复杂并且仍然很重要。Peter O'Hearn在2016年做出了重大贡献，他以其在空间堆操作上的并行方法而获得了Gdeldel奖。过去几十年来的研究贡献一次又一次地表明，堆问题仍然存在，并且仍然很复杂并且仍然很重要。Peter O'Hearn在2016年做出了重大贡献，他以其在空间堆操作上的并行方法而获得了Gdeldel奖。