<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">A Hybrid Framework for COSMIC Measurement: Combining Large Language Models with a Rule-Based System</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Safae</forename><surname>Laqrichi</surname></persName>
							<email>safae.laqrichi@estimancy.com</email>
							<affiliation key="aff0">
								<orgName type="department">Arts et Métiers Campus of Rabat</orgName>
								<address>
									<addrLine>Technopolis Rabat-Shore</addrLine>
									<postCode>11103</postCode>
									<settlement>Rabat</settlement>
									<country key="MA">Maroc</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department">IWSM-Mensura</orgName>
								<address>
									<addrLine>September 30-october 04</addrLine>
									<postCode>2024</postCode>
									<settlement>Montréal</settlement>
									<country key="CA">Canada</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">A Hybrid Framework for COSMIC Measurement: Combining Large Language Models with a Rule-Based System</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">483BDF9AB1130EB3B49E3664A0951539</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T17:25+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>COSMIC FSM</term>
					<term>Automation</term>
					<term>LLM</term>
					<term>GPT-4</term>
					<term>ChatGPT</term>
					<term>Rule-based-system</term>
					<term>Prompting</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Accurate Functional Size Measurement (FSM) is crucial for effective project management and resource allocation in software development. The COSMIC FSM provides a consistent and standardized method, allowing for objective comparisons and accurate estimation of effort. However, manual FSM is often time-consuming, error-prone, and subject to assumptions and human bias. Automating this process can greatly benefit organizations but introduces challenges associated with handling requirements expressed in Natural Language (NL). In this paper, we explore the integration of Large Language Models (LLM) with rule-based systems to enhance the automation of the COSMIC Function Point Measurement. Our hybrid framework combines the contextual understanding and adaptability of LLMs, such as GPT-4, with the precision and consistency of rule-based engines crucial for tasks requiring strict adherence to rules and regulations. This approach enables a more robust analysis, processing of NL requirements, and precise application of the COSMIC measurement method. The effectiveness and feasibility of this approach are demonstrated through a series of experiments conducted on COSMIC public case studies. Our results show a promising F1-score of 0.95 in identifying COSMIC key components using GPT-4, an F1-score of 0.97 in deducing data movements using the rule-based system, and a global error rate of only 6.6% in measuring COSMIC function points using the integrated framework. These results underscore the potential for more reliable and efficient system analysis through the synergistic capabilities of LLMs and rule-based systems.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Software measurement plays a crucial role in software development by providing quantitative insights into various aspects of software products, such as size, complexity, and effort estimation. Accurate measurement of software requirements is particularly important as it forms the foundation for successful project planning and management. The COSMIC function point (CFP) method is a widely accepted approach for measuring software size and estimating effort based on functional requirements analysis <ref type="bibr" target="#b0">[1]</ref>. However, the process of manually measuring software requirements can be time-consuming, error-prone, and subject to interpretation biases <ref type="bibr" target="#b1">[2]</ref>.</p><p>To address these challenges, there is growing interest in leveraging Large Language Models (LLMs) like GPT-3 <ref type="bibr" target="#b2">[3]</ref> and GPT-4 <ref type="bibr" target="#b3">[4]</ref>, which use powerful NLP techniques and deep learning algorithms. They have demonstrated remarkable capabilities in natural language processing (NLP) and generation, raising the possibility of automating the measurement of natural language (NL) software requirements using the COSMIC function point method.</p><p>In this paper, we propose an approach that utilizes LLM for automating the measurement of NL software requirements in the COSMIC function point method. Our objective is to leverage the language understanding and generation capabilities of these models to analyze and measure the functional aspects of software requirements, thereby streamlining the measurement process and reducing the manual effort involved.</p><p>Prior research has explored various techniques for automating software requirement measurement, including rule-based approaches, machine learning-based models, and ontology <ref type="bibr" target="#b4">[5]</ref>. However, the recent advancements in LLMs offer an exciting opportunity to overcome the limitations of previous approaches and improve the accuracy and efficiency of software requirement measurement.</p><p>The remainder of this paper is organized as follows. Section 2 provides background information on the COSMIC function point method and reviews the related work on automating COSMIC FSM for NL requirements. Section 3 describes our proposed framework using LLMs and outlines the methodology involved. Section 4 presents the results of our experiments and evaluates the performance of the applied LLM in measuring NL software requirements. Finally, section 5 concludes the paper and outlines potential avenues for future research.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related work 2.1. COSMIC Function point method</head><p>Numerous studies have demonstrated the effectiveness of the COSMIC method as a functional size measurement (FSM) approach. The COSMIC method's has gained global adoption due to its flexibility allowing to measure any type of software, including web applications, agile development contexts, and large-scale software projects.</p><p>The fundamental concept underlying the COSMIC method is that, for many types of software, a significant portion of development efforts is dedicated to handling data movements between persistent storage and users. Therefore, the total number of these data movements can provide valuable insight into the size of the system <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b6">7]</ref>.</p><p>In COSMIC FSM, data movement is the Base Functional Component which moves a single data group. To measure these data movements, three elements need to be identified. A Data Group is a distinct, non-empty, non-ordered and non redundant set of data attributes where each included data attribute describes a complementary aspect of the same one object of interest. An object of interest is any 'thing' that is identified from the point of view of the FUR about which the software is required to process and/or store data. A Data Attribute is smallest parcel of information, within an identified data group, carrying a meaning from the perspective of the software's FUR.</p><p>Data movements are categorized based on their direction and purpose within a system: An Entry (E) transfers data from a user to the necessary functional process. An Exit (X) sends data from a process back to the user. A Read (R) retrieves data from persistent storage for use within a process, and a Write (W) stores data from a process into persistent storage.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Software requirements in Natural Language</head><p>The majority of software requirement specifications are written in NL, including initial conceptions and requests for proposals (RFPs). However, NL is inherently ambiguous, leading to messy software requirements specification (SRS). There is a tradeoff between using NL or a mathematics-based formal language (MBFL). NL allows for easy understanding by stakeholders, although interpretations may vary. MBFL is unambiguous but may lack writers and understanding among stakeholders. Research in requirements engineering (RE) aims to address the ambiguity of RSs by promoting MBFLs and improving accessibility. NL SRSs are inevitable as they bridge the informal ideas of software development with formal coding. The transition from informal to formal occurs during the requirements engineering process. NL remains essential, even if only during the initial conception <ref type="bibr" target="#b7">[8]</ref>. However, requirements that are expressed in NL and in a free-form manner are susceptible to being imprecise, long and incomplete <ref type="bibr" target="#b8">[9]</ref>. These characteristics pose significant challenges for efficient and standard measurement, particularly in contexts like COSMIC function point analysis, which requires a high degree of clarity, completeness, unambiguity and a high level of granularity.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">Literature review of COSMIC FSM automation studies</head><p>The automation of the COSMIC method has sparked a lot of interest over the past decades. Several studies have investigated both structured FURs, such as UML diagrams, and unstructured FURs, like free-form text or NL.</p><p>To the best of our knowledge, there is limited academic research that has been conducted on automating functional measurement using NL specifications. Only a few studies, such as those by Les <ref type="bibr" target="#b9">[10,</ref><ref type="bibr" target="#b10">11,</ref><ref type="bibr" target="#b11">12,</ref><ref type="bibr" target="#b12">13,</ref><ref type="bibr" target="#b13">14,</ref><ref type="bibr" target="#b8">9]</ref>, have addressed this topic. In <ref type="bibr" target="#b9">[10]</ref>, Hussain, Ishrar, and Ormandjieva proposed an innovative concept based on a supervised approach to word processing. Their method involved identifying parts of speech and associating them with specific features to automate functional measurement from informal textual specifications. However, their method had limitations such as not considering context and assuming consistent language styles in specifications.</p><p>In his thesis <ref type="bibr" target="#b10">[11]</ref>, Hussain proposed a method combining machine learning and NLP. The method involved preprocessing the data by tokenizing, separating sentences, tagging part of speech, and extracting names. The machine learning algorithm was used for classifying input data into types of data movement. While the results were satisfactory, the use of tokenization without considering context was acknowledged as a limitation.</p><p>In a different study <ref type="bibr" target="#b11">[12]</ref>, authors presented an NLP method for functional measurement based on the extraction of part of speech. They focused on specifications written in SBVR (Semantic Business Vocabulary and Rules) syntax and used a parsing method to extract object classes. However, limitations were observed due to the restrictions of the parsing method and the fact that SBVR specifications were not common.</p><p>Another study <ref type="bibr" target="#b12">[13]</ref> proposed a contextual NLP model (CNLP) and a flexible NL representation called "two level grammar (TLG). " However, the method has not been validated yet.</p><p>Tripathy et al. <ref type="bibr" target="#b13">[14]</ref> presented a technique for transforming NL specifications into objectoriented structures using the part of speech (POS) NLP methodology. They aimed to generate a tree structure and a conceptual model for function point counting. The authors acknowledged the need to optimize the parsing step and expressed the intention to test the model on multiple use cases.</p><p>Bagrayanik et al. <ref type="bibr" target="#b4">[5]</ref> designed a newly requirements engineering ontology and develop a method to automatically measure the software size in COSMIC FP using the ontology. The method has been validated using real projects conducted within the ICT department of a leading telecommunications provider in Turkey. The results demonstrated a consistent agreement between manual and automated measurement outcomes. One limitations of this study is the need to specify requirements in terms of the proposed requirements ontology. Another limitation arises from the fact that the proposed method exclusively supports the COSMIC Function Point method as the functional size measurement methodology. This limitation is particularly unfavorable for companies that adopt other FSM methods, such as IFPUG.</p><p>A more recent research study performed by Erdin, Colin, and Alain in <ref type="bibr" target="#b8">[9]</ref> introduced Scope-Master®, a commercial tool automating COSMIC FSM on requirements in user story format. The tool's methodology leverages NLP and pattern matching techniques. It focuses on identifying the "Subject verb object" structure within requirements to extract the necessary measurement elements. For instance, in a user story like "As a user, I want to display orders," the subject "user" is considered a candidate for the Functional User, the object "orders" is a candidate for an Object of Interest, and the verb "display" corresponds to one of the functions from the CRUDL (Create, Read, Update, Delete, List) set. The specific details of how ScopeMaster® performs these techniques are proprietary and subject to a pending patent application. Currently, examples handled by the tool are only in a US format; there is no experimentation conducted on free-form text FUR. Another mentioned limitation pertains to the non-customizability of the used ontology. For instance, the list of recognized verbs is fixed and identical across all projects. However, there may arise a need for nuances or combinations of verbs to accommodate diverse development contexts.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Capabilities of LLMs in applying COSMIC Function Point principles</head><p>LLM <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b14">15]</ref> such as GPT-4 <ref type="bibr" target="#b15">[16]</ref>, PaLM <ref type="bibr" target="#b16">[17]</ref> and LLaMA <ref type="bibr" target="#b17">[18]</ref>, have shown impressive performance in various NLP tasks and gained significant attention from academia and industry. These models leverage extensive pre-training on massive datasets and reinforcement learning from human feedback (RLHF) <ref type="bibr" target="#b18">[19]</ref> to excel in language understanding, generation, interaction, and reasoning. LLMs typically refer to Transformer-based models with hundreds of billions of parameters. They use multiple layers of attention mechanisms, known as multi-head attention, in a deep neural network architecture. LLMs implement similar Transformer architectures and pretraining objectives as smaller models like BERT <ref type="bibr" target="#b19">[20]</ref>. Scaling involves increasing the number of parameters, training data, and computational resources to enhance performance <ref type="bibr" target="#b20">[21]</ref>.</p><p>LLMs exhibit emergent abilities, which are not present in smaller models but arise in larger ones <ref type="bibr" target="#b20">[21]</ref>. Typical emergent abilities include in-context learning <ref type="bibr" target="#b2">[3]</ref>, instruction following <ref type="bibr" target="#b21">[22]</ref>, and chain-of-thought prompting <ref type="bibr" target="#b22">[23]</ref>. These abilities open up possibilities for building advanced AI systems <ref type="bibr" target="#b23">[24]</ref>.</p><p>For our research, we explored instruction-following LLMs. These models understand a wide range of user instructions, also called prompts, and produce contextually and grammatically correct responses. Due to their generalization ability, they perform strongly on unseen tasks presented as instructions without needing explicit examples <ref type="bibr" target="#b24">[25,</ref><ref type="bibr" target="#b25">26]</ref>.</p><p>Applying the COSMIC method requires high-level reasoning and strict adherence to specific rules. Precision in applying these rules is imperative; failure can result in approximate rather than accurate measurements.</p><p>Using rule-based prompts, chain-of-thought, or least-to-most prompting <ref type="bibr" target="#b26">[27]</ref> can guide the LLM to generate responses within a specific framework of rules. This is effective for systems with easily stated rules, but less so for complex tasks with hierarchical rule structures, like COSMIC measurement.</p><p>An alternative approach integrates a rule-based system with LLM prompting. The rule-based component refines the LLM's output to ensure adherence to predefined rules. This hybrid model leverages the LLM's advanced NL understanding and generation capabilities while ensuring compliance with intricate rules, advantageous in scenarios demanding high precision and strict rule compliance.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Integrating LLMs and Rule-Based System for Automated COSMIC Measurement</head><p>Our framework represents an initial attempt to harness the capabilities of LLMs combined with rule-based systems for COSMIC measurement. This preliminary research is based on several assumptions: (i) the software is categorized as a new development project, (ii) the software architecture follows a single-layer structure, eliminating the need to identify multiple layers, and (iii) the scope of measurement is clearly defined, with the requirements document exclusively describing the functionalities within this scope. Consequently, our framework for automating COSMIC measurement will bypass the steps of determining the purpose and scope of measurement, as well as the identification of architectural layers.</p><p>Our framework is structured into two major stages as illustrated in Figure <ref type="figure" target="#fig_0">1</ref>: a) identification of COSMIC key components using LLM, and b) deduction of data movements using rule-based system.</p><p>LLMs are utilized for NL understanding and processing, and information extraction tasks, required for step a) of the framework. The highly rule-based task of deducing data movements in step c) is managed using a rule-based system. This approach ensures that the analytical and interpretative tasks are effectively addressed by leveraging both advanced machine learning techniques and structured logical processes. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">COSMIC key components identification using LLM</head><p>To identify these COSMIC key components, our methodology, depicted in Figure <ref type="figure" target="#fig_0">1</ref>, requires executing various steps of the COSMIC process. This methodology comprises five distinct steps: identifying Functional User Requirements (FUR), Functional Users, Functional Processes, Data Groups, and finally, the identification of Sub-process Components. The latter step, not explicitly outlined in the official manuals, aims to properly partition the functional process into sub-processes while adhering to the granularity required for COSMIC measurement.</p><p>Furthermore, we have identified additional critical components essential for the final phase of identification and classification of data movements, such as action verbs, destinations, and sources of data. Each component plays a vital role in both understanding and quantifying data movement. Definitions of these additional key components are :</p><p>• Action verb: This specifies the operations performed on the data, such as entering, exiting, reading, writing, sending, or receiving, detailing the manner in which the data is transferred or altered.</p><p>• Destination: This indicates where the data is directed or the endpoint of the action. The destination may be internal (within the system) or external (to another system or a user).</p><p>• Source: This identifies the origin of the data, which may also be internal (originating within the system) or external (coming from another system or a user).</p><p>The integration of both the source and the destination is critical as they delineate the trajectory of the data movement, essential for gauging the type of each interaction within the system. The source is particularly significant in establishing the starting point of the data flow, which is vital for analyzing data transfer across system boundaries, especially in complex systems with numerous interacting external applications or subsystems.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.1.">Definitions and rules adaptations for improved linearity</head><p>The process described in the official manual appears linear at first glance. However, some rules establish a component's definition based on subsequent components in the procedure, introducing an inherent non-linearity. For instance, the rule 7 of the official COSMIC manual for functional users identification states that "all functional users that trigger, provide information to, or receive information from functional processes in the FUR of the software within the scope of the FSM shall be identified". Yet, these functional processes themselves are only determined at a later stage in the procedure. Another example is Rule 10 and its Guidance, which specify that to identify a functional process, one must identify the "Triggering Event" that causes a functional user to generate a data group, thereby initiating a sequence of data movements. At this stage, the definitions of 'data group' and 'data movement' remain unspecified, with their detailed identification addressed later in the COSMIC process. This observation highlights the need to adapt definitions to ensure better linearity of the process and facilitate the automation of the COSMIC methodology using LLM prompting.</p><p>These insights have guided our approach to ensure that each step logically follows the previous one, enhancing the clarity and effectiveness of the COSMIC methodology application. Below, we provide the definitions and rules used at each step.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>• Step 1: Identification of Functional User Requirements (FUR)</head><p>The LLM is used to examine user requirements documents to identify FUR, suggest improvements, and ensure they are measurable in FSM methods. If the requirements are in free-form text, the LLM breaks them down into FUR. In agile developments, these FUR can be transformed by the LLM into User Stories (US) efficiently.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>• Step 2: Identification of Functional Users</head><p>Functional users, as defined in the COSMIC methodology, are identified based on their role as senders or recipients of data. In this definition, we do not reference functional processes at this step, as they have not yet been defined.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>• Step 3: Identification of Functional Processes</head><p>Functional processes are identified by recognizing triggering events, the functional user responding to these events, and the data attributes sets initiated representing the Triggering Entry (TEn). In this step, data groups are not referenced, as they have not yet been defined, "data attributes sets" term are utilized rather.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>• Step 4: Identification of Data Groups</head><p>Data Groups is a critical concept in many functional sizing methods, including COSMIC. In COSMIC method, data groups are identified by pinpointing objects of interest and their data attributes sets, which include frequency occurrence and identification keys. Data representing control commands are not data groups. Data attributes sets that describes different objects of interest represent different data groups. For data attributes sets that describe the same objects of interest, to identify if they represent distinct data groups, a straightforward rule is applied : if two data attribute sets differ in either their key attribute or their frequency of occurrence, they are considered separate data groups.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>• Step 5: Identification of Sub-process Components</head><p>This step involves partitioning functional processes into steps then identifying subprocesses to meet the granularity required for COSMIC measurement and extracting complementary key components for identifying and classifying data movements.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.2.">Prompt Design and Optimization</head><p>The prompts used at each stage of the methodology have been carefully designed, tested, and optimized to fully leverage the capabilities of the LLM through prompt engineering techniques. Table <ref type="table" target="#tab_0">1</ref> synthesizes the components of these prompts. They may range from simply defining the key component to be identified and specifying the required task, to outlining detailed steps necessary for identifying the target component. The prompts were crafted based on COSMIC method rules from the official manual, and the 'Rule Reference' column in the table indicates the specific rules (R) and guidelines (GR) from the manual applied at each step.</p><p>Here is the structured approach for crafting effective prompts used in our approach :</p><p>• Introduction and Context: Introduce the task's background and contextual details, including specific roles or expertise required (e.g., a software measurement expert for COSMIC tasks).</p><p>• Task Description: Clearly describe the objective or task to be achieved.</p><p>• Step-by-Step Instructions: Break down the task into sequential stages, providing clear definitions and instructions to guide the language model or tool.</p><p>• Expected Output Format: Define the desired structure or format of the output, specifying essential attributes or information.</p><p>• Example or Scenario: Utilize few-shot learning techniques by presenting an example or scenario that illustrates the task or problem, thereby enhancing the quality of responses.</p><p>Example of a prompt for identifying functional processes:</p><p>Role: Your are a software measurement expert specializing in the COSMIC method for functional size measurement. Task Description: your task involves identifying functional processes from the provided Functional User Requirements (FUR).</p><p>Step-by-Step Instructions: The process involves the following steps:</p><p>1. Identify the Triggering Events: These are distinct events in the world of the functional users that the software being measured must respond to.</p><p>2. Identify the implied Functional User types: these are functional users of the software that are likely to respond to each triggering event.</p><p>3. Identify the Triggering Entry: these are the data that each functional user may generate in response to the event.</p><p>4. Identify the Functional Process: which is initiated by each triggering data. This process comprises all operations necessary to fulfill its FUR, addressing all potential responses to the triggering event.</p><p>Expected Output Format: Present the result in this python dictionary format : functional-process-format = { "Add-Professor": { "Triggering Events": "New employement" "Functional User" : "Administator", "Triggering Entry" : "Professor details"} Example: "As a student, I want be able to check my courses schedule. " Identified functional process : { "Check-schedule": { "Triggering Events": "Student request" "Functional User" : Student", "Triggering Entry" : "Student ID"} Here is the FUR : </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.3.">Adjusting Gpt-4 sampling temperature</head><p>Several inference hyperparameters can be adjusted to modify the Gpt-4 outputs at runtime. These include sampling temperature, Top-p (Nucleus Sampling), and frequency penalty <ref type="bibr" target="#b27">[28]</ref>.</p><p>The most critical parameter in controlling the behavior of LLMs during our process is the sampling temperature, which affects the randomness and the variability of the model's output. Lower temperatures exploit more probable solutions, while higher temperatures explore the solution more broadly <ref type="bibr" target="#b28">[29]</ref>. For our measurement task, preliminary tests indicated that lower temperatures (e.g., 0.2 to 0.3) make the output more deterministic and focused, leading to consistent and accurate identification of COSMIC key components. Conversely, higher temperatures (e.g., 0.7 to 1.0) introduce more variability and creativity, which can sometimes reduce precision. Therefore, we fixed the sampling temperature at 0.2 to ensure that GPT-4's responses adhered closely to the COSMIC methodology's rules and guidelines. Regarding the Top-p value and frequency penalty hyperparameters, they are maintained at default settings, typically at 1 for Top-p to allow for a full spectrum of probable outcomes, and 0 for the frequency penalty to avoid artificially inhibiting the model's NL generation capabilities. These settings help balance the model's creativity with the need for accuracy and relevance in its outputs.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Rule-based system for data movements deduction</head><p>Rule-based systems are an important class of expert systems. They are fundamentally composed of a series of IF-THEN rules, which can serve various domains, including decision support and predictive decision-making across real-world applications. These rules are generally constructed through the use of expert knowledge or through learning from real data. These rules can represent the specialised knowledge of a task area.</p><p>The table below provides a detailed overview of the COSMIC measurement rules implemented within our rule-based engine. These rules are derived and synthesized from the official COSMIC measurement manual, further enriched by the extensive practical experience I have gained through applying COSMIC Function Points across a variety of projects during my tenure at Estimancy. Each rule is precisely defined to ensure the accurate enumeration and classification of data movements, tailored to specific actions and data interactions. Organized for clarity, the table delineates the conditions under which each rule applies, the actions involved, the sources or destinations impacted, the resulting data movement type, and the counting methodology employed. This integration of established guidelines with empirical insights not only solidifies the theoretical basis of our rules but also confirms their practical efficacy, providing a robust framework for accurately quantifying software size and complexity in diverse environments.</p><p>RU1: A triggering entry (TEn) must trigger only one functional process, for the set of identified functional process inspect the triplets (FP, TEn, FU), IF there is many triplets with the same TEn THEN merge them into one FP.</p><p>RU2: For each functional process, inspect all quadruplets (action verb, data groups, destination, source). IF there are repetitions, THEN remove them from the dataset to ensure uniqueness of data movements.</p><p>RU3: For each quadruplet (action verb, data groups, destination, source), deduce the data movements and their types using the table 2.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Implementation details</head><p>The architecture of our hybrid framework, depicted in Figure <ref type="figure" target="#fig_1">2</ref>, is implemented in Python. The "Prompt Dispatch System" handles the transformation of user requirements into structured prompts that are processed by GPT-4. The outputs from GPT-4, which include identified COSMIC key components are then relayed to the Rule-Based System. This architecture offers flexibility by allowing easy replacement of the LLM, should the need arise, ensuring adaptability to new developments and improvements in language model technology.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Evaluating the approach through public case studies</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1.">Case studies description</head><p>These Case Studies can be accessed in the Case Study section of the COSMIC website <ref type="bibr" target="#b29">[30]</ref>. Case studies selected for this experiment are examples from the Real-Time and Business Applications. Functional requirements of software presented in case studies are documented in various format : free-form text, user stories and UML Use Cases. Descriptions of case studies are presented in the table <ref type="table" target="#tab_2">3</ref>.</p><p>As our approach focused in NL processing leveraging LLMs, our experiments will be held on the free-form text (FFT) and user stories (US). In order to be able to compare the performance of the proposed approach on generating US from FFT, a manual rewriting task has been undertaken on functional requirements originally documented in FFT to convert them to US format. For the purpose of comparison and testing, the datasets used in this study can be accessed my Git repository <ref type="bibr" target="#b30">[31]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.">Evaluation Method</head><p>The outputs of our automated system are of two distinct types: textual components such as FUR, FP, FU, DG and TE and categorical components such as action verb type, source, destination, data movement type and data movement number. Each type requires a different evaluation approach to accurately measure the performance of our COSMIC Function Point method automation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.1.">Evaluation of categorical components</head><p>For components classified into predefined categories by our automated system, we employed standard classification metrics such as precision, recall, and F1 score to evaluate performance.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.2.">Evaluation of textual components</head><p>For the textual component, we used a tailored evaluation strategy that integrates precision, recall, and semantic similarity metrics. This section details the methodology used to calculate True Positives (TP), False Positives (FP), and False Negatives (FN) by leveraging semantic similarity provided by GPT-4 embedding. The following steps outline the evaluation process in detail:</p><p>• Data Preparation: We defined two sets of components: the reference set (ground truth) with manually identified COSMIC key components and the output set generated by our approach.</p><p>• Embedding Generation: Using the OpenAI GPT-4 API, we generated high-dimensional vector embeddings for each component in both sets, enabling cosine similarity calculations.</p><p>• Similarity Calculation: Cosine similarity measured the semantic equivalence between reference and output components. We created a similarity matrix where each element represents the cosine similarity score between a reference component and an LLM output component.</p><p>• Threshold Determination: A similarity threshold of 0.8 was set based on preliminary experiments. Components with a cosine similarity score equal to or higher than this threshold were considered equivalent.</p><p>• Matching and Evaluation: For each reference component, we identified the output component with the highest similarity score above the threshold. Components were classified as follows:</p><p>-True Positives (TP): Reference components with a corresponding output component above the threshold.</p><p>-False Positives (FP): Output components not matching any reference component.</p><p>-False Negatives (FN): Reference components without a corresponding output component above the threshold.</p><p>This evaluation method ensures a robust assessment of our approach performance, capturing both exact matches and semantically equivalent variations in the identified COSMIC key components.</p><p>By using this dual evaluation methodology, we comprehensively assess our approach's performance, capturing both exact matches and semantically equivalent variations in the identified COSMIC key components for textual components and categorical components.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3.">Results of framework experiments on case studies</head><p>To evaluate the effectiveness of our hybrid framework for COSMIC measurement, we conducted two separate experiments. The first experiment assessed the performance of the LLM in identifying COSMIC key components which are textual. The second experiment evaluated the rule-based system's accuracy in deducing data movements.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3.1.">COSMIC key component identification Using LLM</head><p>When applying the designed prompt-based strategy on case studies to identify the COSMIC key components, the results presented in 4 indicates favorable F1-scores for the identification of key components using LLM in each case study.</p><p>The 'C-REG' System and RestoSys demonstrate high F1 scores (close to or at 1.00) across almost all categories, indicating the LLM-based approach is highly effective in accurately identifying key components for business application type.</p><p>The Rice Cooker case study shows slightly lower F1 scores, particularly for Functional Processes (0.86), Triggering Events (0.86), Data Groups (0.88), and sub-process components (0.92). This suggests some challenges in identifying these components in more complex or nuanced scenarios related to real time software. The overall average F1-scores for all components remain high, with values ranging from 0.90 to 1.00 and a global F1-score of 0.95 highlighting the effectiveness of using LLM for COSMIC key component identification across different case studies.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3.2.">COSMIC Data Movements Deduction Using Rule-Based System</head><p>The table 5 presents the F1 scores for the classification of sub processes using rule-based system in each case study. This table includes the scores for the four types of data movements: Entry, Read, Write, and Exit, along with an average score for each software system and overall metric averages across all systems.</p><p>The results demonstrate high accuracy for the C-REG system and RestoSys, with slightly lower performance for the Rice cooker case study. This discrepancy may be attributed to the vocabulary and context specific to the real-time domain, which differ from the business application vocabulary on the basis of which the majority of the rules were built.</p><p>The overall metric average across all systems and data movement types is 0.97, indicating that the rule-based system is highly effective and reliable in classifying data movements across different case studies. However, further improvements may be required for real time software.</p><p>The resulting total COSMIC Function Point (CFP) sizes calculated using our global framework for the case studies are presented in Table <ref type="table" target="#tab_4">6</ref>. They exhibit an average error of 6.6%, indicating that our automated approach yields reasonably accurate estimations of the functional size of software.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.4.">Conclusion</head><p>Validated across three case studies, our framework demonstrated significant accuracy and efficiency, substantially reducing the time, effort, human error, and subjective bias associated with manual measurements. This leads to more reliable and objective estimates of software size.</p><p>Our framework is language-agnostic, leveraging LLMs like GPT-4, which are trained on extensive multilingual datasets from the internet. This capability allows it to process texts in multiple languages, such as English, Spanish, French, and more, enhancing its adaptability for various software development projects regardless of the language used in requirements specifications.</p><p>Finally, our LLM and rule -based framework offers high customizability. In fact, in addition COSMIC Function Point method, it could be adapted to support various FSM methods, including IFPUG and SiFP (Simple Function Point), as well as approximation methods like E&amp;QFP (Early and Quick Fuction Point). Indeed, initial experiments have been carried out on some examples for SiFP measurement and have shown a promising level of accuracy.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.5.">Threats to validity</head><p>In our study, the initial validation of the framework involved experiments across three distinct case studies. While these provided valuable initial insights, the limited number of case studies is generally insufficient for robust scientific validation. This limitation is particularly significant given the broad spectrum of software types and complexities, such as Artificial Intelligence (AI) software, which exhibit unique behaviors and requirements not covered by a small, homogeneous set of case studies. Such limitations in scale and complexity raise concerns about the external validity of our findings, questioning the generalizability of the results across varied software types and more complex system architectures.</p><p>Our research has primarily focused on measuring the functional size of new software development projects, inadvertently overlooking the distinct challenges posed by software evolution or maintenance stages. This limitation represents a significant gap, as these project types involve unique complexities and lifecycle considerations that could crucially influence both the applicability and the effectiveness of our proposed framework. Addressing these oversight will be crucial for enhancing our framework's relevance and utility across different software project types.</p><p>Additionally, our research has predominantly focused on measuring the functional size of new development projects, not tackling the distinct challenges posed by software evolution or maintenance stages. This limitation represents a significant gap, as these project types involve unique complexities and lifecycle considerations that could crucially influence both the applicability and the effectiveness of our proposed framework. Furthermore, the internal validity of our study faces challenges due to potential misconfigurations or biases in setting hyperparameters like sampling temperature, which could significantly distort outcomes. Construct validity is also critical, as the reliance solely on F1-scores and error rates may not fully capture the effectiveness of our framework. Consistency and clarity in the operational definitions of measured constructs are essential to ensure accurate reflection of the framework's capabilities.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Conclusion and future work</head><p>In summary, our exploration into the integration of Large Language Models (LLMs) like GPT-4 with rule-based systems for automating COSMIC Function Point Measurement has shown promising results. Our hybrid framework effectively leverages the contextual understanding of LLMs alongside the precision of rule-based engines, enhancing the robustness and accuracy of software measurement in diverse settings. Experiments conducted across three case studies yielded an F1-score of 0.9 in identifying COSMIC key components and 0.97 in deducing data movements, with a global error rate of 6.6% in COSMIC function point measurements.</p><p>However, the limited number of case studies presents a significant threat to the validity of our findings, highlighting the need for broader testing across various software types and complexities to ensure the generalizability and applicability of our framework.</p><p>Future development should focus on enhancing the framework's performance in real-time software contexts. This can be achieved by creating more specialized prompts and rules tailored to the specific vocabulary and operational characteristics of real-time systems, enabling the framework to deliver more precise and contextually relevant measurements. Further improvement involves enriching prompts with examples from real-time applications, which would help LLMs better understand and process the unique requirements and scenarios of such environments. Insights for these enhancements can be drawn from studies like those by <ref type="bibr" target="#b31">[32,</ref><ref type="bibr" target="#b32">33]</ref>, which offer valuable perspectives on automating COSMIC measurement for real-time embedded software.</p><p>Experiments with our framework reveal a slightly lower performance in identifying data groups, suggesting that the Gpt-4 lacks the necessary knowledge to efficiently extract data models from requirements. To enhance the LLM's specialization in this task, fine-tuning may be necessary. This process aims to improve the model's performance and accuracy for specific tasks by training it on a domain-specific dataset <ref type="bibr" target="#b21">[22]</ref>. Future work will involve developing a dataset specifically for data model or UML extraction from NL requirements. This dataset will be used to fine-tune the LLM, enhancing its ability to accurately analyze and generate data models from requirements.</p><p>For this study, we utilized a non-open source GPT-4 model through the OpenAI API, which is a cloud-based service. Hence, it is crucial to consider the privacy implications associated with using this service. To address these concerns, our ongoing research includes exploring and implementing alternative open-source LLMs that can be deployed on private servers, such as Llama2 <ref type="bibr" target="#b33">[34]</ref> and Llama3 <ref type="bibr" target="#b34">[35]</ref>.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Hybrid Framework for COSMIC Measurement integrating LLMs and Rule-Based System</figDesc><graphic coords="6,119.30,84.30,354.18,169.56" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Architecture of the Hybrid COSMIC Measurement Framework</figDesc><graphic coords="11,150.55,212.29,291.69,169.28" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>Overview of Functional Components</figDesc><table><row><cell>Steps</cell><cell>Prompt Elements</cell><cell>Rules Reference</cell></row><row><cell cols="2">Functional User Requirements Use: FUR Definition, examples of</cell><cell>R3</cell></row><row><cell></cell><cell>FUR and NFR</cell><cell></cell></row><row><cell>Functional Users</cell><cell>Use FU definition : Sender or recip-</cell><cell>R7, GR7</cell></row><row><cell></cell><cell>ient of data</cell><cell></cell></row><row><cell>Functional Processes</cell><cell>Identify: Triggering Event, Func-</cell><cell>R10</cell></row><row><cell></cell><cell>tional User responding to, Data at-</cell><cell></cell></row><row><cell></cell><cell>tributes set(s) initiated</cell><cell></cell></row><row><cell>Data Groups</cell><cell>Identify: Objects Of Interest, Data</cell><cell>R11, GR13-14, GR16-19</cell></row><row><cell></cell><cell>attributes sets(freq, Id Key)</cell><cell></cell></row><row><cell>Sub-Processes</cell><cell>Identify: functional steps, use sub-</cell><cell></cell></row><row><cell></cell><cell>processes definition</cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2</head><label>2</label><figDesc>Implemented COSMIC Measurement Rules</figDesc><table><row><cell cols="2">Rule ref Action type</cell><cell>Source</cell><cell>Destination</cell><cell>Data Movement type</cell></row><row><cell>RU3-1</cell><cell>Input</cell><cell>FU</cell><cell>Internal storage</cell><cell>Entry</cell></row><row><cell>RU3-2</cell><cell>Retrieve</cell><cell>Internal storage</cell><cell>Software</cell><cell>Read</cell></row><row><cell>RU3-3</cell><cell>Store</cell><cell>Software</cell><cell>Internal storage</cell><cell>Write</cell></row><row><cell>RU3-4</cell><cell>Output</cell><cell>Software</cell><cell>FU</cell><cell>Exit</cell></row><row><cell>RU3-5</cell><cell>Retrieve</cell><cell>External Application</cell><cell>Software</cell><cell>Exit+Entry</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 3</head><label>3</label><figDesc>COSMIC case studies description</figDesc><table><row><cell>Domain</cell><cell>Software name</cell><cell>Req format</cell><cell cols="2">#FP CFP</cell></row><row><cell cols="2">Business Application Course Registration</cell><cell>FFT</cell><cell>19</cell><cell>102</cell></row><row><cell></cell><cell>('C-REG') System</cell><cell></cell><cell></cell><cell></cell></row><row><cell></cell><cell>RestoSys</cell><cell cols="2">FFT/ US/ UML Use Cases 29</cell><cell>119</cell></row><row><cell>Real Time</cell><cell>Rice Cooker</cell><cell>FFT/ diagrams</cell><cell>3</cell><cell>12</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_3"><head>Table 4</head><label>4</label><figDesc>COSMIC key component identification using LLM on case studies : F1-Score</figDesc><table><row><cell>Software</cell><cell cols="4">FP TEn FU DG</cell><cell cols="5">SP Action Source Destination Average</cell></row><row><cell>'C-REG' System</cell><cell>1</cell><cell>0.92</cell><cell>1</cell><cell>0.91</cell><cell>1</cell><cell>1</cell><cell>1</cell><cell>1</cell><cell>0.98</cell></row><row><cell>RestoSys</cell><cell>1</cell><cell>0.92</cell><cell>1</cell><cell>1</cell><cell>1</cell><cell>0.94</cell><cell>1</cell><cell>1</cell><cell>0.98</cell></row><row><cell>Rice cooker</cell><cell cols="2">0.86 0.86</cell><cell>1</cell><cell cols="2">0.88 0.92</cell><cell>0.92</cell><cell>0.92</cell><cell>0.92</cell><cell>0.91</cell></row><row><cell cols="6">F1-Scores Averages 0.95 0.90 1.00 0.93 0.96</cell><cell>0.97</cell><cell>0.97</cell><cell>0.97</cell><cell>0.95</cell></row><row><cell>Table 5</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell cols="8">COSMIC data movements deduction using rule-based system : F1-Score</cell><cell></cell><cell></cell></row><row><cell></cell><cell cols="2">Software name</cell><cell></cell><cell cols="5">Entry Read Write Exit Average</cell><cell></cell></row><row><cell></cell><cell>C-REG</cell><cell></cell><cell></cell><cell>1.00</cell><cell>1.00</cell><cell>1.00</cell><cell>1.00</cell><cell>1</cell><cell></cell></row><row><cell></cell><cell>RestoSys</cell><cell></cell><cell></cell><cell>0.96</cell><cell>0.96</cell><cell>1.00</cell><cell>0.96</cell><cell>0.97</cell><cell></cell></row><row><cell></cell><cell cols="2">Rice cooker</cell><cell></cell><cell>0.92</cell><cell>0.94</cell><cell>0.94</cell><cell>1.00</cell><cell>0.95</cell><cell></cell></row><row><cell></cell><cell cols="2">Metric averages</cell><cell></cell><cell>0.96</cell><cell>0.98</cell><cell>0.98</cell><cell>0.98</cell><cell>0.97</cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_4"><head>Table 6</head><label>6</label><figDesc>Total COSMIC Function Point (CFP) sizes counting: Error</figDesc><table><row><cell cols="4">Software name Actual CFP Measured CFP Error</cell></row><row><cell>C-REG</cell><cell>102</cell><cell>102</cell><cell>0</cell></row><row><cell>RestoSys</cell><cell>119</cell><cell>114</cell><cell>0.04</cell></row><row><cell>Rice cooker</cell><cell>12</cell><cell>10</cell><cell>0.16</cell></row><row><cell>Metric average</cell><cell></cell><cell></cell><cell>0.066</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">J</forename><surname>Albrecht</surname></persName>
		</author>
		<ptr target="http://www.bfpug.com.br/Artigos/Albrecht/MeasuringApplicationDevelopmentProductivity.pdf" />
		<title level="m">Measuring application development productivity</title>
				<imprint>
			<date type="published" when="1979">1979</date>
			<biblScope unit="volume">10</biblScope>
			<biblScope unit="page" from="83" to="92" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Towards universal COSMIC size measurement automation</title>
		<author>
			<persName><forename type="first">H</forename><surname>Soubra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Abufrikha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Abran</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-2725/paper2.pdf" />
	</analytic>
	<monogr>
		<title level="m">CEUR-WS</title>
				<meeting><address><addrLine>Mexico City, Mexico</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">2020. 2725. 2725</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Language Models are Few-Shot Learners</title>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">B</forename><surname>Brown</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Mann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ryder</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Subbiah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kaplan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Dhariwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Neelakantan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Shyam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Sastry</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Askell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Agarwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Herbert-Voss</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Krueger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Henighan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Child</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ramesh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Ziegler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Winter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Hesse</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sigler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Litwin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Gray</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Chess</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Clark</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Berner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Mccandlish</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Radford</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Sutskever</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Amodei</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2005.14165</idno>
		<idno type="arXiv">arXiv:2005.14165</idno>
		<ptr target="http://arxiv.org/abs/2005.14165.doi:10.48550/arXiv.2005.14165" />
		<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title/>
		<author>
			<persName><forename type="first">J</forename><surname>Openai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Achiam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Adler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Agarwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Ahmad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">L</forename><surname>Akkaya</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Aleman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Almeida</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Altenschmidt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Altman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Anadkat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Avila</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Babuschkin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Balaji</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Balcom</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Baltescu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bavarian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Belgum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bello</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Berdine</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Bernadett-Shapiro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Berner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Bogdonoff</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Boiko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A.-L</forename><surname>Boyd</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Brakman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Brockman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Brooks</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Brundage</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Button</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Cai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Campbell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Cann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Carey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Carlson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Carmichael</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Chan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Chang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Chantzis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Chess</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Cho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">W</forename><surname>Chu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Chung</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Cummings</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Currier</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Dai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Decareaux</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Degry</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Deutsch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Deville</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Dhar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Dohan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Dowling</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Dunning</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ecoffet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Eleti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Eloundou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Farhi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Fedus</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">P</forename><surname>Felix</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Fishman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Forte</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Fulford</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Gao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Georges</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Gibson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Goel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Gogineni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Goh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Gontijo-Lopes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Gordon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Grafstein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Gray</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Greene</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">S</forename><surname>Gross</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Gu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Guo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Hallacy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Harris</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>He</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Heaton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Heidecke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Hesse</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Hickey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Hickey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Hoeschele</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Houghton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Hsu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Huizinga</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Jain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Jain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Jang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Jin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Jin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Jomoto</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Jonn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Jun</surname></persName>
		</author>
		<author>
			<persName><surname>Kaftan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kaiser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Kamali</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">S</forename><surname>Kanitscheider</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Keskar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Khan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">W</forename><surname>Kilpatrick</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kirchner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kiros</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Knight</surname></persName>
		</author>
		<author>
			<persName><surname>Kokotajlo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kondraciuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kondrich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Konstantinidis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Kosic</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Krueger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kuo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Lampe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Lan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Leike</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Leung</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">M</forename><surname>Levy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Lim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Litwin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Lopez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Lowe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Lue</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Makanju</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Malfacini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Manning</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Markov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Markovski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Martin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mayer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Mayne</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Mcgrew</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Mckinney</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Mcleavey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mcmillan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Mcneil</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Medina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mehta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Menick</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Metz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Mishchenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Mishkin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Monaco</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Morikawa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Mossing</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Murati</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Murk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mély</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Nair</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Nakano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Nayak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Neelakantan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Ngo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Noh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Ouyang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>O'keefe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Pachocki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Paino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Palermo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Pantuliano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Parascandolo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Parish</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Parparita</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Passos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Pavlov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Peng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">D A B</forename><surname>Perelman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Peres</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">P D O</forename><surname>Petrov</surname></persName>
		</author>
		<author>
			<persName><surname>Pinto</surname></persName>
		</author>
		<author>
			<persName><surname>Michael</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Pokorny</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">H</forename><surname>Pokrass</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Pong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Powell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Power</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Power</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Proehl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Puri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Radford</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rae</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Ramesh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Raymond</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Real</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Rimbach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Ross</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Rotsted</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Roussez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Ryder</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Saltarelli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sanders</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Santurkar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Sastry</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Schmidt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Schnurr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Schulman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Selsam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Sheppard</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Sherbakov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Shieh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Shoker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Shyam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sidor</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sigler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Simens</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Sitkin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Slama</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Sohl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Sokolowsky</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">P</forename><surname>Staudacher</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Such</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Summers</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Sutskever</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">B</forename><surname>Tezak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Thompson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Tillet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Tootoonchian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Tseng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Tuggle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Turley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">F C</forename><surname>Tworek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Uribe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Vallone</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Vijayvergiya</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Voss</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">J</forename><surname>Wainwright</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Ward</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">J</forename><surname>Wei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Weinmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Welihinda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Welinder</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Weng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Weng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Wiethoff</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Willner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Winter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Wolrich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Workman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Xiao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Yoo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Yu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Yuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Zaremba</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Zellers</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Zheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Zhuang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Zhuk</surname></persName>
		</author>
		<author>
			<persName><surname>Zoph</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2303.08774</idno>
		<idno type="arXiv">arXiv:2303.08774</idno>
		<ptr target="http://arxiv.org/abs/2303.08774.doi:10.48550/arXiv.2303.08774" />
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
	<note type="report_type">GPT-4 Technical Report</note>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Automated COSMIC Function Point Measurement Using a Requirements Engineering Ontology</title>
		<author>
			<persName><forename type="first">S</forename><surname>Bagriyanik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Karahoca</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.infsof.2015.12.011</idno>
		<ptr target="http://dx.doi.org/10.1016/j.infsof.2015.12.011.doi:10.1016/j.infsof.2015.12.011" />
	</analytic>
	<monogr>
		<title level="j">Inf. Softw. Technol</title>
		<imprint>
			<biblScope unit="volume">72</biblScope>
			<biblScope unit="page" from="189" to="203" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<author>
			<persName><forename type="first">A</forename><surname>Abran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Fagg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Lesterhuis</surname></persName>
		</author>
		<ptr target="https://cosmic-sizing.org/publications/combination-of-parts-v5-0/" />
		<title level="m">The COSMIC Functional Size Measurement Method Manual v5</title>
				<imprint>
			<biblScope unit="volume">0</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Web Effort Estimation: Function Point Analysis vs</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">Di</forename><surname>Martino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ferrucci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Gravino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Sarro</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.infsof.2015.12.001</idno>
		<ptr target="https://www.sciencedirect.com/science/article/pii/S0950584915002037.doi:10.1016/j.infsof.2015.12.001" />
	</analytic>
	<monogr>
		<title level="j">COSMIC, Information and Software Technology</title>
		<imprint>
			<biblScope unit="volume">72</biblScope>
			<biblScope unit="page" from="90" to="109" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Ambiguity in Natural Language Requirements Documents</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Berry</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-540-89778-1_1</idno>
	</analytic>
	<monogr>
		<title level="m">Innovations for Requirement Analysis. From Stakeholders&apos; Needs to Formal Designs</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">B</forename><surname>Paech</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Martell</surname></persName>
		</editor>
		<meeting><address><addrLine>Berlin, Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2008">2008</date>
			<biblScope unit="page" from="1" to="7" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<author>
			<persName><forename type="first">E</forename><surname>Ungan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Hammond</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Abran</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-2207/IWSM_Mensura_2018_paper_11.pdf" />
		<title level="m">Automated COSMIC measurement and requirement quality improvement through ScopeMaster® tool</title>
				<meeting><address><addrLine>Beijing, China</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2018">2018. 2207. 2207</date>
		</imprint>
	</monogr>
	<note>CEUR-WS</note>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Approximation of COSMIC functional size to support early effort estimation in Agile</title>
		<author>
			<persName><forename type="first">I</forename><surname>Hussain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Kosseim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Ormandjieva</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.datak.2012.06.005</idno>
		<ptr target="https://linkinghub.elsevier.com/retrieve/pii/S0169023X1200064X.doi:10.1016/j.datak.2012.06.005" />
	</analytic>
	<monogr>
		<title level="j">Data &amp; Knowledge Engineering</title>
		<imprint>
			<biblScope unit="volume">85</biblScope>
			<biblScope unit="page" from="2" to="14" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<title level="m" type="main">Linguistic Approaches for Early Measurement of Functional Size from Software Requirements</title>
		<author>
			<persName><forename type="first">H</forename><surname>Hussain</surname></persName>
		</author>
		<ptr target="https://www.semanticscholar.org/paper/Linguistic-Approaches-for-Early-Measurement-of-Size-Hussain/b524b694d142f411fa324cd0b7d4bec5291a34a3" />
		<imprint>
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<title level="m" type="main">Software Requirement Elicitation Using Natural Language Processing</title>
		<author>
			<persName><forename type="first">M</forename><surname>Mohanan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Samuel</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-28031-8_17</idno>
		<imprint>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="197" to="208" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Automated conversion from requirements documentation to an objectoriented formal specification language</title>
		<author>
			<persName><forename type="first">B.-S</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Bryant</surname></persName>
		</author>
		<idno type="DOI">10.1145/508791.508972</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the ACM Symposium on Applied Computing</title>
				<meeting>the ACM Symposium on Applied Computing</meeting>
		<imprint>
			<date type="published" when="2002">2002</date>
			<biblScope unit="page">936</biblScope>
		</imprint>
	</monogr>
	<note>Proceedings of the ACM Symposium on Applied Computing</note>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">Requirement Analysis using Natural Language Processing</title>
		<author>
			<persName><forename type="first">A</forename><surname>Tripathy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Agrawal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Rath</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<monogr>
		<author>
			<persName><forename type="first">S</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Roller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Goyal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Artetxe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Dewan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Diab</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><forename type="middle">V</forename><surname>Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Mihaylov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Ott</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Shleifer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Shuster</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Simig</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">S</forename><surname>Koura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sridhar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zettlemoyer</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2205.01068</idno>
		<idno type="arXiv">arXiv:2205.01068</idno>
		<ptr target="http://arxiv.org/abs/2205.01068.doi:10.48550/arXiv.2205.01068" />
		<title level="m">OPT: Open Pre-trained Transformer Language Models</title>
				<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<idno type="DOI">10.48550/arXiv.2303.08774</idno>
		<idno type="arXiv">arXiv:2303.08774</idno>
		<ptr target="http://arxiv.org/abs/2303.08774.doi:10.48550/arXiv.2303.08774" />
		<title level="m">GPT-4</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
		<respStmt>
			<orgName>OpenAI</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Technical Report</note>
</biblStruct>

<biblStruct xml:id="b16">
	<monogr>
		<title level="m" type="main">PaLM: Scaling Language Modeling with Pathways</title>
		<author>
			<persName><forename type="first">A</forename><surname>Chowdhery</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Narang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Devlin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bosma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Mishra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Roberts</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Barham</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">W</forename><surname>Chung</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Sutton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Gehrmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Schuh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Shi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Tsvyashchenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Maynez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Barnes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Tay</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Shazeer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Prabhakaran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Reif</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Du</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Hutchinson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Pope</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bradbury</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Austin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Isard</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Gur-Ari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Yin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Duke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Levskaya</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Ghemawat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Dev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Michalewski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Garcia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Misra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Robinson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Fedus</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Ippolito</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Luan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Lim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Zoph</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Spiridonov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Sepassi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Dohan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Agrawal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Omernick</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Dai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">S</forename><surname>Pillai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Pellat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Lewkowycz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Moreira</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Child</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Polozov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Saeta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Diaz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Firat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Catasta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Meier-Hellstern</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Eck</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Dean</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Petrov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Fiedel</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2204.02311</idno>
		<idno type="arXiv">arXiv:2204.02311</idno>
		<ptr target="http://arxiv.org/abs/2204.02311.doi:10.48550/arXiv.2204.02311" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<monogr>
		<author>
			<persName><forename type="first">L</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Alhoshan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ferrari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Letsholo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Ajagbe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Batista-Navarro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E.-V</forename><surname>Chioasca</surname></persName>
		</author>
		<idno type="DOI">10.1145/3444689</idno>
		<ptr target="https://arxiv.org/abs/2004.01099" />
		<title level="m">Natural Language Processing (NLP) for Requirements Engineering: A Systematic Mapping Study</title>
				<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<monogr>
		<title level="m" type="main">Training language models to follow instructions with human feedback</title>
		<author>
			<persName><forename type="first">L</forename><surname>Ouyang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Almeida</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">L</forename><surname>Wainwright</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Mishkin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Agarwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Slama</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ray</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Schulman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Hilton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Kelton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Miller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Simens</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Askell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Welinder</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Christiano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Leike</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Lowe</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2203.02155</idno>
		<idno type="arXiv">arXiv:2203.02155</idno>
		<ptr target="http://arxiv.org/abs/2203.02155.doi:10.48550/arXiv.2203.02155" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<monogr>
		<title level="m" type="main">BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding</title>
		<author>
			<persName><forename type="first">J</forename><surname>Devlin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M.-W</forename><surname>Chang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Toutanova</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.1810.04805</idno>
		<idno type="arXiv">arXiv:1810.04805</idno>
		<ptr target="http://arxiv.org/abs/1810.04805.doi:10.48550/arXiv.1810.04805" />
		<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<monogr>
		<title level="m" type="main">Emergent Abilities of Large Language Models</title>
		<author>
			<persName><forename type="first">J</forename><surname>Wei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Tay</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Bommasani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Raffel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Zoph</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Borgeaud</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Yogatama</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bosma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Metzler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">H</forename><surname>Chi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Hashimoto</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Vinyals</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Liang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Dean</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Fedus</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2206.07682</idno>
		<idno type="arXiv">arXiv:2206.07682</idno>
		<ptr target="http://arxiv.org/abs/2206.07682.doi:10.48550/arXiv.2206.07682" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<monogr>
		<title level="m" type="main">Finetuned Language Models Are Zero-Shot Learners</title>
		<author>
			<persName><forename type="first">J</forename><surname>Wei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bosma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">Y</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Guu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">W</forename><surname>Yu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Lester</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Du</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Dai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><forename type="middle">V</forename><surname>Le</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2109.01652</idno>
		<idno type="arXiv">arXiv:2109.01652</idno>
		<ptr target="http://arxiv.org/abs/2109.01652.doi:10.48550/arXiv.2109.01652" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<monogr>
		<title level="m" type="main">Chain-of-Thought Prompting Elicits Reasoning in Large Language Models</title>
		<author>
			<persName><forename type="first">J</forename><surname>Wei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Schuurmans</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bosma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Ichter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Xia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Chi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Le</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zhou</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2201.11903</idno>
		<idno type="arXiv">arXiv:2201.11903</idno>
		<ptr target="http://arxiv.org/abs/2201.11903.doi:10.48550/arXiv.2201.11903" />
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<monogr>
		<title level="m" type="main">HuggingGPT: Solving AI Tasks with ChatGPT and its Friends in HuggingFace</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Shen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Tan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Lu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhuang</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2303.17580</idno>
		<idno type="arXiv">arXiv:2303.17580</idno>
		<ptr target="http://arxiv.org/abs/2303.17580.doi:10.48550/arXiv.2303.17580" />
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<monogr>
		<title level="m" type="main">Multitask Prompted Training Enables Zero-Shot Task Generalization</title>
		<author>
			<persName><forename type="first">V</forename><surname>Sanh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Webson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Raffel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">H</forename><surname>Bach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Sutawika</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Alyafeai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Chaffin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Stiegler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">L</forename><surname>Scao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Raja</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">S</forename><surname>Bari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Thakker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">S</forename><surname>Sharma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Szczechla</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Chhablani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Nayak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Datta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Chang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">T</forename></persName>
		</author>
		<author>
			<persName><forename type="first">.-J</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Manica</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Shen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><forename type="middle">X</forename><surname>Yong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Pandey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Bawden</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Neeraj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Rozen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sharma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Santilli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Fevry</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Fries</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Teehan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Bers</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Biderman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Gao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Wolf</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Rush</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2110.08207</idno>
		<idno type="arXiv">arXiv:2110.08207</idno>
		<ptr target="http://arxiv.org/abs/2110.08207.doi:10.48550/arXiv.2110.08207" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<monogr>
		<title level="m" type="main">A Survey of Large Language Models</title>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">X</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Hou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Min</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Dong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Du</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Ren</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J.-Y</forename><surname>Nie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J.-R</forename><surname>Wen</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2303.18223</idno>
		<idno type="arXiv">arXiv:2303.18223</idno>
		<ptr target="http://arxiv.org/abs/2303.18223.doi:10.48550/arXiv.2303.18223" />
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<monogr>
		<title level="m" type="main">Least-to-Most Prompting Enables Complex Reasoning in Large Language Models</title>
		<author>
			<persName><forename type="first">D</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Schärli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Hou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Scales</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Schuurmans</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Cui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Bousquet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Le</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Chi</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2205.10625</idno>
		<idno type="arXiv">arXiv:2205.10625</idno>
		<ptr target="http://arxiv.org/abs/2205.10625.doi:10.48550/arXiv.2205.10625" />
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<monogr>
		<title level="m" type="main">Cost-Effective Hyperparameter Optimization for Large Language Model Generation Inference</title>
		<author>
			<persName><forename type="first">C</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">X</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">H</forename><surname>Awadallah</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2303.04673</idno>
		<idno type="arXiv">arXiv:2303.04673</idno>
		<ptr target="http://arxiv.org/abs/2303.04673.doi:10.48550/arXiv.2303.04673" />
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<monogr>
		<title level="m" type="main">The Effect of Sampling Temperature on Problem Solving in Large Language Models</title>
		<author>
			<persName><forename type="first">M</forename><surname>Renze</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Guven</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2402.05201</idno>
		<idno type="arXiv">arXiv:2402.05201</idno>
		<ptr target="http://arxiv.org/abs/2402.05201.doi:10.48550/arXiv.2402.05201" />
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<monogr>
		<author>
			<persName><forename type="first">C</forename><surname>Community</surname></persName>
		</author>
		<ptr target="https://cosmic-sizing.org/cosmic-publications/overview/" />
		<title level="m">Cosmic website</title>
				<imprint>
			<date type="published" when="2024-07-11">2024. 2024-07-11</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<monogr>
		<author>
			<persName><forename type="first">S</forename><surname>Laqrichi</surname></persName>
		</author>
		<ptr target="https://github.com/slaqrichi/COSMIC-case-studies-dataset" />
		<title level="m">Cosmic_Case_studies_measured_requirements</title>
				<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<monogr>
		<author>
			<persName><forename type="first">S</forename><surname>Salem</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Soubra</surname></persName>
		</author>
		<title level="m">Functional Size Measurement Automation for IoT Edge Devices</title>
				<meeting><address><addrLine>Rome, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<monogr>
		<title level="m" type="main">Functional Size Measurement for the Internet of Things (IoT): An example using COSMIC and the Arduino open-source platform</title>
		<author>
			<persName><forename type="first">H</forename><surname>Soubra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Abran</surname></persName>
		</author>
		<idno type="DOI">10.1145/3143434.3143452</idno>
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<monogr>
		<author>
			<persName><forename type="first">H</forename><surname>Touvron</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Martin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Stone</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Albert</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Almahairi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Babaei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Bashlykov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Batra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bhargava</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Bhosale</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Bikel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Blecher</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">C</forename><surname>Ferrer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Cucurull</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Esiobu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Fernandes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Fu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Fu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Fuller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Gao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Goswami</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Goyal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Hartshorn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Hosseini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Hou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Inan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kardas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Kerkez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Khabsa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Kloumann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Korenev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">S</forename><surname>Koura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M.-A</forename><surname>Lachaux</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Lavril</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Liskovich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Lu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Mao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Martinet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Mihaylov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Mishra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Molybog</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Nie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Poulton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Reizenstein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Rungta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Saladi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Schelten</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Silva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">M</forename><surname>Smith</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Subramanian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><forename type="middle">E</forename><surname>Tan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Taylor</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Williams</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">X</forename><surname>Kuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Yan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Zarov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Fan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kambadur</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Narang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rodriguez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Stojnic</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Edunov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Scialom</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2307.09288</idno>
		<idno type="arXiv">arXiv:2307.09288</idno>
		<ptr target="http://arxiv.org/abs/2307.09288.doi:10.48550/arXiv.2307.09288" />
		<title level="m">Llama 2: Open Foundation and Fine-Tuned Chat Models</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<monogr>
		<title level="m" type="main">How Good Are Low-bit Quantized LLaMA3 Models? An Empirical Study</title>
		<author>
			<persName><forename type="first">W</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Ma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Qin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Zheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Lv</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Luo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Qi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Magno</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2404.14047</idno>
		<idno type="arXiv">arXiv:2404.14047</idno>
		<ptr target="http://arxiv.org/abs/2404.14047.doi:10.48550/arXiv.2404.14047" />
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
