Proving Non-termination Using Max-SMT

  title={Proving Non-termination Using Max-SMT},
  author={Daniel Larraz and Kaustubh Nimkar and Albert Oliveras and Enric Rodr{\'i}guez-Carbonell and Albert Rubio},
We show how Max-SMT-based invariant generation can be exploited for proving non-termination of programs. The construction of the proof of nontermination is guided by the generation of quasi-invariants – properties such that if they hold at a location during execution once, then they will continue to hold at that location from then onwards. The check that quasi-invariants can indeed be reached is then performed separately. Our technique considers strongly connected subgraphs of a program’s… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

Similar Papers

Loading similar papers…