Combining Norms to Prove Termination
No abstract available.
DOI 10.1007/3-540-47813-2_9
Related papers
- Termination analysis of logic programs through combination of type-based norms TOPLAS 2007
- Constraint-based termination analysis of logic programs TOPLAS 1999
- Termination combinators forever Haskell 2011
- Proving Termination Through Conditional Termination TACAS 2017
- AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution) TACAS 2022
- Typed Norms ESOP 1992
- Normed Simulations CAV 1998
- Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable APLAS 2009