Proving Nontermination via Safety
Lists
Only you see this
Abstract
We show how the problem of nontermination proving can be reduced to a question of underapproximation search guided by a safety prover. This reduction leads to new nontermination proving implementation strategies based on existing tools for safety proving. Our preliminary implementation beats existing tools. Furthermore, our approach leads to easy support for programs with unbounded nondeterminism.
BibTeX
@inproceedings{chen2014proving,
author = {Hong Yi Chen and Byron Cook and Carsten Fuhs and Kaustubh Nimkar and Peter W. O'Hearn},
title = {{Proving Nontermination via Safety}},
booktitle = {TACAS},
year = {2014},
url = {https://openreview.net/forum?id=Z3lmK7RBDG},
}Loading related content...