Satisfiability modulo heap-based programs

In this work, we present a semi-decision procedure for a fragment of separation logic with user-defined predicates and Presburger arithmetic. To check the satisfiability of a formula, our procedure iteratively unfolds the formula and examines the derived disjuncts. In each iteration, it searches for...

全面介紹

Saved in:
書目詳細資料
Main Authors: LE, Quang Loc, SUN, Jun, CHIN, Wei-Ngan
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2016
主題:
在線閱讀:https://ink.library.smu.edu.sg/sis_research/4937
https://ink.library.smu.edu.sg/context/sis_research/article/5940/viewcontent/Satisfiability.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!