Rely-Guarantee Based Reasoning for Message-Passing Programs1
The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying inter-thread interferences. However, modern verification requires better locality...
Gespeichert in:
| Veröffentlicht in: | Scientific annals of computer science 2014-07, Vol.24 (2), p.217-217 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 217 |
|---|---|
| container_issue | 2 |
| container_start_page | 217 |
| container_title | Scientific annals of computer science |
| container_volume | 24 |
| creator | Lei, Jinjiang Qiu, Zongyan |
| description | The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying inter-thread interferences. However, modern verification requires better locality and modularity. It is still a great challenge to verify a message-passing program in a modular and composable way. In this paper, we propose a new reasoning system for message-passing programs. It is a novel logic that supports Hoare style triples to specify and verify distributed programs modularly. We concretize the concept of event traces to represent interactions among distributed agents, and specify behaviors of agents by their local traces with regard to environmental assumptions | an idea inspired by Rely-Guarantee reasoning. Based on trace semantics, the verification is compositional in both temporal and spatial dimensions. To show validity, we apply our logic to modularly prove several examples. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1669893138</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1669893138</sourcerecordid><originalsourceid>FETCH-LOGICAL-p618-ff1eaa51f4f70851662005486a388eff7a3fd94f7f4a2157d2dbf2933c4501033</originalsourceid><addsrcrecordid>eNpdj01LAzEQhoMoWGr_w4IXL4FMPnYT8KJFq1CxlN7L2J0sLdtNzXQP_nsjenIuL8z78DBzISZaWy91HdylmIC3RnrQcC1mzAdVxgTrg5mI-zX1X3IxYsbhTFQ9IlNbrQk5Dfuhq2LK1RsxY0dyhcw_u1VOXcYjw424itgzzf5yKjbPT5v5i1y-L17nD0t5qsHLGIEQHUQbG-Ud1LVWyllfo_GeYmzQxDaUMlrU4JpWtx9RB2N21ilQxkzF3a_2lNPnSHzeHve8o77HgdLI22IM5RkwvqC3_9BDGvNQjiuUdWCtVt58AziGUdQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1645144208</pqid></control><display><type>article</type><title>Rely-Guarantee Based Reasoning for Message-Passing Programs1</title><source>DOAJ Directory of Open Access Journals</source><source>EZB Electronic Journals Library</source><creator>Lei, Jinjiang ; Qiu, Zongyan</creator><creatorcontrib>Lei, Jinjiang ; Qiu, Zongyan</creatorcontrib><description>The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying inter-thread interferences. However, modern verification requires better locality and modularity. It is still a great challenge to verify a message-passing program in a modular and composable way. In this paper, we propose a new reasoning system for message-passing programs. It is a novel logic that supports Hoare style triples to specify and verify distributed programs modularly. We concretize the concept of event traces to represent interactions among distributed agents, and specify behaviors of agents by their local traces with regard to environmental assumptions | an idea inspired by Rely-Guarantee reasoning. Based on trace semantics, the verification is compositional in both temporal and spatial dimensions. To show validity, we apply our logic to modularly prove several examples.</description><identifier>ISSN: 1843-8121</identifier><identifier>EISSN: 2248-2695</identifier><language>eng</language><publisher>Iasi: Alexandru Ioan Cuza University of Iasi</publisher><subject>Logic ; Modular ; Modularity ; Program verification (computers) ; Reasoning ; Semantics ; Temporal logic</subject><ispartof>Scientific annals of computer science, 2014-07, Vol.24 (2), p.217-217</ispartof><rights>Copyright Alexandru Ioan Cuza University of Iasi 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780</link.rule.ids></links><search><creatorcontrib>Lei, Jinjiang</creatorcontrib><creatorcontrib>Qiu, Zongyan</creatorcontrib><title>Rely-Guarantee Based Reasoning for Message-Passing Programs1</title><title>Scientific annals of computer science</title><description>The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying inter-thread interferences. However, modern verification requires better locality and modularity. It is still a great challenge to verify a message-passing program in a modular and composable way. In this paper, we propose a new reasoning system for message-passing programs. It is a novel logic that supports Hoare style triples to specify and verify distributed programs modularly. We concretize the concept of event traces to represent interactions among distributed agents, and specify behaviors of agents by their local traces with regard to environmental assumptions | an idea inspired by Rely-Guarantee reasoning. Based on trace semantics, the verification is compositional in both temporal and spatial dimensions. To show validity, we apply our logic to modularly prove several examples.</description><subject>Logic</subject><subject>Modular</subject><subject>Modularity</subject><subject>Program verification (computers)</subject><subject>Reasoning</subject><subject>Semantics</subject><subject>Temporal logic</subject><issn>1843-8121</issn><issn>2248-2695</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</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>eNpdj01LAzEQhoMoWGr_w4IXL4FMPnYT8KJFq1CxlN7L2J0sLdtNzXQP_nsjenIuL8z78DBzISZaWy91HdylmIC3RnrQcC1mzAdVxgTrg5mI-zX1X3IxYsbhTFQ9IlNbrQk5Dfuhq2LK1RsxY0dyhcw_u1VOXcYjw424itgzzf5yKjbPT5v5i1y-L17nD0t5qsHLGIEQHUQbG-Ud1LVWyllfo_GeYmzQxDaUMlrU4JpWtx9RB2N21ilQxkzF3a_2lNPnSHzeHve8o77HgdLI22IM5RkwvqC3_9BDGvNQjiuUdWCtVt58AziGUdQ</recordid><startdate>20140701</startdate><enddate>20140701</enddate><creator>Lei, Jinjiang</creator><creator>Qiu, Zongyan</creator><general>Alexandru Ioan Cuza University of Iasi</general><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BYOGL</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20140701</creationdate><title>Rely-Guarantee Based Reasoning for Message-Passing Programs1</title><author>Lei, Jinjiang ; Qiu, Zongyan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p618-ff1eaa51f4f70851662005486a388eff7a3fd94f7f4a2157d2dbf2933c4501033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Logic</topic><topic>Modular</topic><topic>Modularity</topic><topic>Program verification (computers)</topic><topic>Reasoning</topic><topic>Semantics</topic><topic>Temporal logic</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lei, Jinjiang</creatorcontrib><creatorcontrib>Qiu, Zongyan</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Database (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Databases</collection><collection>Technology Collection</collection><collection>ProQuest East Europe, Central Europe Database</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science 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><collection>Computing Database</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>test</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Scientific annals of computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lei, Jinjiang</au><au>Qiu, Zongyan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Rely-Guarantee Based Reasoning for Message-Passing Programs1</atitle><jtitle>Scientific annals of computer science</jtitle><date>2014-07-01</date><risdate>2014</risdate><volume>24</volume><issue>2</issue><spage>217</spage><epage>217</epage><pages>217-217</pages><issn>1843-8121</issn><eissn>2248-2695</eissn><abstract>The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying inter-thread interferences. However, modern verification requires better locality and modularity. It is still a great challenge to verify a message-passing program in a modular and composable way. In this paper, we propose a new reasoning system for message-passing programs. It is a novel logic that supports Hoare style triples to specify and verify distributed programs modularly. We concretize the concept of event traces to represent interactions among distributed agents, and specify behaviors of agents by their local traces with regard to environmental assumptions | an idea inspired by Rely-Guarantee reasoning. Based on trace semantics, the verification is compositional in both temporal and spatial dimensions. To show validity, we apply our logic to modularly prove several examples.</abstract><cop>Iasi</cop><pub>Alexandru Ioan Cuza University of Iasi</pub><tpages>1</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1843-8121 |
| ispartof | Scientific annals of computer science, 2014-07, Vol.24 (2), p.217-217 |
| issn | 1843-8121 2248-2695 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1669893138 |
| source | DOAJ Directory of Open Access Journals; EZB Electronic Journals Library |
| subjects | Logic Modular Modularity Program verification (computers) Reasoning Semantics Temporal logic |
| title | Rely-Guarantee Based Reasoning for Message-Passing Programs1 |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T22%3A31%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Rely-Guarantee%20Based%20Reasoning%20for%20Message-Passing%20Programs1&rft.jtitle=Scientific%20annals%20of%20computer%20science&rft.au=Lei,%20Jinjiang&rft.date=2014-07-01&rft.volume=24&rft.issue=2&rft.spage=217&rft.epage=217&rft.pages=217-217&rft.issn=1843-8121&rft.eissn=2248-2695&rft_id=info:doi/&rft_dat=%3Cproquest%3E1669893138%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1645144208&rft_id=info:pmid/&rfr_iscdi=true |