Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 158

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

Udupa, Abhishek, Raghavan, Arun, Deshmukh, Jyotirmoy V., Mador-Haim, Sela, Martin, Milo M.K., Alur, Rajeev · 2013 · Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2491956.2462174

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 26

  1. 10.5555/838237.838522 · doi:10.5555/838237.838522
  2. 10.1007/BF01383968 · doi:10.1007/bf01383968
  3. 10.1109/MEMCOD.2005.1487887 · doi:10.1109/memcod.2005.1487887
  4. 10.5555/645461.654859 · doi:10.5555/645461.654859
  5. 10.1007/978-3-642-27940-9_15 · doi:10.1007/978-3-642-27940-9_15
  6. 10.1145/1926385.1926423 · DOI · Paper page
  7. 10.1145/1993498.1993506 · DOI · Paper page
  8. 10.1109/MC.2008.10 · doi:10.1109/mc.2008.10
  9. 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. 10.1145/2209249.2209270 · DOI
  11. 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.
  12. 10.1145/1806799.1806833 · DOI · Paper page
  13. 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.
  14. 10.1145/2076450.2076472 · DOI
  15. 10.1145/264107.264206 · DOI · Paper page
  16. N. A. Lynch . Distributed algorithms . Morgan Kaufmann Publishers Inc ., 1996 . N. A. Lynch. Distributed algorithms. Morgan Kaufmann Publishers Inc., 1996.
  17. 10.1145/1105734.1105747 · DOI · Paper page
  18. 10.5555/1792734.1792766 · doi:10.5555/1792734.1792766
  19. 10.1145/1081706.1081750 · DOI · Paper page
  20. 10.1145/2228360.2228425 · DOI
  21. 10.1145/2025113.2025153 · DOI
  22. 10.1145/1375581.1375599 · DOI · Paper page
  23. 10.5555/2028905 · doi:10.5555/2028905
  24. 10.1145/1706299.1706337 · DOI · Paper page
  25. 10.5555/1517424.1517434 · doi:10.5555/1517424.1517434
  26. 10.5555/3266641.3266643 · doi:10.5555/3266641.3266643

Cited by

See all 158

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

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.