Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions
Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions
复制标题
具有归纳定义的符号堆循环证明的完整性
DOI:
10.1007/978-3-030-34175-6_19
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Kimura Daisuke
中科院分区:
文献类型:
--
作者:
Tatsuta Makoto;Nakazawa Koji;Kimura Daisuke
Separation logic is successful for software verification in both theory and practice. Decision procedure for symbolic heaps is one of the key issues. This paper proposes a cyclic proof system for symbolic heaps with general form of inductive definitions called cone inductive definitions, and shows its soundness and completeness. Cone inductive definitions are obtained from bounded-treewidth inductive definitions by imposing some restrictions for existentials, but they still include a wide class of recursive data structures. The completeness is proved by using a proof search algorithm and it also gives us a decision procedure for entailments of symbolic heaps with cone inductive definitions. The time complexity of the algorithm is nondeterministic double exponential. A prototype system for the algorithm has been implemented and experimental results are also presented.
登录
查看更多内容
DOI:
10.1145/2837614.2837621
发表时间:
2016-01
期刊:
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
影响因子:
--
作者:
J. Brotherston;Nikos Gorogiannis;M. Kanovich;R. Rowe
通讯作者:
J. Brotherston;Nikos Gorogiannis;M. Kanovich;R. Rowe
DOI:
--
发表时间:
2005
期刊:
Bulletin of the Section of Logic 34(4)
影响因子:
--
作者:
上出哲広;上出哲広;上出哲広;上出哲広;上出哲広;上出哲広;上出哲広
通讯作者:
上出哲広
影响因子:
0.6
作者:
J. Brotherston;Nikos Gorogiannis;R. Petersen
通讯作者:
R. Petersen
DOI:
10.1007/978-3-662-54458-7_17
发表时间:
2017
期刊:
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
影响因子:
--
作者:
A. Simpson
通讯作者:
A. Simpson
DOI:
10.1109/lics.2017.8005114
发表时间:
2017
期刊:
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
影响因子:
--
作者:
S. Berardi;M. Tatsuta
通讯作者:
M. Tatsuta