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. |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/98261 http://hdl.handle.net/10220/18356 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A labelled sequent calculus for BBI : proof theory and proof search
by: Hóu, Zhé, et al.
Published: (2020) -
Fair and dynamic proofs of retrievability
by: Nguyen, Ngoc Tram Anh
Published: (2015) -
Proof of stake-based blockchain applications
by: Fecho, Tyrone Jiale
Published: (2019) -
Proof-of-concept blockchain application for private marketplace
by: Tan, Wei Hsing
Published: (2019) -
Proof of concept blockchain for version control
by: Leow, Zheng Xu
Published: (2019)