乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T05:15:20Z","timestamp":1731734120742,"version":"3.28.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031573262"},{"type":"electronic","value":"9783031573279"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-57327-9_22","type":"book-chapter","created":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T03:01:47Z","timestamp":1711681307000},"page":"344-353","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Return of\u00a0Formal Requirements Engineering in\u00a0the\u00a0Era of\u00a0Large Language Models"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-7922-4936","authenticated-orcid":false,"given":"Paola","family":"Spoletini","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0636-5663","authenticated-orcid":false,"given":"Alessio","family":"Ferrari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,30]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W Bibel","year":"2013","unstructured":"Bibel, W.: Automated Theorem Proving. Springer, Wiesbaden (2013). https:\/\/doi.org\/10.1007\/978-3-322-90102-6"},{"doi-asserted-by":"crossref","unstructured":"Brun, Y., Meliou, A.: Software fairness. In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, pp. 754\u2013759 (2018)","key":"22_CR2","DOI":"10.1145\/3236024.3264838"},{"unstructured":"Brunello, A., Montanari, A., Reynolds, M.: Synthesis of LTL formulas from natural language texts: state of the art and research directions. In: 26th International Symposium on Temporal Representation and Reasoning (TIME 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)","key":"22_CR3"},{"unstructured":"Chen, M., et al.: Evaluating large language models trained on code. arXiv preprint arXiv:2107.03374 (2021)","key":"22_CR4"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10703-013-0183-7","volume":"43","author":"T Chen","year":"2013","unstructured":"Chen, T., Forejt, V., Kwiatkowska, M., Parker, D., Simaitis, A.: Automatic verification of competitive stochastic systems. Formal Methods Syst. Des. 43, 61\u201392 (2013)","journal-title":"Formal Methods Syst. Des."},{"doi-asserted-by":"crossref","unstructured":"Chen, Y., Gandhi, R., Zhang, Y., Fan, C.: NL2TL: transforming natural languages to temporal logics using large language models. arXiv preprint arXiv:2305.07766 (2023)","key":"22_CR6","DOI":"10.18653\/v1\/2023.emnlp-main.985"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-98464-9_7","volume-title":"Requirements Engineering: Foundation for Software Quality","author":"H Cherukuri","year":"2022","unstructured":"Cherukuri, H., Ferrari, A., Spoletini, P.: Towards explainable formal methods: from LTL to natural language with neural machine translation. In: Gervasi, V., Vogelsang, A. (eds.) REFSQ 2022. LNCS, vol. 13216, pp. 79\u201386. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-98464-9_7"},{"doi-asserted-by":"crossref","unstructured":"Chong, N., et al.: Code-level model checking in the software development workflow. In: Proceedings of the ACM\/IEEE 42nd International Conference on Software Engineering: Software Engineering in Practice (2020)","key":"22_CR8","DOI":"10.1145\/3377813.3381347"},{"key":"22_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8","volume-title":"Handbook of Model Checking","author":"EM Clarke","year":"2018","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R., et al.: Handbook of Model Checking, vol. 10. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSE.2018.2859926","volume":"46","author":"C Czepa","year":"2018","unstructured":"Czepa, C., Zdun, U.: On the understandability of temporal properties formalized in linear temporal logic, property specification patterns and event processing language. IEEE Trans. Softw. Eng. 46(1), 100\u2013112 (2018)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L De Moura","year":"2008","unstructured":"De Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"doi-asserted-by":"crossref","unstructured":"Dietsch, D., Langenfeld, V., Westphal, B.: Formal requirements in an informal world. In: 2020 IEEE Workshop on Formal Requirements (FORMREQ), pp. 14\u201320. IEEE (2020)","key":"22_CR12","DOI":"10.1109\/FORMREQ51202.2020.00010"},{"issue":"7","key":"22_CR13","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TCAD.2008.923410","volume":"27","author":"V D\u2019silva","year":"2008","unstructured":"D\u2019silva, V., Kroening, D., Weissenbacher, G.: A survey of automated techniques for formal software verification. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 27(7), 1165\u20131178 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"doi-asserted-by":"crossref","unstructured":"Fan, A., et al.: Large language models for software engineering: survey and open problems. arXiv preprint arXiv:2310.03533 (2023)","key":"22_CR14","DOI":"10.1109\/ICSE-FoSE59343.2023.00008"},{"doi-asserted-by":"crossref","unstructured":"Gopalan, N., Arumugam, D., Wong, L.L., Tellex, S.: Sequence-to-sequence language grounding of non-Markovian task specifications. In: Robotics: Science and Systems, vol. 2018 (2018)","key":"22_CR15","DOI":"10.15607\/RSS.2018.XIV.067"},{"doi-asserted-by":"crossref","unstructured":"Greenspan, S., Mylopoulos, J., Borgida, A.: On formal requirements modeling languages: RML revisited. In: Proceedings of 16th International Conference on Software Engineering, pp. 135\u2013147. IEEE (1994)","key":"22_CR16","DOI":"10.1109\/ICSE.1994.296773"},{"unstructured":"Hou, X., et al.: Large language models for software engineering: a systematic literature review. arXiv preprint arXiv:2308.10620 (2023)","key":"22_CR17"},{"unstructured":"Huang, D., Bu, Q., Zhang, J., Xie, X., Chen, J., Cui, H.: Bias testing and mitigation in LLM-based code generation (2024)","key":"22_CR18"},{"doi-asserted-by":"crossref","unstructured":"Katoen, J.P.: The probabilistic model checking landscape. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science (2016)","key":"22_CR19","DOI":"10.1145\/2933575.2934574"},{"doi-asserted-by":"crossref","unstructured":"Knobelsdorf, M., Frede, C., B\u00f6hne, S., Kreitz, C.: Theorem provers as a learning tool in theory of computation. In: Proceedings of the 2017 ACM Conference on International Computing Education Research, pp. 83\u201392 (2017)","key":"22_CR20","DOI":"10.1145\/3105726.3106184"},{"unstructured":"Liu, J.X., et al.: Lang2LTL: translating natural language commands to temporal robot task specification. arXiv preprint arXiv:2302.11649 (2023)","key":"22_CR21"},{"doi-asserted-by":"crossref","unstructured":"Liu, T., Nagel, M., Taghdiri, M.: Bounded program verification using an SMT solver: a case study. In: 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, pp. 101\u2013110. IEEE (2012)","key":"22_CR22","DOI":"10.1109\/ICST.2012.90"},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3605943","volume":"56","author":"B Min","year":"2023","unstructured":"Min, B., et al.: Recent advances in natural language processing via large pre-trained language models: a survey. ACM Comput. Surv. 56(2), 1\u201340 (2023)","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"Patel, R., Pavlick, E., Tellex, S.: Grounding language to non-Markovian tasks with no supervision of task specifications. In: Robotics: Science and Systems (2020)","key":"22_CR24","DOI":"10.15607\/RSS.2020.XVI.016"},{"doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science (SFCS 1977), pp. 46\u201357. IEEE (1977)","key":"22_CR25","DOI":"10.1109\/SFCS.1977.32"},{"unstructured":"Shah, D., Osi\u0144ski, B., Levine, S., et al.: LM-NAV: robotic navigation with large pre-trained models of language, vision, and action. In: Conference on Robot Learning, pp. 492\u2013504. PMLR (2023)","key":"22_CR26"},{"unstructured":"Coq Development Team: he Coq proof assistant (1989\u20132023). http:\/\/coq.inria.fr","key":"22_CR27"},{"unstructured":"Wang, R.E., Durmus, E., Goodman, N., Hashimoto, T.: Language modeling via stochastic processes. arXiv preprint arXiv:2203.11370 (2022)","key":"22_CR28"},{"unstructured":"Ye, H., Liu, T., Zhang, A., Hua, W., Jia, W.: Cognitive mirage: a review of hallucinations in large language models. arXiv preprint arXiv:2309.06794 (2023)","key":"22_CR29"},{"doi-asserted-by":"crossref","unstructured":"Zan, D., et al.: Large language models meet NL2Code: a survey. In: Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 7443\u20137464 (2023)","key":"22_CR30","DOI":"10.18653\/v1\/2023.acl-long.411"},{"unstructured":"Zhao, W.X., et al.: A survey of large language models. arXiv preprint arXiv:2303.18223 (2023)","key":"22_CR31"}],"container-title":["Lecture Notes in Computer Science","Requirements Engineering: Foundation for Software Quality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57327-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T06:56:41Z","timestamp":1731653801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57327-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031573262","9783031573279"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57327-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"30 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"REFSQ","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Working Conference on Requirements Engineering: Foundation for Software Quality","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Winterthur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"refsq2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.refsq.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":"59","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":"14","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":"24% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}