{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:01:42Z","timestamp":1760043702139,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030175016"},{"type":"electronic","value":"9783030175023"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17502-3_8","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T01:19:26Z","timestamp":1554340766000},"page":"116-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["SL-COMP: Competition of Solvers for Separation Logic"],"prefix":"10.1007","author":[{"given":"Mihaela","family":"Sighireanu","sequence":"first","affiliation":[]},{"given":"Juan A.","family":"Navarro P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Andrey","family":"Rybalchenko","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Gorogiannis","sequence":"additional","affiliation":[]},{"given":"Radu","family":"Iosif","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Reynolds","sequence":"additional","affiliation":[]},{"given":"Cristina","family":"Serban","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Katelaan","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Matheja","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Noll","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Zuleger","sequence":"additional","affiliation":[]},{"given":"Wei-Ngan","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Quang Loc","family":"Le","sequence":"additional","affiliation":[]},{"given":"Quang-Trung","family":"Ta","sequence":"additional","affiliation":[]},{"given":"Ton-Chanh","family":"Le","sequence":"additional","affiliation":[]},{"given":"Thanh-Toan","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Siau-Cheng","family":"Khoo","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Cyprian","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Rogalewicz","sequence":"additional","affiliation":[]},{"given":"Tomas","family":"Vojnar","sequence":"additional","affiliation":[]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[]},{"given":"Ondrej","family":"Lengal","sequence":"additional","affiliation":[]},{"given":"Chong","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Zhilin","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-54830-7_27","volume-title":"Foundations of Software Science and Computation Structures","author":"T Antonopoulos","year":"2014","unstructured":"Antonopoulos, T., Gorogiannis, N., Haase, C., Kanovich, M., Ouaknine, J.: Foundations for decision problems in separation logic with general inductive predicates. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 411\u2013425. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54830-7_27"},{"key":"8_CR2","unstructured":"Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2018). \nwww.SMT-LIB.org"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Brotherston, J., Fuhs, C., Navarro P\u00e9rez, J.A., Gorogiannis, N.: A decision procedure for satisfiability in separation logic with inductive predicates. In: CSL-LICS, pp. 25:1\u201325:10. ACM (2014)","DOI":"10.1145\/2603088.2603091"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-35182-2_25","volume-title":"Programming Languages and Systems","author":"J Brotherston","year":"2012","unstructured":"Brotherston, J., Gorogiannis, N., Petersen, R.L.: A generic cyclic theorem prover. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 350\u2013367. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35182-2_25"},{"issue":"9","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1016\/j.scico.2010.07.004","volume":"77","author":"W-N Chin","year":"2012","unstructured":"Chin, W.-N., David, C., Nguyen, H.H., Qin, S.: Automated verification of shape, size and bag properties via user-defined predicates in separation logic. Sci. Comput. Program. 77(9), 1006\u20131036 (2012)","journal-title":"Sci. Comput. Program."},{"key":"8_CR6","unstructured":"CVC4-SL. \nhttp:\/\/cvc4.cs.stanford.edu\/wiki\/Separation_Logic"},{"key":"8_CR7","unstructured":"CYCLIST. \nhttps:\/\/github.com\/ngorogiannis\/cyclist"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1080\/11663081.2015.1018801","volume":"25","author":"S Demri","year":"2015","unstructured":"Demri, S., Deters, M.: Separation logics and modalities: a survey. J. Appl. Non-Classical Logics 25(1), 50\u201399 (2015)","journal-title":"J. Appl. Non-Classical Logics"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-319-12736-1_17","volume-title":"Programming Languages and Systems","author":"C Enea","year":"2014","unstructured":"Enea, C., Leng\u00e1l, O., Sighireanu, M., Vojnar, T.: Compositional entailment checking for a fragment of separation logic. In: Garrigue, J. (ed.) APLAS 2014. LNCS, vol. 8858, pp. 314\u2013333. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-12736-1_17"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-24953-7_7","volume-title":"Automated Technology for Verification and Analysis","author":"C Enea","year":"2015","unstructured":"Enea, C., Sighireanu, M., Wu, Z.: On automated lemma generation for separation logic with inductive definitions. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 80\u201396. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24953-7_7"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-319-40229-1_36","volume-title":"Automated Reasoning","author":"X Gu","year":"2016","unstructured":"Gu, X., Chen, T., Wu, Z.: A complete decision procedure for linearly compositional separation logic with data constraints. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 532\u2013549. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40229-1_36"},{"key":"8_CR12","unstructured":"Harrsh. \nhttps:\/\/github.com\/katelaan\/harrsh"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-38574-2_2","volume-title":"Automated Deduction \u2013 CADE-24","author":"R Iosif","year":"2013","unstructured":"Iosif, R., Rogalewicz, A., Simacek, J.: The tree width of separation logic with recursive definitions. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 21\u201338. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38574-2_2"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-11936-6_15","volume-title":"Automated Technology for Verification and Analysis","author":"R Iosif","year":"2014","unstructured":"Iosif, R., Rogalewicz, A., Vojnar, T.: Deciding entailments in inductive separation logic with tree automata. In: Cassez, F., Raskin, J.-F. (eds.) ATVA 2014. LNCS, vol. 8837, pp. 201\u2013218. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11936-6_15"},{"key":"8_CR15","unstructured":"Iosif, R., Serban, C., Reynolds, A., Sighireanu, M.: Encoding separation logic in smt-lib v2.5. (2018). \nhttps:\/\/github.com\/sl-comp\/SL-COMP18\/input\/Docs"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-662-54434-1_23","volume-title":"Programming Languages and Systems","author":"C Jansen","year":"2017","unstructured":"Jansen, C., Katelaan, J., Matheja, C., Noll, T., Zuleger, F.: Unified reasoning about robustness properties of symbolic-heap separation logic. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 611\u2013638. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54434-1_23"},{"key":"8_CR17","unstructured":"Katelaan, J., Matheja, C., Noll, T., Zuleger, F.: Harrsh: a tool for unied reasoning about symbolic-heap separation logic. In: Barthe, G., Korovin, K., Schulz, S., Suda, M., Sutcliffe, G., Veanes, M., (eds.) LPAR-22 Workshop and Short Paper Proceedings. Kalpa Publications in Computing, vol. 9, pp. 23\u201336. EasyChair (2018)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-89960-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"QL Le","year":"2018","unstructured":"Le, Q.L., Sun, J., Qin, S.: Frame inference for inductive entailment proofs in separation logic. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 41\u201360. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-89960-2_3"},{"key":"8_CR19","unstructured":"O\u2019Hearn, P.: Separation logic. \nhttp:\/\/www0.cs.ucl.ac.uk\/staff\/p.ohearn\/SeparationLogic\/Separation_Logic\/SL_Home.html"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44802-0_1","volume-title":"Computer Science Logic","author":"P O\u2019Hearn","year":"2001","unstructured":"O\u2019Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 1\u201319. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44802-0_1"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-319-03542-0_7","volume-title":"Programming Languages and Systems","author":"JA Navarro P\u00e9rez","year":"2013","unstructured":"Navarro P\u00e9rez, J.A., Rybalchenko, A.: Separation logic modulo theories. In: Shan, C. (ed.) APLAS 2013. LNCS, vol. 8301, pp. 90\u2013106. Springer, Cham (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-319-03542-0_7"},{"key":"8_CR22","unstructured":"SL-COMP Repository. \nhttps:\/\/github.com\/sl-comp"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-319-46520-3_16","volume-title":"Automated Technology for Verification and Analysis","author":"A Reynolds","year":"2016","unstructured":"Reynolds, A., Iosif, R., Serban, C., King, T.: A decision procedure for separation logic in SMT. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 244\u2013261. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46520-3_16"},{"key":"8_CR24","unstructured":"Reynolds, J.C.: Intuitionistic reasoning about shared mutable data structure. In: Oxford-Microsoft Symposium in Honour of Sir Tony Hoare. Palgrave Macmillan, Basingstoke (1999). Publication date November 2000"},{"key":"8_CR25","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: LICS, pp. 55\u201374. IEEE Computer Society (2002)"},{"key":"8_CR26","first-page":"173","volume":"9","author":"M Sighireanu","year":"2014","unstructured":"Sighireanu, M., Cok, D.: Report on SL-COMP 2014. JSAT 9, 173\u2013186 (2014)","journal-title":"JSAT"},{"key":"8_CR27","unstructured":"SL-COMP 2018. \nhttps:\/\/www.irif.fr\/~sighirea\/sl-comp\/18\/"},{"key":"8_CR28","unstructured":"SLEEK. \nhttp:\/\/loris-7.ddns.comp.nus.edu.sg\/~project\/s2\/beta\/"},{"key":"8_CR29","unstructured":"SLIDE. \nhttp:\/\/www.fit.vutbr.cz\/research\/groups\/verifit\/tools\/slide\/"},{"key":"8_CR30","unstructured":"SmallFoot. \nhttp:\/\/www0.cs.ucl.ac.uk\/staff\/p.ohearn\/smallfoot\/"},{"key":"8_CR31","unstructured":"SMT-COMP. \nhttp:\/\/smtcomp.sourceforge.org"},{"key":"8_CR32","unstructured":"Songbird. \nhttps:\/\/songbird-prover.github.io\/"},{"key":"8_CR33","unstructured":"SPEN. \nhttps:\/\/www.github.com\/mihasighi\/spen"},{"key":"8_CR34","unstructured":"StarExec. \nhttp:\/\/www.starexec.org"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-319-48989-6_40","volume-title":"FM 2016: Formal Methods","author":"Q-T Ta","year":"2016","unstructured":"Ta, Q.-T., Le, T.C., Khoo, S.-C., Chin, W.-N.: Automated mutual explicit induction proof in separation logic. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 659\u2013676. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48989-6_40"},{"issue":"POPL","key":"8_CR36","first-page":"9:1","volume":"2","author":"Q-T Ta","year":"2017","unstructured":"Ta, Q.-T., Le, T.C., Khoo, S.-C., Chin, W.-N.: Automated lemma synthesis in symbolic-heap separation logic. Proc. ACM Program. Lang. 2(POPL), 9:1\u20139:29 (2017)","journal-title":"Proc. ACM Program. Lang."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17502-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T22:05:36Z","timestamp":1583877936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17502-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030175016","9783030175023"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17502-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"164","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12 full papers and 11 short papers accepted for TOOLympics and SV-COMP (avg. 4 reviewers\/paper, selected from 43 submissions)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}