DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, HS | ko |
dc.contributor.author | O'Hearn, P | ko |
dc.date.accessioned | 2017-08-08T06:55:01Z | - |
dc.date.available | 2017-08-08T06:55:01Z | - |
dc.date.created | 2017-08-02 | - |
dc.date.created | 2017-08-02 | - |
dc.date.created | 2017-08-02 | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, v.2303, pp.402 - 416 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/225305 | - |
dc.description.abstract | We present a semantic analysis of a recently proposed formalism for local reasoning, where a specification (and hence proof) can concentrate on only those cells that a program accesses. Our main results are the soundness and, in a sense, completeness of a rule that allows frame axioms, which describe invariant properties of portions of heap memory, to be inferred automatically; thus, these axioms can be avoided when writing specifications. | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | A semantic basis for local reasoning | - |
dc.type | Article | - |
dc.identifier.wosid | 000181142100028 | - |
dc.identifier.scopusid | 2-s2.0-84948962852 | - |
dc.type.rims | ART | - |
dc.citation.volume | 2303 | - |
dc.citation.beginningpage | 402 | - |
dc.citation.endingpage | 416 | - |
dc.citation.publicationname | FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS | - |
dc.contributor.localauthor | Yang, HS | - |
dc.contributor.nonIdAuthor | O'Hearn, P | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.