{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:12:00Z","timestamp":1762459920682,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030577605"},{"type":"electronic","value":"9783030577612"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57761-2_7","type":"book-chapter","created":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T12:47:58Z","timestamp":1598878078000},"page":"139-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Proof Assistant Based Formalisation of a Subset of Sequential Core Erlang"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3183-0712","authenticated-orcid":false,"given":"P\u00e9ter","family":"Bereczky","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0261-0091","authenticated-orcid":false,"given":"D\u00e1niel","family":"Horp\u00e1csi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2350-301X","authenticated-orcid":false,"given":"Simon","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"7_CR1","unstructured":"Core Erlang Formalization. \nhttps:\/\/github.com\/harp-project\/Core-Erlang-Formalization\/tree\/general-proofs-with-clos-env\n\n. Accessed 11 Jun 2020"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11541868_4","volume-title":"Theorem Proving in Higher Order Logics","author":"BE Aydemir","year":"2005","unstructured":"Aydemir, B.E., et al.: Mechanized metatheory for the masses: the PoplMark challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 50\u201365. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11541868_4"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-30473-6_5","volume-title":"Tests and Proofs","author":"M Carlier","year":"2012","unstructured":"Carlier, M., Dubois, C., Gotlieb, A.: A first step in the design of a formally verified constraint-based testing tool: FocalTest. In: Brucker, A.D., Julliand, J. (eds.) TAP 2012. LNCS, vol. 7305, pp. 35\u201350. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-30473-6_5"},{"key":"7_CR4","unstructured":"Carlsson, R., et al.: Core Erlang 1.0 language specification (2004)"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"De Angelis, E., et al.: Bounded symbolic execution for runtime error detection of Erlang programs. In: Kahsai, T., Vidal, G. (eds.) Proceedings 5th Workshop on Horn Clauses for Verification and Synthesis, HCVS 2018. EPTCS, vol. 278 (2018). \nhttps:\/\/doi.org\/10.4204\/EPTCS.278.4","DOI":"10.4204\/EPTCS.278.4"},{"key":"7_CR6","unstructured":"Fredlund, L.\u00c5.: A framework for reasoning about Erlang code. Ph.D. thesis, Royal Institute of Technology, Stockholm (2001)"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s100090100071","volume":"4","author":"L\u00c5 Fredlund","year":"2002","unstructured":"Fredlund, L.\u00c5., Gurov, D., Noll, T., Dam, M., Arts, T., Chugunov, G.: A verification tool for ERLANG. Int. J. Softw. Tools Technol. Transf. 4(4), 405\u2013420 (2002). \nhttps:\/\/doi.org\/10.1007\/s100090100071","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Harrison, J.R.: Towards an Isabelle\/HOL formalisation of core Erlang. In: Proceedings of the 16th ACM SIGPLAN International Workshop on Erlang, Erlang 2017. ACM (2017). \nhttps:\/\/doi.org\/10.1145\/3123569.3123576","DOI":"10.1145\/3123569.3123576"},{"key":"7_CR9","unstructured":"K\u0151szegi, J.: KErl: Executable semantics for Erlang. In: CEUR Workshop Proceedings, vol. 2046, pp. 144\u2013160 (2018)"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Kumar, R., Myreen, M.O., Norrish, M., Owens, S.: CakeML: a verified implementation of ML. In: Principles of Programming Languages (POPL), January 2014. ACM Press (2014). \nhttps:\/\/doi.org\/10.1145\/2535838.2535841","DOI":"10.1145\/2535838.2535841"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Lanese, I., Nishida, N., Palacios, A., Vidal, G.: A theory of reversibility for Erlang. J. Log. Algebr. Methods Program. 100 (2018). \nhttps:\/\/doi.org\/10.1016\/j.jlamp.2018.06.004","DOI":"10.1016\/j.jlamp.2018.06.004"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-90686-7_16","volume-title":"Functional and Logic Programming","author":"I Lanese","year":"2018","unstructured":"Lanese, I., Nishida, N., Palacios, A., Vidal, G.: CauDEr: a causal-consistent reversible debugger for Erlang. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 247\u2013263. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-90686-7_16"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-21485-2_6","volume-title":"Models, Languages, and Tools for Concurrent and Distributed Programming","author":"I Lanese","year":"2019","unstructured":"Lanese, I., Sangiorgi, D., Zavattaro, G.: Playing with bisimulation in Erlang. In: Boreale, M., Corradini, F., Loreti, M., Pugliese, R. (eds.) Models, Languages, and Tools for Concurrent and Distributed Programming. LNCS, vol. 11665, pp. 71\u201391. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-21485-2_6"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52 (2009). \nhttps:\/\/doi.org\/10.1145\/1538788.1538814","DOI":"10.1145\/1538788.1538814"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Neuh\u00e4u\u00dfer, M.R., Noll, T.: Abstraction and model checking of core erlang programs in Maude. In: Denker, G., Talcott, C.L. (eds.) 6th International Workshop on Rewriting Logic and its Applications, WRLA 2006. ENTCS, vol. 174. Elsevier (2007). \nhttps:\/\/doi.org\/10.1016\/j.entcs.2007.06.013","DOI":"10.1016\/j.entcs.2007.06.013"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-63139-4_15","volume-title":"Logic-Based Program Synthesis and Transformation","author":"N Nishida","year":"2017","unstructured":"Nishida, N., Palacios, A., Vidal, G.: A reversible semantics for Erlang. In: Hermenegildo, M.V., Lopez-Garcia, P. (eds.) LOPSTR 2016. LNCS, vol. 10184, pp. 259\u2013274. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63139-4_15"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-662-49498-1_23","volume-title":"Programming Languages and Systems","author":"S Owens","year":"2016","unstructured":"Owens, S., Myreen, M.O., Kumar, R., Tan, Y.K.: Functional big-step semantics. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 589\u2013615. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49498-1_23"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-662-46823-4_28","volume-title":"Perspectives of System Informatics","author":"G Vidal","year":"2015","unstructured":"Vidal, G.: Towards symbolic execution in Erlang. In: Voronkov, A., Virbitskaite, I. (eds.) PSI 2014. LNCS, vol. 8974, pp. 351\u2013360. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46823-4_28"},{"key":"7_CR19","unstructured":"The Coq Proof Assistant Documentation. \nhttps:\/\/coq.inria.fr\/documentation\n\n. Accessed 21 Feb 2020"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57761-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T13:10:30Z","timestamp":1598879430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-57761-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030577605","9783030577612"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57761-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tfp2020.org\/","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":"22","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":"11","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":"0","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":"50% - 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,21","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":"3,39","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)"}}]}}