Skip navigation
Skip navigation

Extracting proofs from tabled proof search

Miller, Dale; Tiu, Alwen


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 diffe

CollectionsANU Research Publications
Date published: 2013
Type: Conference paper
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-319-03545-1_13


File Description SizeFormat Image
01_Miller_Extracting_proofs_from_tabled_2013.pdf270.76 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator