Extracting proofs from tabled proof search

We consider the problem of model checking specifications involving co-inductive definitions such as are available for bisimulation. A proof search approach to model checking with such specifications often involves state exploration. We consider four different tabling strategies that can minimize su...

全面介紹

Saved in:
書目詳細資料
Main Authors: Miller, Dale., Tiu, Alwen.
其他作者: School of Computer Engineering
格式: Conference or Workshop Item
語言:English
出版: 2013
主題:
在線閱讀:https://hdl.handle.net/10356/98261
http://hdl.handle.net/10220/18356
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English