http://www.cnr.it/ontology/cnr/individuo/prodotto/ID7012
Verification of Sets of Infinite State Systems Using Program Transformation (Articolo in rivista)
- Type
- Label
- Verification of Sets of Infinite State Systems Using Program Transformation (Articolo in rivista) (literal)
- Anno
- 2002-01-01T00:00:00+01:00 (literal)
- Alternative label
Fioravanti, F.; Pettorossi, A.; Proietti, M. (2002)
Verification of Sets of Infinite State Systems Using Program Transformation
in Lecture notes in computer science
(literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Fioravanti, F.; Pettorossi, A.; Proietti, M. (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Note
- ISI Web of Science (WOS) (literal)
- Titolo
- Verification of Sets of Infinite State Systems Using Program Transformation (literal)
- Abstract
- We present a method for the verification of safety properties of concurrent
systems which consist of finite sets of infinite state processes. Systems
and properties are specified by using constraint logic programs, and the
inference engine for verifying properties is provided by a technique based
on unfold/fold program transformations. We deal with properties of finite
sets of processes of arbitrary cardinality, and in order to do so, we
consider constraint logic programs where the constraint theory is the Weak
Monadic Second Order Theory of k Successors. Our verification method
consists in transforming the programs that specify the properties of
interest into equivalent programs where the truth of these properties can
be checked by simple inspection in constant time. We present a strategy for
guiding the application of the unfold/fold rules and realizing the
transformations in a semiautomatic way. (literal)
- Prodotto di
- Autore CNR
Incoming links:
- Autore CNR di
- Prodotto
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
