termination proving
Description: Termination proving is the formal verification task of establishing that programs, rewrite systems, or computations always halt.
Primary topic: Logic, programming, and type systems (91%)
Related topic: Logic, programming, and type systems (91%)
OpenAlex ID: keywords/termination-proving
