The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
BI as an assertion language for mutable data structures
Abstract
Reynolds has developed a logic for reasoning about mutable data structures in which the pre- and postconditions are written in an intuitionistic logic enriched with a spatial form of conjunction. We investigate the approach from the point of view of the logic BI of bunched implications of O'Hearnand Pym. We begin by giving a model in which the law of the excluded middleholds, thus showing that the approach is compatible with classical logic. The relationship between the intuitionistic and classical versions of the system is established by a translation, analogous to a translation from intuitionistic logic into the modal logic S4. We also consider the question of completeness of the axioms. BI's spatial implication is used to express weakest preconditions for object-component assignments, and an axiom for allocating a cons cell is shown to be complete under an interpretation of triplesthat allows a command to be applied to states with dangling pointers. We make this latter a feature, by incorporating an operation, and axiom, for disposing of memory. Finally, we describe a local character enjoyed by specifications in the logic, and show how this enables a class of frame axioms, which say what parts of the heap don't change, to be inferred automatically.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
The Logic of Bunched Implications
O’Hearn, P. W., & Pym, D. J. (1999) · Bulletin of Symbolic Logic · doi:10.2307/421090 · Cited by 514
Self-citationSoundness and Completeness of an Axiom System for Program Verification
Cook, S. A. (1978) · SIAM Journal on Computing · doi:10.1137/0207005 · Cited by 461
Parametric shape analysis via 3-valued logic
Sagiv, M., Reps, T., & Wilhelm, R. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292552 · Cited by 343
Syntactic control of interference
Reynolds, J. C. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512766 · Cited by 200
Towards a geometry of interaction
Girard, J.-Y. (1989) · Contemporary Mathematics · doi:10.1090/conm/092/1003197 · Cited by 146
Safety checking of machine code
Xu, Z., Miller, B. P., & Reps, T. (2000) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/349299.349313 · Cited by 73
Syntactic control of interference revisited
O’Hearn, P. W., Power, J., Takeyama, M., & Tennent, R. D. (1999) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00359-4 · Cited by 65
Self-citation
Cited by
Separation logic: a logic for shared mutable data structures
Reynolds, J. C. (2003) · Proceedings 17th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2002.1029817 · Cited by 2,156
Local Reasoning about Programs that Alter Data Structures
O’Hearn, P., Reynolds, J., & Yang, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44802-0_1 · Cited by 705
Self-citationAutomatic predicate abstraction of C programs
Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442783 · Cited by 694
Automatic predicate abstraction of C programs
Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K. (2001) · Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation · doi:10.1145/378795.378846 · Cited by 442
Metadata
- Authors
- Ishtiaq, S. S., & O'Hearn, P. W.
- Venue
- Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2001-01
- Pages
- 14-26
- OpenAlex
- W4256027310
- Cited by
- 287
- References
- 9
- FWCI
- 10.05
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.