The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Sketching concurrent data structures
Abstract
We describe PSketch, a program synthesizer that helps programmers implement concurrent data structures. The system is based on the concept of sketching, a form of synthesis that allows programmers to express their insight about an implementation as a partial program: a sketch. The synthesizer automatically completes the sketch to produce an implementation that matches a given correctness criteria.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Solar-Lezama, A., Arnold, G., Tancau, L., Bodik, R., Saraswat, V., & Seshia, S. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250754 · Cited by 149
Self-citation
Cited by
A systematic study of automated program repair: Fixing 55 out of 105 bugs for $8 each
Le Goues, C., Dewey-Vogt, M., Forrest, S., & Weimer, W. (2012) · 2012 34th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2012.6227211 · Cited by 326
From program verification to program synthesis
Srivastava, S., Gulwani, S., & Foster, J. S. (2010) · Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1706299.1706337 · Cited by 267
An Abstraction-Refinement Approach to Verification of Artificial Neural Networks
Pulina, L., & Tacchella, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14295-6_24 · Cited by 261
Learning programs by learning from failures
Cropper, A., & Morel, R. (2021) · Machine Learning · doi:10.1007/s10994-020-05934-z · Cited by 86
“Anotherway of viewing ILASP3 is that it uses a counter-example guided (Solar-Lezama et al. 2008) approach and translates an uncovered example e into a constraint that is satisfied if and only if e is covered.”
BackgroundMethodPYEVOLVE: Automating Frequent Code Changes in Python ML Systems
Dilhara, M., Dig, D., & Ketkar, A. (2023) · 2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE) · doi:10.1109/icse48619.2023.00091 · Cited by 46
Metadata
- Authors
- Solar-Lezama, A., Jones, C. G., & Bodik, R.
- Venue
- Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2008-06-07
- Pages
- 136-148
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W1974514467
- Cited by
- 195
- References
- 1
- FWCI
- 8.93
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sketching concurrent data structures. https://app.cochat.ai/papers/10.1145/1375581.1375599
- The paper
- Solar-Lezama, A., Jones, C. G., & Bodik, R. (2008). Sketching concurrent data structures. Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/1375581.1375599
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.