{"id":"https://openalex.org/keywords/termination-proving","display_name":"termination proving","description":"Termination proving is the formal verification task of establishing that programs, rewrite systems, or computations always halt.","display_name_alternatives":["proving termination"],"ids":{"openalex":"https://openalex.org/keywords/termination-proving","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9141,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9141,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":229,"cited_by_count":3499,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/termination-proving","updated_date":"2026-11-21T04:06:33","created_date":"2026-09-30T00:00:00"}
