Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap access and modification. Properties of separating conjunction and separating implication are mechanically verified and used...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 264 |
|---|---|
| container_issue | |
| container_start_page | 250 |
| container_title | |
| container_volume | |
| creator | Weber, Tjark |
| description | Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap access and modification. Properties of separating conjunction and separating implication are mechanically verified and used to prove soundness and relative completeness of all three Hoare logics. The whole development, including a formal proof of the Frame Rule, is carried out in the theorem prover Isabelle/HOL. |
| doi_str_mv | 10.1007/978-3-540-30124-0_21 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16194651</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16194651</sourcerecordid><originalsourceid>FETCH-LOGICAL-p228t-b33626faecccb7c9a46df43bdc873ee7992ee7b4fb785b4509eee9575791fcf43</originalsourceid><addsrcrecordid>eNo9kE9LAzEQxeM_sNT9Bh724jGaZLKbzcGDFKtCRcHqNSTZpI22u0tSKPrpTVtxDjPMe4-B-SF0Sck1JUTcSNFgwBUnGAhlHBPF6BEqsgxZ3GvkGI1oTSkG4PLk32NAGIdTNMophqXgcI6KlD5JLspE05ARup33Wx3bVD47u9Rd-HFt-Rr7RdTr8sPF4IPVm9B35TZsluWbG3Q87LN-EewFOvN6lVzxN8fofXo_nzzi2cvD0-RuhgfGmg02ADWrvXbWWiOs1LxuPQfT2kaAc0JKlrvh3oimMrwi0jknK1EJSb3NyTG6OtwddLJ65aPubEhqiGGt47fKv0teVzTn2CGXstUtXFSm77-SokTtWKoMRoHKaNSem9qxhF92i2Ia</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Towards Mechanized Program Verification with Separation Logic</title><source>Springer Books</source><creator>Weber, Tjark</creator><contributor>Tarlecki, Andrzej ; Marcinkowski, Jerzy</contributor><creatorcontrib>Weber, Tjark ; Tarlecki, Andrzej ; Marcinkowski, Jerzy</creatorcontrib><description>Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap access and modification. Properties of separating conjunction and separating implication are mechanically verified and used to prove soundness and relative completeness of all three Hoare logics. The whole development, including a formal proof of the Frame Rule, is carried out in the theorem prover Isabelle/HOL.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540230243</identifier><identifier>ISBN: 3540230246</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540301240</identifier><identifier>EISBN: 3540301240</identifier><identifier>DOI: 10.1007/978-3-540-30124-0_21</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Formal Program Verification ; Interactive Theorem Proving ; Logical, boolean and switching functions ; Separation Logic ; Theoretical computing</subject><ispartof>Computer Science Logic, 2004, p.250-264</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30124-0_21$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30124-0_21$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16194651$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Tarlecki, Andrzej</contributor><contributor>Marcinkowski, Jerzy</contributor><creatorcontrib>Weber, Tjark</creatorcontrib><title>Towards Mechanized Program Verification with Separation Logic</title><title>Computer Science Logic</title><description>Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap access and modification. Properties of separating conjunction and separating implication are mechanically verified and used to prove soundness and relative completeness of all three Hoare logics. The whole development, including a formal proof of the Frame Rule, is carried out in the theorem prover Isabelle/HOL.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Formal Program Verification</subject><subject>Interactive Theorem Proving</subject><subject>Logical, boolean and switching functions</subject><subject>Separation Logic</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540230243</isbn><isbn>3540230246</isbn><isbn>9783540301240</isbn><isbn>3540301240</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNo9kE9LAzEQxeM_sNT9Bh724jGaZLKbzcGDFKtCRcHqNSTZpI22u0tSKPrpTVtxDjPMe4-B-SF0Sck1JUTcSNFgwBUnGAhlHBPF6BEqsgxZ3GvkGI1oTSkG4PLk32NAGIdTNMophqXgcI6KlD5JLspE05ARup33Wx3bVD47u9Rd-HFt-Rr7RdTr8sPF4IPVm9B35TZsluWbG3Q87LN-EewFOvN6lVzxN8fofXo_nzzi2cvD0-RuhgfGmg02ADWrvXbWWiOs1LxuPQfT2kaAc0JKlrvh3oimMrwi0jknK1EJSb3NyTG6OtwddLJ65aPubEhqiGGt47fKv0teVzTn2CGXstUtXFSm77-SokTtWKoMRoHKaNSem9qxhF92i2Ia</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Weber, Tjark</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Towards Mechanized Program Verification with Separation Logic</title><author>Weber, Tjark</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p228t-b33626faecccb7c9a46df43bdc873ee7992ee7b4fb785b4509eee9575791fcf43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Formal Program Verification</topic><topic>Interactive Theorem Proving</topic><topic>Logical, boolean and switching functions</topic><topic>Separation Logic</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Weber, Tjark</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Weber, Tjark</au><au>Tarlecki, Andrzej</au><au>Marcinkowski, Jerzy</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Towards Mechanized Program Verification with Separation Logic</atitle><btitle>Computer Science Logic</btitle><date>2004</date><risdate>2004</risdate><spage>250</spage><epage>264</epage><pages>250-264</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540230243</isbn><isbn>3540230246</isbn><eisbn>9783540301240</eisbn><eisbn>3540301240</eisbn><abstract>Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap access and modification. Properties of separating conjunction and separating implication are mechanically verified and used to prove soundness and relative completeness of all three Hoare logics. The whole development, including a formal proof of the Frame Rule, is carried out in the theorem prover Isabelle/HOL.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30124-0_21</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Computer Science Logic, 2004, p.250-264 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16194651 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Formal Program Verification Interactive Theorem Proving Logical, boolean and switching functions Separation Logic Theoretical computing |
| title | Towards Mechanized Program Verification with Separation Logic |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T18%3A25%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Towards%20Mechanized%20Program%20Verification%20with%20Separation%20Logic&rft.btitle=Computer%20Science%20Logic&rft.au=Weber,%20Tjark&rft.date=2004&rft.spage=250&rft.epage=264&rft.pages=250-264&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540230243&rft.isbn_list=3540230246&rft_id=info:doi/10.1007/978-3-540-30124-0_21&rft_dat=%3Cpascalfrancis_sprin%3E16194651%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540301240&rft.eisbn_list=3540301240&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |