Non-termination Inference for Constraint Logic Programs
Abstract elided by the publisher.
Related papers
- Termination and non-termination specification inference PLDI 2015
- Constraint-based termination analysis of logic programs TOPLAS 1999
- Refinement Type Inference via Horn Constraint Optimization SAS 2015
- Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs SAS 2001
- Inference of Well-Typings for Logic Programs with Application to Termination Analysis SAS 2005
- Analysis of Markov Jump Processes under Terminal Constraints TACAS 2021
- An extension of HM(X) with bounded existential and universal data-types ICFP 2003
- Constraint-Based Relational Verification CAV 2021