<?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"></title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Jianing</forename><surname>Sun</surname></persName>
							<email>j.sun@cqu.edu.cn</email>
							<affiliation key="aff0">
								<orgName type="institution">Chongqing University</orgName>
								<address>
									<postCode>400044</postCode>
									<settlement>Chongqing</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Jiahui</forename><surname>Wang</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Chongqing University</orgName>
								<address>
									<postCode>400044</postCode>
									<settlement>Chongqing</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Yuyan</forename><surname>Zhu</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Chongqing University</orgName>
								<address>
									<postCode>400044</postCode>
									<settlement>Chongqing</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Xingyu</forename><surname>Li</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Chongqing University</orgName>
								<address>
									<postCode>400044</postCode>
									<settlement>Chongqing</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ying</forename><surname>Xie</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Chongqing University</orgName>
								<address>
									<postCode>400044</postCode>
									<settlement>Chongqing</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Jiaxin</forename><surname>Chen</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Chongqing University</orgName>
								<address>
									<postCode>400044</postCode>
									<settlement>Chongqing</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">9DE107DB0640203B6E450AF47CF717EC</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T17:14+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>software testing</term>
					<term>domain-specific languages</term>
					<term>large language models</term>
					<term>Levenshtein Distance 1</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>This paper presents a novel method for generating automated test scripts for Domain-Specific Languages (DSLs) in software testing, particularly for the automotive industry. It emphasizes the growing importance of software testing in ensuring product quality amid IT advancements. The paper reviews software testing's evolution, modern processes, and the role of Large Language Models (LLMs). It highlights DSLs' significance and uses the automotive sector to show how LLMs can automate test script generation. Tests indicate that in cases with a small sample size, the effectiveness of prompt engineering is superior to model fine-tuning. The proposed method thus relies on well-designed prompts to direct LLMs to produce accurate scripts. The generation system's overview is discussed, along with an evaluation of the scripts' quality using metrics like Levenshtein Distance. Results indicate that LLMs boost test automation, defect detection, and software reliability. Future work will optimize these tools for higher testing automation levels.</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 testing is a key component in ensuring the quality and reliability of software products. In the rapidly developing information technology era, software has become an indispensable part of our daily life and work. With the increasing complexity and diversification of software functions, the importance of software testing has become increasingly prominent. Software testing is a series of processes designed to check that a software product meets specified requirements and ensures its quality. It not only helps developers to find and fix defects, but also greatly enhances system security, especially in fields with high software safety requirements such as automotive and aviation <ref type="bibr" target="#b0">[1]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.1.">A Brief History of Software Testing</head><p>The origins of software testing date back to the 1950s, focusing initially on debugging to identify and rectify software faults <ref type="bibr" target="#b1">[2]</ref>[3] <ref type="bibr" target="#b3">[4]</ref>. As software complexity grew, the need for independent testing organizations became apparent. In 1957, Charles Baker first defined program testing, in his review of the book Digital Computer Programming by Dan McCracken, separating it from debugging. Bill Hetzel formalized software testing as a concept at the University of North Carolina in 1972, establishing it to ensure a program performs as intended <ref type="bibr" target="#b4">[5]</ref>. Glenford J. Myers further refined this in 1979, describing testing as executing a program to uncover errors <ref type="bibr" target="#b5">[6]</ref>.</p><p>By 1983, IEEE had standardized software testing, defining it as a process -manual or automated-to verify system requirements <ref type="bibr" target="#b6">[7]</ref>. The 1990s brought agile methodologies, integrating testing and development and encouraging tester involvement from the earliest development stages <ref type="bibr" target="#b7">[8]</ref>. In the 21st century, testing has advanced, with a focus on exploratory testing that highlights the tester initiative. The era of AI and big data has intensified scrutiny of software testing. Despite still leveraging 20th-century methods, the field anticipates future innovations, potentially revolutionizing testing practices <ref type="bibr" target="#b8">[9]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.2.">Modern Approaches</head><p>The modern software testing process is crucial for ensuring software quality and functionality. It starts with requirement analysis, followed by developing a test plan, designing test cases, and preparing test data (Figure <ref type="figure" target="#fig_0">1</ref>). The test environment is set up, tests are executed and recorded, and defects are tracked. Regression and performance testing are conducted,  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.3.">Large Language Models</head><p>Large Language Models (LLMs) are cutting-edge AI specialized in natural language understanding and generation. Trained on extensive datasets and employing neural networks like Transformers, they capture linguistic subtleties and perform a variety of language tasks such as categorization, analysis, translation, and Q&amp;A systems. They discern nuances, generate realistic text, and continuously adapt to linguistic evolution, raising concerns over data privacy and ethics.</p><p>LLMs have significantly impacted sectors like smart offices, travel, e-commerce, and government by enhancing efficiency and personalization. In software development, LLMs are revolutionizing the field. They aid in document summarization, provide travel advice, and improve user engagement. Tools like GitHub Copilot demonstrate their advantage by assisting in coding tasks <ref type="bibr" target="#b9">[10]</ref>.</p><p>Also, LLMs boost software testing by automating tasks, detecting defects, and ensuring reliability. They improve fuzz and unit testing, creating test cases, and suggesting fixes. Research shows their significant benefits in expanding test coverage and error detection. Future efforts will focus on optimizing testing tools and techniques.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Domain-Specific Software Testing 2.1. Domain-Specific Languages</head><p>Domain-specific languages (DSLs) are specialized languages designed for particular domains or tasks, offering simplified syntax for ease of use by domain experts <ref type="bibr" target="#b10">[11]</ref>. They can be integrated with generalpurpose languages (GPL) like Java and C++, enhancing development efficiency through tool support such as analyzers and compilers. DSLs are crucial in various industries, for example, HTML in web development and SQL in databases. They automate tasks like API documentation and legal document generation, improving efficiency and reducing errors. DSLs also facilitate team collaboration by allowing non-technical members to express requirements in a natural languagelike format.</p><p>For software development, DSLs boost efficiency by simplifying complex representations and promoting code reusability. They accelerate prototyping and iteration, integrating seamlessly into existing tools and workflows. Testing DSL-developed programs requires a detailed plan with automated test scripts for regression testing. Test cases must be readable, and test data should reflect the domain specifics to ensure comprehensive coverage and identify defects. Maintainability of test cases and DSL is essential for ongoing development success.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Software Testing using DSL from the Automobile Industry</head><p>This section addresses the critical need for rigorous testing in passenger car product development, ensuring quality and performance meet standards.</p><p>Traditionally, automotive testing relies on manual, labor-intensive translation of requirements into test cases and scripts, causing significant strain on resources. To streamline this process and integrate Continuous Testing/Continuous Delivery The automotive sector is in pursuit of an AI-driven solution to streamline the automation of test script generation for its proprietary DSLs, which are integral to the testing of a spectrum of automotive systems. The prevailing manual methodology is marred by inefficiencies, susceptibility to errors, and variability in code quality, alongside insufficient test coverage. By harnessing the capabilities of large language models, an AI-powered tool has the potential to orchestrate this process, amplifying efficiency, curbing errors, and upholding uniformity in code excellence, thereby conquering existing challenges and invigorating the software development lifecycle.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">Sample Data</head><p>A total of 51 data samples (Table <ref type="table" target="#tab_0">1</ref>), each representing a true mapping from a test case to a test script in a particular DSL format.</p><p>For privacy protection purposes, all information, program code and data in this paper have been anonymized.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Approach</head><p>Broadly speaking, two dominant strategies have emerged for augmenting the knowledge base: the art of prompt engineering, which is particularly effective for modest datasets, and the process of model fine-tuning, which is best suited for addressing more substantial volumes of data. Considering the current data landscape, characterized by a dearth of samples and inherent uncertainties, a comprehensive evaluation was undertaken to compare the merits of both prompt engineering and LLM fine-tuning. This analysis has demonstrated that, under the present circumstances of limited data, prompt engineering emerges as the slightly superior approach.</p><p>Consequently, we have intentionally opted to employ the finesse of prompt engineering for the automated crafting of test scripts. This strategic choice is rooted in its proven ability to deliver optimized outcomes, even within the confines of our data scarcity. By leveraging the finesse of prompt engineering, we aim to transcend the limitations imposed by scant data availability, thereby enhancing the overall performance and reliability of our test script generation process.</p><p>An integral element of our approach is the selection of the foundational Large Language Model. To this end, we have undertaken a model selection process, meticulously assessing ChatGLM3, Llama3, and Qwen2. Following an exhaustive comparison, we determined that Llama3's generative capabilities align more closely with our requirements. Hence, we have chosen Llama3 to serve as the underlying LLM for this study.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Prompt to Make Precise Test Script Generation</head><p>Through a meticulous process of refinement, we've perfected our prompt for generating test scripts, as shown in the example. This fine-tuning ensures our AI model produces outputs that are both accurate and meet our objectives.</p><p>Our prompt is divided into four key components (Table <ref type="table">2</ref>): First, an exhaustive list of potential samples, excluding the current focus, provides a comprehensive training context. Second, we concentrate on the specific test purpose to create targeted, efficient test scripts. Third, we provide clear instructions in natural English for the LLM to follow, ensuring a seamless and accurate generation process. Lastly, we impose constraints to optimize the generation process, enabling our LLM model to autonomously produce precise and relevant test scripts without excessive input.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 2</head><p>Pseudo code of prompt design.</p><p>Prompt for test script generation (pseudo code) dataFrame = All sample mappings except the one which is being generated testCase = one test case which is being processed instruction = "Above is a list of test cases and corresponding test scripts, assembled in Json format. Please generate test script for the following test case:" condition = "Please export generated test script only, no leading text, no leading new lines." prompt = dataFrame + CRLF + instruction + testCase + condition This structured approach not only boosts script accuracy but also enhances the efficiency of our testing process, bringing us closer to our goal of fully automated AI-driven test script generation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Test Script Generation System Overview</head><p>The test script generation system, illustrated in Figure <ref type="figure" target="#fig_2">3</ref>, converts input test cases into executable scripts in the partner's DSL language, verifying product functionality. It uses outlined methodologies, and scripts are evaluated by experts for accuracy and reliability, with corrections made as needed.</p><p>Validated scripts are executed and stored, informing future prompts and enhancing script generation over time. This cycle of evaluation and learning improves script quality and reduces manual creation, aiming for an automated, self-improving system that streamlines software testing. As data storage grows, prompts become more complex, reflecting deeper learning and improved autonomy in script generation, ultimately advancing AI in software testing. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Result and Evaluation</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Evaluation Metric</head><p>This paper employs the Levenshtein Distance <ref type="bibr" target="#b11">[12]</ref> to evaluate the textual accuracy of our language model, providing an objective measure of how closely generated text matches the ground truth. This edit distance metric, devised by Vladimir Levenshtein, quantifies the minimum number of single-character edits required to transform one string into another, offering insights into model performance. It plays a crucial role in fields like Natural Language Processing, where it assesses text similarity, and Bioinformatics, where it indicates genetic relatedness. Despite its higher computational demands for longer strings, our use of dynamic programming makes it an efficient tool for our analysis. The Levenshtein Distance aids in refining our model, ensuring that the text generation is both accurate and reliable.</p><p>The formal definition of Levenshtein Distance between two arbitrary strings 𝑎 and 𝑏 with length of |𝑎| and |𝑏| respectively is given by</p><formula xml:id="formula_0">𝐥𝐞𝐯(𝑎, 𝑏) = ⎩ ⎪ ⎪ ⎨ ⎪ ⎪ ⎧ |𝑎|, if |𝑏| = 0, |𝑏|, if |𝑎| = 0, 𝐥𝐞𝐯 tail(𝑎), tail(𝑏) , if head(𝑎) = head(𝑏), 1 + min 𝐥𝐞𝐯(tail(𝑎), 𝑏) 𝐥𝐞𝐯 𝑎, tail(𝑏) 𝐥𝐞𝐯 tail(𝑎), tail(𝑏) , otherwise.</formula><p>where tail(𝑥) of any string 𝑥 of length 𝑛 is a substring of 𝑥 without the first character, i.e. tail(𝑥) = tail(𝑥 𝑥 ⋯ 𝑥 ) = 𝑥 𝑥 ⋯ 𝑥 and head(𝑥) of any string 𝑥 of length 𝑛 is a substring of 𝑥 without the last character, i.e. head(𝑥) = head(𝑥 𝑥 ⋯ 𝑥 ) = 𝑥 𝑥 ⋯ 𝑥 .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Result and Discussion</head><p>In our comprehensive analysis, we have utilized the Levenshtein Distance alongside the test script generation methodologies previously discussed to assess the output across all 51 data samples. It is crucial to highlight the exceptional stability achieved with the prompts we've designed, particularly when employing Llama3 as our LLM. The consistency of Llama3 is noteworthy; for a given data sample, or in other words, with the same prompt, the model reliably produces identical results in each test scenario. This uniformity is a testament to the robustness of our prompt engineering and the model's ability to deliver reliable outcomes. This level of consistency is not only a significant advantage in the context of test script generation but also a key factor in ensuring the reproducibility of our experiments. It allows us to confidently attribute any variations in the output to changes in the input data or to the model's fine-tuning, rather than to the inherent instability of the model itself. By achieving such a high degree of stability, we pave the way for more accurate and meaningful evaluations of our model's performance, which in turn, informs our continuous efforts to enhance its capabilities. Moreover, this stability ensures that our test script generation process is not only efficient but also dependable, providing our partners and users with a tool that they can trust to deliver consistent results.</p><p>The test results for all 51 samples are displayed in the horizontal bar chart in Figure <ref type="figure" target="#fig_3">4</ref>, offering a clear visual representation of our system's performance. The red bars in the chart signify the text lengths of the ground truth test scripts, serving as a benchmark for comparison. It represents the ideal output, against which the effectiveness of our system is measured. The pink bars, on the other hand, denote the lengths of the test scripts generated by our system. This provides insight into the output of our AI-driven script generation process, highlighting the efficiency and effectiveness with which our system translates prompts into executable test scripts. Most importantly, the blue bars in the chart represent the Levenshtein Distances for each sample, a critical metric that quantifies the difference between the generated test scripts and the ground truth. This distance is calculated based on the minimum number of single-character edits required to transform the generated test scripts into the ground truth test scripts. In this context, a shorter blue bar indicates a higher degree of similarity, suggesting that the generated script closely mirrors the ground truth, which is the goal of our system.</p><p>As observed from Error! Reference source not found., it is evident that the system currently exhibits a noticeable margin of error. This finding is further accentuated and clarified in the subsequent statistical box plot in Figure <ref type="figure" target="#fig_4">5</ref>, which provides a more detailed visualization of the distribution of errors across our dataset. It is apparent that our dataset, comprising a mere 51 samples, is significantly limited for a deep learning initiative. The consensus in the field is that a larger dataset is often necessary to train models to achieve higher accuracy and reliability. However, it is remarkable to note that despite this constraint, our system has produced flawless results in six instances where the generated test scripts matched the ground truth perfectly. This achievement is particularly impressive given the small sample size and serves as a testament to the potential of our approach using prompt engineering with large language models. The fact that our system was able to generate scripts indistinguishable from the ground truth in these cases suggests that with further optimization and a more extensive dataset, we could see a substantial improvement in the system's overall performance.</p><p>This early success with a limited dataset is not just encouraging; it also validates the feasibility of our methodological approach. It indicates that our system has the innate capacity to learn and produce highquality outputs, even when faced with data scarcity. As we continue to expand our dataset and refine our models, we are confident that the performance will see a marked enhancement, further solidifying the effectiveness of our AI-driven test script generation system in the field of software testing.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion and Future Work</head><p>This research highlights the significant impact of LLMs on enhancing software testing efficiency, particularly in the automotive sector. Our findings underscore the superiority of prompt engineering over model finetuning, especially with smaller datasets. The Levenshtein Distance proved a reliable metric for script accuracy. Notably, LLMs, such as Llama3, demonstrated remarkable consistency, indicating the robustness of our framework. Even with a limited dataset, our system achieved high accuracy, showcasing LLMs' potential in software testing.</p><p>Our study introduces a novel approach to DSL testing, with a user-friendly web application for our test script generation system, enhancing accessibility and testing efficiency. Future work includes expanding our dataset to improve script performance and integrating the system into CI/CD pipelines for real-time testing. Ethical considerations and model transparency will also be prioritized. In conclusion, our research establishes LLMs as a viable solution for automating DSL test script generation, laying the groundwork for future advancements in AI-assisted software testing.</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: Modern software testing process.</figDesc><graphic coords="1,0.00,159.54,612.00,472.91" 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: CI/CD is a software development practice in which code changes are automatically integrated, built, and tested, with successful builds being deployed to production. AI-based testing leverages machine learning to automate software testing processes, enhancing efficiency and accuracy. It encompasses exploratory testing to identify issues without fixed test cases, ensuring broader coverage. Model-driven testing and testability design optimize test case generation and software sustainability. Additionally, managing test data and implementing strategies such as Test Left Shift and Test Right Shift further refine the development cycle. These dynamic approaches adapt to different methodologies, ensuring consistent software quality throughout the testing process.</figDesc><graphic coords="2,119.40,207.12,160.44,83.52" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Generation System Overview.</figDesc><graphic coords="4,325.56,112.68,193.68,95.88" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Discrete distribution as a horizontal bar chart to illustrate the result evaluation.</figDesc><graphic coords="5,105.84,249.60,193.56,362.28" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Box plot display of the generated test results.</figDesc><graphic coords="5,325.56,493.68,193.68,145.32" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 A</head><label>1</label><figDesc>segment of the test data, describing the test cases, pre-conditions, and the desired test script DSL to be generated.</figDesc><table><row><cell>Test case</cell><cell>Pre-condition</cell><cell>Test script</cell></row><row><cell>Forward gear is</cell><cell>Configuration.Gears.Drive.is_activated()</cell><cell>Signals.Check(signals=[Gears_GearsStatus],</cell></row><row><cell>activated when the</cell><cell></cell><cell>values=[Gears_GearsStatus_shift], waiting_time=100)</cell></row><row><cell>car is moving</cell><cell></cell><cell>Gear.Shift('drive')</cell></row><row><cell>forward</cell><cell></cell><cell></cell></row><row><cell>Reverse gear is</cell><cell cols="2">Configuration.Gears.Reverse.is_activated() Signals.Check(signals=[Gears_GearsStatus],</cell></row><row><cell>activated when the</cell><cell></cell><cell>values=[Gears_GearsStatus_shift], waiting_time=100)</cell></row><row><cell>car is being driven</cell><cell></cell><cell>Gear.Shift('reverse')</cell></row><row><cell>reversely</cell><cell></cell><cell></cell></row><row><cell>At driving P gear is</cell><cell>Configuration.Gears.Park.is_deactivated()</cell><cell>current_speed = car.get_speed()</cell></row><row><cell>deactivated</cell><cell></cell><cell>current_gear = car.get_gear_status()</cell></row><row><cell></cell><cell></cell><cell>Self.assertNotEqual(current_gear, 'park')</cell></row><row><cell></cell><cell></cell><cell>car.stop()</cell></row><row><cell></cell><cell></cell><cell>car.shift_gear('park')</cell></row><row><cell></cell><cell></cell><cell>current_gear = car.get_gear_status()</cell></row></table><note>(CT/CD) pipelines, the industry is moving towards automated test development.</note></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Design of a Validation Test Process of an Automotive Software</title>
		<author>
			<persName><forename type="first">Roy</forename><surname>Awedikian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Bernard</forename><surname>Yannou</surname></persName>
		</author>
		<idno type="DOI">10.1007/s12008-010-0108-2</idno>
		<ptr target="https://doi.org/10.1007/s12008-010-0108-2" />
	</analytic>
	<monogr>
		<title level="j">International Journal on Interactive Design and Manufacturing (IJIDeM)</title>
		<imprint>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="259" to="268" />
			<date type="published" when="2010-11-01">November 1, 2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Evolution of Automatic Computation</title>
		<author>
			<persName><forename type="first">Robert</forename><forename type="middle">V D</forename><surname>Campbell</surname></persName>
		</author>
		<idno type="DOI">10.1145/609784.609786</idno>
		<ptr target="https://doi.org/10.1145/609784.609786" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 1952 ACM National Meeting (Pittsburgh)</title>
				<meeting>the 1952 ACM National Meeting (Pittsburgh)<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="1952">1952</date>
			<biblScope unit="page" from="29" to="32" />
		</imprint>
	</monogr>
	<note>ACM &apos;52</note>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Solution of Systems of Linear Inequalities on a Digital Computer</title>
		<author>
			<persName><forename type="first">Alex</forename><surname>Orden</surname></persName>
		</author>
		<idno type="DOI">10.1145/609784.609793</idno>
		<ptr target="https://doi.org/10.1145/609784.609793" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 1952 ACM National Meeting (Pittsburgh)</title>
				<meeting>the 1952 ACM National Meeting (Pittsburgh)<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="1952">1952</date>
			<biblScope unit="page" from="91" to="95" />
		</imprint>
	</monogr>
	<note>&apos;52</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">MANIAC</title>
		<author>
			<persName><forename type="first">Howard</forename><forename type="middle">B</forename><surname>Demuth</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>John</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Edmund</forename><surname>Jackson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Klein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Walter</forename><surname>Metropolis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">James</forename><forename type="middle">H</forename><surname>Orvedahl</surname></persName>
		</author>
		<author>
			<persName><surname>Richardson</surname></persName>
		</author>
		<idno type="DOI">10.1145/800259.808982</idno>
		<ptr target="https://doi.org/10.1145/800259.808982" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 1952 ACM National Meeting</title>
				<meeting>the 1952 ACM National Meeting<address><addrLine>Toronto; New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="1952">1952</date>
			<biblScope unit="page" from="13" to="16" />
		</imprint>
	</monogr>
	<note>ACM &apos;52</note>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<title level="m" type="main">Program Test Methods</title>
		<author>
			<persName><forename type="first">William</forename><forename type="middle">C</forename><surname>Hetzel</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1973">1973</date>
			<publisher>Prentice-Hall</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">The Art of Software Testing</title>
		<author>
			<persName><forename type="first">Glenford</forename><forename type="middle">J</forename><surname>Myers</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Corey</forename><surname>Sandler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tom</forename><surname>Badgett</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2011">2011</date>
			<publisher>John Wiley &amp; Sons</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<ptr target="https://standards.ieee.org/ieee/829/1217/" />
		<title level="m">IEEE Standard for Software Test Documentation</title>
				<imprint>
			<date type="published" when="2024-09-17">September 17, 2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<title level="m" type="main">Rapid Application Development</title>
		<author>
			<persName><forename type="first">James</forename><surname>Martin</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1991">1991</date>
			<publisher>Macmillan Publishing Company</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">Artificial Intelligence in Software Testing : Impact, Problems, Challenges and Prospect</title>
		<author>
			<persName><forename type="first">Zubair</forename><surname>Khaliq</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Sheikh</forename><surname>Umar Farooq</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Dawood</forename><surname>Ashraf Khan</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2201.05371</idno>
		<ptr target="https://doi.org/10.48550/arXiv.2201.05371" />
		<imprint>
			<date type="published" when="2022-01-14">January 14, 2022</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv</note>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">An Empirical Evaluation of Using Large Language Models for Automated Unit Test Generation</title>
		<author>
			<persName><forename type="first">Max</forename><surname>Schäfer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Sarah</forename><surname>Nadi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Aryaz</forename><surname>Eghbali</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Frank</forename><surname>Tip</surname></persName>
		</author>
		<idno type="DOI">10.1109/TSE.2023.3334955</idno>
		<ptr target="https://doi.org/10.1109/TSE.2023.3334955" />
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Software Engineering</title>
		<imprint>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="85" to="105" />
			<date type="published" when="2024-01">January 2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<title level="m" type="main">Domain Specific Languages</title>
		<ptr target="https://martinfowler.com/books/dsl.html" />
		<imprint>
			<date type="published" when="2024-09-17">September 17, 2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Двоичные Коды с Исправлением Выпадений, Вставок и Замещений Символов [Binary Codes Capable of Correcting Deletions, Insertions, and Reversals</title>
		<author>
			<persName><forename type="first">Vladimir</forename><forename type="middle">I</forename><surname>Levenshtein</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Soviet Physics Doklady</title>
		<imprint>
			<biblScope unit="volume">163</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="845" to="848" />
			<date type="published" when="1966-02">February 1966</date>
		</imprint>
	</monogr>
</biblStruct>

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