{"id":"https://openalex.org/keywords/termination-verification","display_name":"termination verification","description":"Termination verification is a formal-methods technique for proving that a program or computational process eventually halts.","display_name_alternatives":["program termination verification","verification of program termination","proving program termination"],"ids":{"openalex":"https://openalex.org/keywords/termination-verification","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.6077,"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.6077,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.1986,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":144,"cited_by_count":1231,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/termination-verification","updated_date":"2026-11-22T04:06:09","created_date":"2026-09-30T00:00:00"}
