What else is undecidable about loops?
From MaRDI portal
Publication:6174421
DOI10.1007/978-3-031-28083-2_11OpenAlexW4323527415MaRDI QIDQ6174421
Publication date: 17 August 2023
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-28083-2_11
Cites Work
- Termination of linear programs with nonlinear constraints
- Affine relationships among variables of a program
- The complexity of local dimensions for constructible sets
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers
- Non-polynomial worst-case analysis of recursive programs
- Termination of polynomial loops
- Discovering non-terminating inputs for multi-path polynomial programs
- Computing polynomial program invariants
- On undecidability bounds for matrix decision problems
- Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
- Invariant Generation for Multi-Path Loops with Polynomial Assignments
- Guarded commands, nondeterminacy and formal derivation of programs
- Polynomial Invariants for Affine Programs
- Ideals, Varieties, and Algorithms
- Computer Aided Verification
- The Undecidability of the Generalized Collatz Problem
- Invariant Synthesis for Combined Theories
- Automata, Languages and Programming
- Verification, Model Checking, and Abstract Interpretation
- Termination of Integer Linear Programs
- A variant of a recursively unsolvable problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: What else is undecidable about loops?
