Verification of finite iterations over collections of variable data structures
To extend the application domain of the symbolic verification method, finite iterations over collections of variable data structures are introduced and reduced to standard finite iterations. This reduction is extended to finite iterations including the break statement. The generalization of the symb...
Gespeichert in:
Veröffentlicht in: | Cybernetics and systems analysis 2007-05, Vol.43 (3), p.341-352 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | To extend the application domain of the symbolic verification method, finite iterations over collections of variable data structures are introduced and reduced to standard finite iterations. This reduction is extended to finite iterations including the break statement. The generalization of the symbolic method allows applying it to pointer program verification. [PUBLICATION ABSTRACT] |
---|---|
ISSN: | 1060-0396 1573-8337 |
DOI: | 10.1007/s10559-007-0055-5 |