Programs with Lists Are Counter Automata
We address the verification problem of programs manipulating one-selector linked data structures. We propose a new automated approach for checking safety and termination for these programs. Our approach is based on using counter automata as accurate abstract models: control states correspond to abst...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 531 |
|---|---|
| container_issue | |
| container_start_page | 517 |
| container_title | |
| container_volume | 4144 |
| creator | Bouajjani, Ahmed Bozga, Marius Habermehl, Peter Iosif, Radu Moro, Pierre Vojnar, Tomáš |
| description | We address the verification problem of programs manipulating one-selector linked data structures. We propose a new automated approach for checking safety and termination for these programs. Our approach is based on using counter automata as accurate abstract models: control states correspond to abstract heap graphs where list segments without sharing are collapsed, and counters are used to keep track of the number of elements in these segments. This allows to apply automatic analysis techniques and tools for counter automata in order to verify list programs. We show the effectiveness of our approach, in particular by verifying automatically termination of some sorting programs. |
| doi_str_mv | 10.1007/11817963_47 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_19150381</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_01418919v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h290t-b6efa32e9d1d93e44cbf69a4b1f19d21a680b5bc5eb5f8817ec8423d62bbeda43</originalsourceid><addsrcrecordid>eNpNUE1Lw0AQXb_AUHvyD-Qi6CG6k9lsdo-hqBUCetDzMptsmmjblN1U8d-bUtHO5cG8D3iPsUvgt8B5fgegINcSjciP2FTnCjPBMRcA4phFIAESRKFPDjku-SmLOPI00bnAczYN4Z2PhyBVBhG7fvH9wtMqxF_d0MZlF4YQF97Fs367HpyPi-3Qr2igC3bW0DK46S9O2NvD_etsnpTPj0-zokzaVPMhsdI1hKnTNdQanRCVbaQmYaEBXadAUnGb2SpzNmvUWMhVSqRYy9RaV5PACbvZ57a0NBvfrch_m546My9Ks_txEKA06E8YtVd77YZCRcvG07rqwp8LNGQcFfxnhpFaL5w3tu8_ggFudsuag2XxB7rIY1I</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Programs with Lists Are Counter Automata</title><source>Springer Books</source><creator>Bouajjani, Ahmed ; Bozga, Marius ; Habermehl, Peter ; Iosif, Radu ; Moro, Pierre ; Vojnar, Tomáš</creator><contributor>Ball, Thomas ; Jones, Robert B.</contributor><creatorcontrib>Bouajjani, Ahmed ; Bozga, Marius ; Habermehl, Peter ; Iosif, Radu ; Moro, Pierre ; Vojnar, Tomáš ; Ball, Thomas ; Jones, Robert B.</creatorcontrib><description>We address the verification problem of programs manipulating one-selector linked data structures. We propose a new automated approach for checking safety and termination for these programs. Our approach is based on using counter automata as accurate abstract models: control states correspond to abstract heap graphs where list segments without sharing are collapsed, and counters are used to keep track of the number of elements in these segments. This allows to apply automatic analysis techniques and tools for counter automata in order to verify list programs. We show the effectiveness of our approach, in particular by verifying automatically termination of some sorting programs.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540374060</identifier><identifier>ISBN: 354037406X</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540374114</identifier><identifier>EISBN: 3540374116</identifier><identifier>DOI: 10.1007/11817963_47</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Abstract Node ; Abstract Structure ; Applied sciences ; Computer Science ; Computer science; control theory; systems ; Counter Automaton ; Exact sciences and technology ; Predicate Abstraction ; Programming Languages ; Sharing Point ; Software ; Software engineering</subject><ispartof>Computer Aided Verification, 2006, Vol.4144, p.517-531</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0003-4412-5684</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11817963_47$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11817963_47$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,309,310,779,780,784,789,790,793,885,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19150381$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-01418919$$DView record in HAL$$Hfree_for_read</backlink></links><search><contributor>Ball, Thomas</contributor><contributor>Jones, Robert B.</contributor><creatorcontrib>Bouajjani, Ahmed</creatorcontrib><creatorcontrib>Bozga, Marius</creatorcontrib><creatorcontrib>Habermehl, Peter</creatorcontrib><creatorcontrib>Iosif, Radu</creatorcontrib><creatorcontrib>Moro, Pierre</creatorcontrib><creatorcontrib>Vojnar, Tomáš</creatorcontrib><title>Programs with Lists Are Counter Automata</title><title>Computer Aided Verification</title><description>We address the verification problem of programs manipulating one-selector linked data structures. We propose a new automated approach for checking safety and termination for these programs. Our approach is based on using counter automata as accurate abstract models: control states correspond to abstract heap graphs where list segments without sharing are collapsed, and counters are used to keep track of the number of elements in these segments. This allows to apply automatic analysis techniques and tools for counter automata in order to verify list programs. We show the effectiveness of our approach, in particular by verifying automatically termination of some sorting programs.</description><subject>Abstract Node</subject><subject>Abstract Structure</subject><subject>Applied sciences</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Counter Automaton</subject><subject>Exact sciences and technology</subject><subject>Predicate Abstraction</subject><subject>Programming Languages</subject><subject>Sharing Point</subject><subject>Software</subject><subject>Software engineering</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540374060</isbn><isbn>354037406X</isbn><isbn>9783540374114</isbn><isbn>3540374116</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNUE1Lw0AQXb_AUHvyD-Qi6CG6k9lsdo-hqBUCetDzMptsmmjblN1U8d-bUtHO5cG8D3iPsUvgt8B5fgegINcSjciP2FTnCjPBMRcA4phFIAESRKFPDjku-SmLOPI00bnAczYN4Z2PhyBVBhG7fvH9wtMqxF_d0MZlF4YQF97Fs367HpyPi-3Qr2igC3bW0DK46S9O2NvD_etsnpTPj0-zokzaVPMhsdI1hKnTNdQanRCVbaQmYaEBXadAUnGb2SpzNmvUWMhVSqRYy9RaV5PACbvZ57a0NBvfrch_m546My9Ks_txEKA06E8YtVd77YZCRcvG07rqwp8LNGQcFfxnhpFaL5w3tu8_ggFudsuag2XxB7rIY1I</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Bouajjani, Ahmed</creator><creator>Bozga, Marius</creator><creator>Habermehl, Peter</creator><creator>Iosif, Radu</creator><creator>Moro, Pierre</creator><creator>Vojnar, Tomáš</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-4412-5684</orcidid></search><sort><creationdate>2006</creationdate><title>Programs with Lists Are Counter Automata</title><author>Bouajjani, Ahmed ; Bozga, Marius ; Habermehl, Peter ; Iosif, Radu ; Moro, Pierre ; Vojnar, Tomáš</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h290t-b6efa32e9d1d93e44cbf69a4b1f19d21a680b5bc5eb5f8817ec8423d62bbeda43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Abstract Node</topic><topic>Abstract Structure</topic><topic>Applied sciences</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Counter Automaton</topic><topic>Exact sciences and technology</topic><topic>Predicate Abstraction</topic><topic>Programming Languages</topic><topic>Sharing Point</topic><topic>Software</topic><topic>Software engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bouajjani, Ahmed</creatorcontrib><creatorcontrib>Bozga, Marius</creatorcontrib><creatorcontrib>Habermehl, Peter</creatorcontrib><creatorcontrib>Iosif, Radu</creatorcontrib><creatorcontrib>Moro, Pierre</creatorcontrib><creatorcontrib>Vojnar, Tomáš</creatorcontrib><collection>Pascal-Francis</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bouajjani, Ahmed</au><au>Bozga, Marius</au><au>Habermehl, Peter</au><au>Iosif, Radu</au><au>Moro, Pierre</au><au>Vojnar, Tomáš</au><au>Ball, Thomas</au><au>Jones, Robert B.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Programs with Lists Are Counter Automata</atitle><btitle>Computer Aided Verification</btitle><date>2006</date><risdate>2006</risdate><volume>4144</volume><spage>517</spage><epage>531</epage><pages>517-531</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540374060</isbn><isbn>354037406X</isbn><eisbn>9783540374114</eisbn><eisbn>3540374116</eisbn><abstract>We address the verification problem of programs manipulating one-selector linked data structures. We propose a new automated approach for checking safety and termination for these programs. Our approach is based on using counter automata as accurate abstract models: control states correspond to abstract heap graphs where list segments without sharing are collapsed, and counters are used to keep track of the number of elements in these segments. This allows to apply automatic analysis techniques and tools for counter automata in order to verify list programs. We show the effectiveness of our approach, in particular by verifying automatically termination of some sorting programs.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11817963_47</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0003-4412-5684</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Computer Aided Verification, 2006, Vol.4144, p.517-531 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19150381 |
| source | Springer Books |
| subjects | Abstract Node Abstract Structure Applied sciences Computer Science Computer science control theory systems Counter Automaton Exact sciences and technology Predicate Abstraction Programming Languages Sharing Point Software Software engineering |
| title | Programs with Lists Are Counter Automata |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T21%3A26%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Programs%20with%20Lists%20Are%20Counter%20Automata&rft.btitle=Computer%20Aided%20Verification&rft.au=Bouajjani,%20Ahmed&rft.date=2006&rft.volume=4144&rft.spage=517&rft.epage=531&rft.pages=517-531&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540374060&rft.isbn_list=354037406X&rft_id=info:doi/10.1007/11817963_47&rft_dat=%3Chal_pasca%3Eoai_HAL_hal_01418919v1%3C/hal_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540374114&rft.eisbn_list=3540374116&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |