arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.06237cs.LOcs.CL
收藏

指针程序中序列的一种分离逻辑及其可判定性

A separation logic for sequences in pointer programs and its decidability

Peking University(北京大学);Guangzhou University(广州大学);Zhengzhou University(郑州大学)

Tianyue Cao, Bowen Zhang, Zhao Jin, Yongzhi Cao, Hanpin Wang

摘要:

分离逻辑及其变体可以描述指针程序的各种属性。然而,当涉及到序列的属性时,人们可能会发现很难形式化。为了处理变长序列和多级数据结构的属性,我们提出了序列堆分离逻辑,它将序列集成到堆操作程序的逻辑推理中。序列变量上的量词和存储序列的单例堆(序列单例堆)是我们逻辑中的新成员。进一步,我们研究了两个片段的可满足性问题。序列-堆分离逻辑的命题片断是可判定的,程序变量有2个交替、序列变量有1个交替的片断是不可判定的。此外,我们探索与前趋范式的逻辑的可判定和不可判定的片段之间的边界。

英文摘要:

Separation logic and its variants can describe various properties on pointer programs. However, when it comes to properties on sequences, one may find it hard to formalize. To deal with properties on variable-length sequences and multilevel data structures, we propose sequence-heap separation logic which integrates sequences into logical reasoning on heap-manipulated programs. Quantifiers over sequence variables and singleton heap storing sequence (sequence singleton heap) are new members in our logic. Further, we study the satisfiability problem of two fragments. The propositional fragment of sequence-heap separation logic is decidable, and the fragment with 2 alternations on program variables and 1 alternation on sequence variables is undecidable. In addition, we explore boundaries between decidable and undecidable fragments of the logic with prenex normal form.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑