Lightweight Nontermination Inference with CHCs

This publication has 35 references indexed in Scilit:

• Program verification via iterated specialization
  Science of Computer Programming, 2014
• Proving Non-termination Using Max-SMT
  Lecture Notes in Computer Science, 2014
• Proving Nontermination via Safety
  2014
• Automatic Inference of Necessary Preconditions
  2013
• Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations
  Electronic Notes in Theoretical Computer Science, 2012
• Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode
  Lecture Notes in Computer Science, 2012
• The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
  Science of Computer Programming, 2008
• Sufficient Preconditions for Modular Assertion Checking
  Lecture Notes in Computer Science, 2008
• Non-termination Checking for Imperative Programs
  2007
• Analysis of Imperative Programs through Analysis of Constraint Logic Programs
  1998