• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Separation Logic: A Logic for Shared Mutable Data Structures (2002)

Cached

  • Download as a PDF

Download Links

  • [ftp.cs.cmu.edu]
  • [staff.um.edu.mt]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.wm.edu]
  • [www.brinckerhoff.org]
  • [www.scs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.wm.edu]
  • [users.dimi.uniud.it]
  • [www.brinckerhoff.org]
  • [users.dimi.uniud.it]
  • [www.comp.nus.edu.sg]
  • [www.comp.nus.edu.sg]
  • [www-i2.informatik.rwth-aachen.de]

  • Other Repositories/Bibliography

  • CiteULike
  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by John Reynolds
Citations:950 - 6 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Reynolds02separationlogic:,
    author = {John Reynolds},
    title = {Separation Logic: A Logic for Shared Mutable Data Structures},
    booktitle = {},
    year = {2002},
    pages = {55--74},
    publisher = {IEEE Computer Society}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure.

Keyphrases

separation logic    shared mutable data structure    joint work    low-level imperative program    early idea    mutable data structure   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University