## Verifying CTL Properties of Infinite State Systems by Specializing Constraint Logic Programs (2001)

### Cached

### Download Links

Citations: | 17 - 11 self |

### BibTeX

@MISC{Fioravanti01verifyingctl,

author = {Fabio Fioravanti and Alberto Pettorossi and Maurizio Proietti},

title = {Verifying CTL Properties of Infinite State Systems by Specializing Constraint Logic Programs},

year = {2001}

}

### Years of Citing Articles

### OpenURL

### Abstract

this paper we assume that a system makes transitions from states to states and its evolution can be formalized using a computation tree which is dened as follows. Given a system S and its initial state s 0 , the root of the computation tree for S is s 0 , and every node s i of the computation tree for S has a child node s j i there exists in S a transition from state s i to state s j , called a successor state of s i . The set of all states of a system may be nite or innite. We assume that in every system for every state s i there exists at least one successor state