Loop-based slicing and input-driven concretization improve (non-)termination analysis only selectively across six tools on 117 real-world C programs, supporting adaptive portfolio use rather than blanket preprocessing.
Synthesising interprocedural bit-precise termination proofs,
1 Pith paper cite this work, alongside 29 external citations. Polarity classification is still indexing.
1
Pith paper citing it
29
external citations · OpenAlex
fields
cs.SE 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Loop-Based Slicing and Input-Driven Concretization: An Empirical Study of Termination and Non-Termination Analysis
Loop-based slicing and input-driven concretization improve (non-)termination analysis only selectively across six tools on 117 real-world C programs, supporting adaptive portfolio use rather than blanket preprocessing.