The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
TRANSIT: specifying protocols with concolic snippets
Abstract
With the maturing of technology for model checking and constraint solving, there is an emerging opportunity to develop programming tools that can transform the way systems are specified. In this paper, we propose a new way to program distributed protocols using concolic snippets. Concolic snippets are sample execution fragments that contain both concrete and symbolic values. The proposed approach allows the programmer to describe the desired system partially using the traditional model of communicating extended finite-state-machines (EFSM), along with high-level invariants and concrete execution fragments. Our synthesis engine completes an EFSM skeleton by inferring guards and updates from the given fragments which is then automatically analyzed using a model checker with respect to the desired invariants. The counterexamples produced by the model checker can then be used by the programmer to add new concrete execution fragments that describe the correct behavior in the specific scenario corresponding to the counterexample.
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
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
Programming by sketching for bit-streaming programs
Solar-Lezama, A., Rabbah, R., Bodík, R., & Ebcioğlu, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065045 · Cited by 195
Research works printed but not linked: 26
- 10.5555/838237.838522 · doi:10.5555/838237.838522
- 10.1007/BF01383968 · doi:10.1007/bf01383968
- 10.1109/MEMCOD.2005.1487887 · doi:10.1109/memcod.2005.1487887
- 10.5555/645461.654859 · doi:10.5555/645461.654859
- 10.1007/978-3-642-27940-9_15 · doi:10.1007/978-3-642-27940-9_15
- 10.1145/1926385.1926423 · DOI · Paper page
- 10.1145/1993498.1993506 · DOI · Paper page
- 10.1109/MC.2008.10 · doi:10.1109/mc.2008.10
- D. Harel and R. Marelly . Come , Let's Play: Scenario-Based Programming Using LSCs and the Play-Engine . Springer-Verlag New York , 2003 . D. Harel and R. Marelly. Come, Let's Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer-Verlag New York, 2003. · doi:10.1007/978-3-642-19029-2
- 10.1145/2209249.2209270 · DOI
- G. J. Holzmann . The Spin Model Checker: Primer and Reference Manual . Addison-Wesley , 2003 . G. J. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2003.
- 10.1145/1806799.1806833 · DOI · Paper page
- G. Katz and D. Peled . MCGP: A Software Synthesis Tool Based on Model Checking and Genetic Programming. In 8th Internation Symposium on Automated Technology for Verification and Analysis, ATVA '10 , LNCS 6252, pages 359 -- 364 , 2010 . G. Katz and D. Peled. MCGP: A Software Synthesis Tool Based on Model Checking and Genetic Programming. In 8th Internation Symposium on Automated Technology for Verification and Analysis, ATVA '10, LNCS 6252, pages 359--364, 2010.
- 10.1145/2076450.2076472 · DOI
- 10.1145/264107.264206 · DOI · Paper page
- N. A. Lynch . Distributed algorithms . Morgan Kaufmann Publishers Inc ., 1996 . N. A. Lynch. Distributed algorithms. Morgan Kaufmann Publishers Inc., 1996.
- 10.1145/1105734.1105747 · DOI · Paper page
- 10.5555/1792734.1792766 · doi:10.5555/1792734.1792766
- 10.1145/1081706.1081750 · DOI · Paper page
- 10.1145/2228360.2228425 · DOI
- 10.1145/2025113.2025153 · DOI
- 10.1145/1375581.1375599 · DOI · Paper page
- 10.5555/2028905 · doi:10.5555/2028905
- 10.1145/1706299.1706337 · DOI · Paper page
- 10.5555/1517424.1517434 · doi:10.5555/1517424.1517434
- 10.5555/3266641.3266643 · doi:10.5555/3266641.3266643
Cited by
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
Self-citationProgram synthesis using conflict-driven learning
Feng, Y., Martins, R., Bastani, O., & Dillig, I. (2018) · Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3192366.3192382 · Cited by 111
Clover: Closed-Loop Verifiable Code Generation
Sun, C., Sheng, Y., Padon, O., & Barrett, C. (2024) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-65112-0_7 · Cited by 43
Clover: Closed-Loop Verifiable Code Generation
Sun, C., Sheng, Y., Padon, O., & Barrett, C. (2023) · arXiv · doi:10.48550/arxiv.2310.17807 · Cited by 43
LooPy: interactive program synthesis with control structures
Ferdowsifard, K., Barke, S., Peleg, H., Lerner, S., & Polikarpova, N. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3485530 · Cited by 18
Metadata
- Authors
- Udupa, A., Raghavan, A., Deshmukh, J. V., Mador-Haim, S., Martin, M. M. K., & Alur, R.
- Venue
- Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2013-06-16
- Pages
- 287-296
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2161159055
- Cited by
- 158
- References
- 2
- FWCI
- 12.31
- 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: TRANSIT: specifying protocols with concolic snippets. https://app.cochat.ai/papers/10.1145/2491956.2462174
- The paper
- Udupa, A., Raghavan, A., Deshmukh, J. V., Mador-Haim, S., Martin, M. M. K., & Alur, R. (2013). TRANSIT: specifying protocols with concolic snippets. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/2491956.2462174
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.