The DOI matches its Crossref record.
Full functional verification of linked data structures
Open accessAbstract
We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables. Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data structure implementations (with the exception of properties involving execution time and/or memory consumption). Given that the desired correctness properties include intractable constructs such as quantifiers, transitive closure, and lambda abstraction, it is a challenge to successfully prove the generated verification conditions.
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
Cited by
Dafny: An Automatic Program Verifier for Functional Correctness
Leino, K. R. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17511-4_20 · Cited by 940
A type and effect system for deterministic parallel Java
Bocchino, R. L., Adve, V. S., Dig, D., Adve, S. V., Heumann, S., Komuravelli, R., Overbey, J., Simmons, P., Sung, H., & Vakilian, M. (2009) · ACM SIGPLAN Notices · doi:10.1145/1639949.1640097 · Cited by 295
A type and effect system for deterministic parallel Java
Bocchino, R. L., Adve, V. S., Dig, D., Adve, S. V., Heumann, S., Komuravelli, R., Overbey, J., Simmons, P., Sung, H., & Vakilian, M. (2009) · Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications · doi:10.1145/1640089.1640097 · Cited by 265
“, more complex program logic [52] or static analysis [42, 4]) to ensure that methods declared to be commutative are really commutative.”
Background
Metadata
- Authors
- Zee, K., Kuncak, V., & Rinard, M.
- Venue
- Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2008-06-07
- Pages
- 349-361
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2147650421
- Cited by
- 203
- References
- 0
- FWCI
- 27.54
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Full functional verification of linked data structures. https://app.cochat.ai/papers/10.1145/1375581.1375624
- The paper
- Zee, K., Kuncak, V., & Rinard, M. (2008). Full functional verification of linked data structures. Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/1375581.1375624
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.