{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T11:12:14Z","timestamp":1770462734944,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031331695","type":"print"},{"value":"9783031331701","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_21","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"353-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["From Natural Language Requirements to\u00a0the\u00a0Verification of\u00a0Programmable Logic Controllers: Integrating FRET into\u00a0PLCverif"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2354-1750","authenticated-orcid":false,"given":"Zs\u00f3fia","family":"\u00c1d\u00e1m","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8044-0385","authenticated-orcid":false,"given":"Ignacio D.","family":"Lopez-Miguel","sequence":"additional","affiliation":[]},{"given":"Anastasia","family":"Mavridou","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Pressburger","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"B\u0119\u015b","sequence":"additional","affiliation":[]},{"given":"Enrique","family":"Blanco Vi\u00f1uela","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7013-1100","authenticated-orcid":false,"given":"Andreas","family":"Katis","sequence":"additional","affiliation":[]},{"given":"Jean-Charles","family":"Tournier","sequence":"additional","affiliation":[]},{"given":"Khanh V.","family":"Trinh","sequence":"additional","affiliation":[]},{"given":"Borja","family":"Fern\u00e1ndez Adiego","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"21_CR1","unstructured":"FRET: Formal requirements elicitation tool. https:\/\/github.com\/NASA-SW-VnV\/fret"},{"key":"21_CR2","unstructured":"High luminosity large hadron collider webpage. https:\/\/home.cern\/science\/accelerators\/high-luminosity-lhc"},{"key":"21_CR3","unstructured":"PLCverif: A tool to verify PLC programs based on model checking techniques. https:\/\/gitlab.com\/plcverif-oss"},{"key":"21_CR4","unstructured":"UNICOS webpage. https:\/\/unicos.web.cern.ch\/"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker Blast. Int. J. Softw. Tools Technol. Transf. 9(5-6), 505\u2013525 (2007). https:\/\/doi.org\/10.1007\/s10009-007-0044-z","DOI":"10.1007\/s10009-007-0044-z"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Darvas, D., Fern\u00e1ndez Adiego, B., Blanco Vi\u00f1uela, E.: PLCverif: a tool to verify PLC programs based on model checking techniques. In: Proceedings of the ICALEPCS 2015, October 2015. https:\/\/doi.org\/10.18429\/JACoW-ICALEPCS2015-WEPGF092","DOI":"10.18429\/JACoW-ICALEPCS2015-WEPGF092"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez Adiego, B., Blanco Vi\u00f1uela, E.: Applying model checking to critical PLC applications: an ITER case study. In: Proceedings of the ICALEPCS 2017, October 2017. https:\/\/doi.org\/10.18429\/JACoW-ICALEPCS2017-THPHA161","DOI":"10.18429\/JACoW-ICALEPCS2017-THPHA161"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez Adiego, B., et al.: Applying model checking to industrial-sized PLC programs. IEEE Trans. Ind. Inform. 11, 1400\u20131410 (2015). https:\/\/doi.org\/10.1109\/TII.2015.2489184","DOI":"10.1109\/TII.2015.2489184"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez Adiego, B., Lopez-Miguel, I.D., Tournier, J.C., Blanco Vi\u00f1uela, E., Ladzinski, T., Havart, F.: Applying model checking to highly-configurable safety critical software: the SPS-PPS PLC program. In: Proceedings of the ICALEPCS\u201921, March 2022. https:\/\/doi.org\/10.18429\/JACoW-ICALEPCS2021-WEPV042","DOI":"10.18429\/JACoW-ICALEPCS2021-WEPV042"},{"key":"21_CR10","unstructured":"Giannakopoulou, D., Pressburger, T., Mavridou, A., Rhein, J., Schumann, J., Shi, N.: Formal requirements elicitation with FRET. In: REFSQ Tools (2020)"},{"key":"21_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2021.106590","volume":"137","author":"D Giannakopoulou","year":"2021","unstructured":"Giannakopoulou, D., Pressburger, T., Mavridou, A., Schumann, J.: Automated formalization of structured natural language requirements. Inf. Softw. Technol. 137, 106590 (2021)","journal-title":"Inf. Softw. Technol."},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Lopez-Miguel, I.D., Tournier, J.C., Fern\u00e1ndez Adiego, B.: PLCverif: status of a formal verification tool for programmable logic controller. In: Proceedings of the ICALEPCS\u201921, March 2022. https:\/\/doi.org\/10.18429\/JACoW-ICALEPCS2021-MOPV042","DOI":"10.18429\/JACoW-ICALEPCS2021-MOPV042"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Vi\u00f1uela, E.B., Darvas, D., Moln\u00e1r, V.: PLCverif re-engineered: an open platform for the formal analysis of PLC programs. In: Proceedings of the ICALEPCS\u201919, pp. 21\u201327. No. 17 in International Conference on Accelerator and Large Experimental Physics Control Systems, JACoW Publishing, Geneva, Switzerland, August 2020. https:\/\/doi.org\/10.18429\/JACoW-ICALEPCS2019-MOBPP01, https:\/\/jacow.org\/icalepcs2019\/papers\/mobpp01.pdf","DOI":"10.18429\/JACoW-ICALEPCS2019-MOBPP01"},{"key":"21_CR14","unstructured":"\u00c1d\u00e1m, Z., et al.: Automated verification of programmable logic controller programs against structured natural language requirements. Technical report NASA\/TM 0230003752 (2023)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:58:58Z","timestamp":1685710738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","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":"75","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":"26","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":"3","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":"35% - 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.9","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":"6","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)"}}]}}