Skip navigation
Skip navigation

Proving Infinite Satisfiability

Baumgartner, Peter; Bax, Joshua

Description

We consider the problem of automatically disproving invalid conjectures over data structures such as lists and arrays over integers, in the presence of additional hypotheses over these data structures. We investigate a simple approach based on refutationa

CollectionsANU Research Publications
Date published: 2013
Type: Book chapter
URI: http://hdl.handle.net/1885/66288
DOI: 10.1007/978-3-642-45221-5_6

Download

File Description SizeFormat Image
01_Baumgartner_Proving_Infinite_2013.pdf117 kBAdobe PDF    Request a copy


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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator