A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
2000
Information and Computation
Over the past few years increasing research effort has been directed towards the automatic verification of infinite-state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems) which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a
doi:10.1006/inco.1999.2843
fatcat:7vkbq4w2jje6hmosmsgomumcuy