Symbolic state space reduction with guarded terms for rewriting modulo SMT.
Science of Computer Programming(2019)
摘要
•Guarded terms provide an approach to deal with the symbolic state-explosion problem for rewriting modulo SMT.•A guarded term has the potential to encode many symbolic states into one by using constraints as part of its structure.•Succinct exploration of the symbolic state space can be achieved by reducing branching, and the complexity and size of constraints.•A case study of an unbounded and symbolic priority queue illustrates the approach.
更多查看译文
关键词
Rewriting modulo SMT,Symbolic reachability analysis,State space reduction,Rewriting logic,CASH scheduling algorithm
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要