Paper Info
Title
Termination of Single-Path Polynomial Loop Programs.
Abstract
Termination analysis of polynomial programs plays a very important role in applications of safety critical software. In this paper, we investigate the termination problem of single-path polynomial loop programs (SPLPs) over the reals. For such a loop program, we first assume that the set characterized by its loop guards is closed, bounded and connected. And then, we give some conditions and prove that under such conditions, the termination of single-path loop programs is decidable over the reals.
Year
DOI
Venue
2016
10.1007/978-3-319-46750-4_3
Lecture Notes in Computer Science
Field
DocType
Volume
Discrete mathematics,Polynomial,Polynomial matrix,Computer science,Decidability,Termination analysis,Software,Bounded function
Conference
9965
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
14
1
Name
Order
Citations
PageRank
Yi. Li1143.43