DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, Hongseok | ko |
dc.date.accessioned | 2017-08-08T06:54:39Z | - |
dc.date.available | 2017-08-08T06:54:39Z | - |
dc.date.created | 2017-08-02 | - |
dc.date.created | 2017-08-02 | - |
dc.date.created | 2017-08-02 | - |
dc.date.issued | 2007-05 | - |
dc.identifier.citation | THEORETICAL COMPUTER SCIENCE, v.375, no.1-3, pp.308 - 334 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | http://hdl.handle.net/10203/225291 | - |
dc.description.abstract | In this paper, we present a Hoare-style logic for specifying and verifying how two pointer programs are related. Our logic lifts the main features of separation logic, from an assertion to a relation, and from a property about a single program to a relationship between two programs. We show the strength of the logic, by proving that the Schorr-Waite graph marking algorithm is equivalent to the depth-first traversal. (c) 2007 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Relational Separation Logic | - |
dc.type | Article | - |
dc.identifier.wosid | 000246750700014 | - |
dc.identifier.scopusid | 2-s2.0-34047152892 | - |
dc.type.rims | ART | - |
dc.citation.volume | 375 | - |
dc.citation.issue | 1-3 | - |
dc.citation.beginningpage | 308 | - |
dc.citation.endingpage | 334 | - |
dc.citation.publicationname | THEORETICAL COMPUTER SCIENCE | - |
dc.identifier.doi | 10.1016/j.tcs.2006.12.036 | - |
dc.contributor.localauthor | Yang, Hongseok | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | separation logic | - |
dc.subject.keywordAuthor | program verification | - |
dc.subject.keywordAuthor | relational reasoning | - |
dc.subject.keywordAuthor | Schorr-Waite graph marking algorithm | - |
dc.subject.keywordPlus | DATA REFINEMENT | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.