SyTeCi: automating contextual equivalence for higher-order programs with references

SyTeCi: automating contextual equivalence for higher-order programs with references
复制标题

SyTeCi:通过引用自动实现高阶程序的上下文等效

DOI:
10.1145/3371127
复制
发表时间:
2019
影响因子:
--
通讯作者:
Jaber G
Jaber G
中科院分区:
--
文献类型:
--
作者:
Jaber G

文献摘要

参考文献

被引文献

相似文献

我们提出了一个框架,研究上下文等价的程序写在一个调用的值函数式语言与本地整数引用。它减少了上下文等价的问题,在记忆配置的过渡系统的不可达性的问题。这种减少是完全的递归自由programmes.Restricting程序,不分配引用内的函数的身体,我们编码这个不可达性问题作为一组受约束的霍恩子句,然后可以检查可满足性自动。进一步限制到有限数据类型的语言,我们也得到了一个新的可判定性结果的上下文等价在任何类型。
We propose a framework to study contextual equivalence of programs written in a call-by-value functional language with local integer references. It reduces the problem of contextual equivalence to the problem of non-reachability in a transition system of memory configurations. This reduction is complete for recursion-free programs.Restricting to programs that do not allocate references inside the body of functions, we encode this non-reachability problem as a set of constrained Horn clause that can then be checked for satisfiability automatically. Restricting furthermore to a language with finite data-types, we also get a new decidability result for contextual equivalence at any type.
IMJ 的上下文等价检查器 *
DOI: --
发表时间: 2015
期刊: Automated Technology for Verification and Analysis
影响因子: --
作者:
A. Murawski;S. Ramsay;N. Tzevelekos
通讯作者: N. Tzevelekos
DOI: --
发表时间: 2005
期刊: Bulletin of the Section of Logic 34(4)
影响因子: --
作者:
上出哲広;上出哲広;上出哲広;上出哲広;上出哲広;上出哲広;上出哲広
通讯作者: 上出哲広
算法名义游戏语义
DOI: 10.1007/978-3-642-19718-5_22
发表时间: 2011
期刊: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
影响因子: --
作者:
A. Murawski;N. Tzevelekos
通讯作者: N. Tzevelekos
DOI: 10.1145/1040305.1040311
发表时间: 2005-01
期刊: --
影响因子: --
作者:
Eijiro Sumii;B. Pierce
通讯作者: Eijiro Sumii;B. Pierce
互模拟与克里普克逻辑关系的结合
DOI: 10.1145/2103656.2103666
发表时间: 2012
期刊: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
影响因子: --
作者:
C. Hur;Derek Dreyer;Georg Neis;Viktor Vafeiadis
通讯作者: Viktor Vafeiadis