A second-order formulation of non-termination
From MaRDI portal
Publication:2353638
DOI10.1016/j.ipl.2015.05.012zbMath1331.68053arXiv1412.3271OpenAlexW1815666329MaRDI QIDQ2353638
Publication date: 15 July 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3271
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the existence of nonterminating queries for a restricted class of PROLOG-clauses
- Proving non-termination
- Monotonicity Constraints for Termination in the Integer Domain
- The size-change principle for program termination
- Computer Aided Verification
- Logic Programming
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Verification, Model Checking, and Abstract Interpretation
- Termination of Integer Linear Programs
- Deciding Conditional Termination
This page was built for publication: A second-order formulation of non-termination