Automatic Termination Analysis for Partial Functions Using Polynomial Orderings
No abstract available.
Related papers
- Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language SAS 1996
- A New Order-Theoretic Characterisation of the Polytime Computable Functions APLAS 2012
- Termination Analysis for Partial Functions SAS 1996
- Termination analysis and specialization-point insertion in offline partial evaluation TOPLAS 2005
- Raising expectations: automating expected cost analysis with types ICFP 2020
- Termination Analysis of Probabilistic Programs Through Positivstellensatz's CAV 2016
- Higher-Order Demand-Driven Program Analysis ECOOP 2016
- Program termination analysis in polynomial time TOPLAS 2007