Using partial orders to improve automatic verification methods

Using partial orders to improve automatic verification methods

In this paper, we present a verification method for concurrent finite-state systems that attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency by interleavings. The behavior of a system is described in terms of partial orders (more precisely in terms of Mazurki...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Godefroid, Patrice
Format: Buchkapitel
Sprache:eng
Schlagworte:
Combinatorial Explosion
Dine Philosopher
Firable Transition
Firing Sequence
Partial Order
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 185
container_issue
container_start_page 176
container_title
container_volume
creator Godefroid, Patrice
description In this paper, we present a verification method for concurrent finite-state systems that attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency by interleavings. The behavior of a system is described in terms of partial orders (more precisely in terms of Mazurkiewicz's traces) rather than in terms of interleavings. We introduce the notion of “trace automation” which generates only one linearization per partial order. Then we show how to use trace automata to prove program correctness.
doi_str_mv 10.1007/BFb0023731
format Book Chapter
fullrecord <record><control><sourceid>springer</sourceid><recordid>TN_cdi_springer_books_10_1007_BFb0023731</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>springer_books_10_1007_BFb0023731</sourcerecordid><originalsourceid>FETCH-LOGICAL-s224t-93293fbfc20370f44aa9481b226b24a1372f73cdb5c185a50424c40f69c02ec73</originalsourceid><addsrcrecordid>eNpFkE9LxDAUxOM_sK578RPk6KX68t5r014EXVwVFry455KmiVa3myWp-_mtrOBcZmBg-DFCXCm4UQD69mHZAiBpUkfiggoGqqjm6lhkqlQqJ-L65FAUzFqrU5EBAea1ZjoX85Q-YRIhqhIycbdO_fZd7kwce7ORIXYuJjkG2Q-7GPZOmu8xDGbsrdy72PveTjls5eDGj9ClS3HmzSa5-Z_PxHr5-LZ4zlevTy-L-1WeEHnMa8KafOstAmnwzMZMyKpFLFtko0ij12S7trCqKkwBjGwZfFlbQGc1zcT1YTft4sTrYtOG8JUaBc3vKc3_KfQDDbJO5A</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Using partial orders to improve automatic verification methods</title><source>Springer Books</source><creator>Godefroid, Patrice</creator><contributor>Clarke, Edmund M. ; Kurshan, Robert P.</contributor><creatorcontrib>Godefroid, Patrice ; Clarke, Edmund M. ; Kurshan, Robert P.</creatorcontrib><description>In this paper, we present a verification method for concurrent finite-state systems that attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency by interleavings. The behavior of a system is described in terms of partial orders (more precisely in terms of Mazurkiewicz's traces) rather than in terms of interleavings. We introduce the notion of “trace automation” which generates only one linearization per partial order. Then we show how to use trace automata to prove program correctness.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540544771</identifier><identifier>ISBN: 9783540544777</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540383948</identifier><identifier>EISBN: 9783540383949</identifier><identifier>DOI: 10.1007/BFb0023731</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Combinatorial Explosion ; Dine Philosopher ; Firable Transition ; Firing Sequence ; Partial Order</subject><ispartof>Computer-Aided Verification, 1991, p.176-185</ispartof><rights>Springer-Verlag Berlin Heidelberg 1991</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0023731$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0023731$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>775,776,780,789,27902,38232,41418,42487</link.rule.ids></links><search><contributor>Clarke, Edmund M.</contributor><contributor>Kurshan, Robert P.</contributor><creatorcontrib>Godefroid, Patrice</creatorcontrib><title>Using partial orders to improve automatic verification methods</title><title>Computer-Aided Verification</title><description>In this paper, we present a verification method for concurrent finite-state systems that attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency by interleavings. The behavior of a system is described in terms of partial orders (more precisely in terms of Mazurkiewicz's traces) rather than in terms of interleavings. We introduce the notion of “trace automation” which generates only one linearization per partial order. Then we show how to use trace automata to prove program correctness.</description><subject>Combinatorial Explosion</subject><subject>Dine Philosopher</subject><subject>Firable Transition</subject><subject>Firing Sequence</subject><subject>Partial Order</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540544771</isbn><isbn>9783540544777</isbn><isbn>3540383948</isbn><isbn>9783540383949</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1991</creationdate><recordtype>book_chapter</recordtype><sourceid/><recordid>eNpFkE9LxDAUxOM_sK578RPk6KX68t5r014EXVwVFry455KmiVa3myWp-_mtrOBcZmBg-DFCXCm4UQD69mHZAiBpUkfiggoGqqjm6lhkqlQqJ-L65FAUzFqrU5EBAea1ZjoX85Q-YRIhqhIycbdO_fZd7kwce7ORIXYuJjkG2Q-7GPZOmu8xDGbsrdy72PveTjls5eDGj9ClS3HmzSa5-Z_PxHr5-LZ4zlevTy-L-1WeEHnMa8KafOstAmnwzMZMyKpFLFtko0ij12S7trCqKkwBjGwZfFlbQGc1zcT1YTft4sTrYtOG8JUaBc3vKc3_KfQDDbJO5A</recordid><startdate>19910101</startdate><enddate>19910101</enddate><creator>Godefroid, Patrice</creator><general>Springer Berlin Heidelberg</general><scope/></search><sort><creationdate>19910101</creationdate><title>Using partial orders to improve automatic verification methods</title><author>Godefroid, Patrice</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-s224t-93293fbfc20370f44aa9481b226b24a1372f73cdb5c185a50424c40f69c02ec73</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Combinatorial Explosion</topic><topic>Dine Philosopher</topic><topic>Firable Transition</topic><topic>Firing Sequence</topic><topic>Partial Order</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Godefroid, Patrice</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Godefroid, Patrice</au><au>Clarke, Edmund M.</au><au>Kurshan, Robert P.</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Using partial orders to improve automatic verification methods</atitle><btitle>Computer-Aided Verification</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1991-01-01</date><risdate>1991</risdate><spage>176</spage><epage>185</epage><pages>176-185</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540544771</isbn><isbn>9783540544777</isbn><eisbn>3540383948</eisbn><eisbn>9783540383949</eisbn><abstract>In this paper, we present a verification method for concurrent finite-state systems that attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency by interleavings. The behavior of a system is described in terms of partial orders (more precisely in terms of Mazurkiewicz's traces) rather than in terms of interleavings. We introduce the notion of “trace automation” which generates only one linearization per partial order. Then we show how to use trace automata to prove program correctness.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0023731</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Computer-Aided Verification, 1991, p.176-185
issn 0302-9743
1611-3349
language eng
recordid cdi_springer_books_10_1007_BFb0023731
source Springer Books
subjects Combinatorial Explosion
Dine Philosopher
Firable Transition
Firing Sequence
Partial Order
title Using partial orders to improve automatic verification methods
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T09%3A32%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-springer&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Using%20partial%20orders%20to%20improve%20automatic%20verification%20methods&rft.btitle=Computer-Aided%20Verification&rft.au=Godefroid,%20Patrice&rft.date=1991-01-01&rft.spage=176&rft.epage=185&rft.pages=176-185&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540544771&rft.isbn_list=9783540544777&rft_id=info:doi/10.1007/BFb0023731&rft_dat=%3Cspringer%3Espringer_books_10_1007_BFb0023731%3C/springer%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540383948&rft.eisbn_list=9783540383949&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true