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!
|
| container_end_page | 352 |
|---|---|
| container_issue | 3 |
| container_start_page | 341 |
| container_title | Cybernetics and systems analysis |
| container_volume | 43 |
| creator | Nepomniaschy, V A |
| description | 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] |
| doi_str_mv | 10.1007/s10559-007-0055-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_34955044</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>34955044</sourcerecordid><originalsourceid>FETCH-LOGICAL-c303t-a8746f68ebe827000d0f4c7eb680d513a87eccb807c3a1cfb80360c2c8ffa3e53</originalsourceid><addsrcrecordid>eNpdUE1LAzEUDKJgrf4Ab8GDt9WXZvOxRyl-QdGLeg3Z9AVStpua7Bb892ZtTx6GN8wbhmEIuWZwxwDUfWYgRFMVWiBEJU7IjAnFK825Oi0cJFTAG3lOLnLeAAAHpWfk7QtT8MHZIcSeRk996MOAtCD9aZnGPSbqYtehOwqe7m0Ktu2Qru1gaR7S6IYxYb4kZ952Ga-Od04-nx4_li_V6v35dfmwqhwHPlRWq1p6qbFFvVClzBp87RS2UsNaMF7-6FyrQTlumfOFcQlu4bT3lqPgc3J7yN2l-D1iHsw2ZIddZ3uMYza8boSAui7Gm3_GTRxTX7qZBZMCJNdTGjuYXIo5J_Rml8LWph_DwEzzmsO8ZqLTvEbwX8Ptbkw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>216506385</pqid></control><display><type>article</type><title>Verification of finite iterations over collections of variable data structures</title><source>SpringerLink Journals - AutoHoldings</source><creator>Nepomniaschy, V A</creator><creatorcontrib>Nepomniaschy, V A</creatorcontrib><description>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]</description><identifier>ISSN: 1060-0396</identifier><identifier>EISSN: 1573-8337</identifier><identifier>DOI: 10.1007/s10559-007-0055-5</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Mathematical analysis ; Protocol verification ; Studies</subject><ispartof>Cybernetics and systems analysis, 2007-05, Vol.43 (3), p.341-352</ispartof><rights>Springer Science+Business Media, Inc. 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c303t-a8746f68ebe827000d0f4c7eb680d513a87eccb807c3a1cfb80360c2c8ffa3e53</citedby><cites>FETCH-LOGICAL-c303t-a8746f68ebe827000d0f4c7eb680d513a87eccb807c3a1cfb80360c2c8ffa3e53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Nepomniaschy, V A</creatorcontrib><title>Verification of finite iterations over collections of variable data structures</title><title>Cybernetics and systems analysis</title><description>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]</description><subject>Mathematical analysis</subject><subject>Protocol verification</subject><subject>Studies</subject><issn>1060-0396</issn><issn>1573-8337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpdUE1LAzEUDKJgrf4Ab8GDt9WXZvOxRyl-QdGLeg3Z9AVStpua7Bb892ZtTx6GN8wbhmEIuWZwxwDUfWYgRFMVWiBEJU7IjAnFK825Oi0cJFTAG3lOLnLeAAAHpWfk7QtT8MHZIcSeRk996MOAtCD9aZnGPSbqYtehOwqe7m0Ktu2Qru1gaR7S6IYxYb4kZ952Ga-Od04-nx4_li_V6v35dfmwqhwHPlRWq1p6qbFFvVClzBp87RS2UsNaMF7-6FyrQTlumfOFcQlu4bT3lqPgc3J7yN2l-D1iHsw2ZIddZ3uMYza8boSAui7Gm3_GTRxTX7qZBZMCJNdTGjuYXIo5J_Rml8LWph_DwEzzmsO8ZqLTvEbwX8Ptbkw</recordid><startdate>20070501</startdate><enddate>20070501</enddate><creator>Nepomniaschy, V A</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>S0W</scope><scope>7SC</scope><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20070501</creationdate><title>Verification of finite iterations over collections of variable data structures</title><author>Nepomniaschy, V A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c303t-a8746f68ebe827000d0f4c7eb680d513a87eccb807c3a1cfb80360c2c8ffa3e53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Mathematical analysis</topic><topic>Protocol verification</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nepomniaschy, V A</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>DELNET Engineering & Technology Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Cybernetics and systems analysis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nepomniaschy, V A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Verification of finite iterations over collections of variable data structures</atitle><jtitle>Cybernetics and systems analysis</jtitle><date>2007-05-01</date><risdate>2007</risdate><volume>43</volume><issue>3</issue><spage>341</spage><epage>352</epage><pages>341-352</pages><issn>1060-0396</issn><eissn>1573-8337</eissn><abstract>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]</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1007/s10559-007-0055-5</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1060-0396 |
| ispartof | Cybernetics and systems analysis, 2007-05, Vol.43 (3), p.341-352 |
| issn | 1060-0396 1573-8337 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_34955044 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Mathematical analysis Protocol verification Studies |
| title | Verification of finite iterations over collections of variable data structures |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T01%3A33%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Verification%20of%20finite%20iterations%20over%20collections%20of%20variable%20data%20structures&rft.jtitle=Cybernetics%20and%20systems%20analysis&rft.au=Nepomniaschy,%20V%20A&rft.date=2007-05-01&rft.volume=43&rft.issue=3&rft.spage=341&rft.epage=352&rft.pages=341-352&rft.issn=1060-0396&rft.eissn=1573-8337&rft_id=info:doi/10.1007/s10559-007-0055-5&rft_dat=%3Cproquest_cross%3E34955044%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=216506385&rft_id=info:pmid/&rfr_iscdi=true |