Home
News
People
Publications
Seminar
Courses
Events
Vacancies
Contact
Pulp Fictions
Light
Dark
Automatic
Hilbert ascending chains
On Termination of Polynomial Programs with Equality Conditions
We investigate the termination problem of a family of multi-path polynomial programs (MPPs), in which all assignments to program …
Yangjia Li
,
Naijun Zhan
,
Mingshuai Chen
,
Hui Lu
,
Guohua Wu
,
Joost-Pieter Katoen
PDF
Cite
Code
DOI
Cite
×