<?xml version="1.0"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-25T21:18:18Z</responseDate><request verb="GetRecord" metadataPrefix="oai_dc">https://keep.lib.asu.edu/oai/request</request><GetRecord><record><header><identifier>oai:keep.lib.asu.edu:node-202318</identifier><datestamp>2025-08-18T22:22:09Z</datestamp><setSpec>oai_pmh:all</setSpec><setSpec>oai_pmh:repo_items</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>202318</dc:identifier>
          <dc:identifier>https://hdl.handle.net/2286/R.2.N.202318</dc:identifier>
                  <dc:rights>http://rightsstatements.org/vocab/InC/1.0/</dc:rights>
          <dc:rights>All Rights Reserved</dc:rights>
                  <dc:date>2025</dc:date>
                  <dc:format>51 pages</dc:format>
                  <dc:type>Masters Thesis</dc:type>
          <dc:type>Academic theses</dc:type>
                  <dc:language>en</dc:language>
                  <dc:contributor>Zhu, Samuel Jiarong</dc:contributor>
          <dc:contributor>Bao, Tiffany</dc:contributor>
          <dc:contributor>Shoshitaishvili, Yan</dc:contributor>
          <dc:contributor>Wang, Fish</dc:contributor>
          <dc:contributor>Arizona State University</dc:contributor>
                  <dc:description>Partial requirement for: M.S., Arizona State University, 2025</dc:description>
          <dc:description>Field of study: Computer Science</dc:description>
          <dc:description>Although symbolic execution is a powerful tool for vulnerability analysis, it is fre- quently hampered by the path explosion issue. Previous attempts to reduce the search space caused by path explosion have focused on pruning infeasible paths and comparing states. Machine learning has also been used to train a model to prune the search space of states. The rise of generalized Large Language Models (LLMs) provides an opportunity to avoid this cumbersome training process. LLMs have been shown to be very effective in the field of code analysis. This paper demonstrates a technique to use LLMs, paired with techniques derived from observing human ex- perts, in order to perform effective symbolic execution by using path selection. This paper creates a framework to integrate an LLM with a symbolic execution process and measures its effects compared to an existing symbolic execution engine, angr. The results show that the LLM performs equivalent to or better compared to existing methods when comparing the number of logical branches taken. By demonstrating this approach’s effectiveness, this paper opens an opportunity for further expansion of the usage of LLMs within symbolic execution.

</dc:description>
                  <dc:subject>Computer Science</dc:subject>
          <dc:subject>Large Language Models</dc:subject>
          <dc:subject>Path Selection</dc:subject>
          <dc:subject>Symbolic Execution</dc:subject>
                  <dc:title>Leveraging Large Language Models and Expert Techniques for Path Selection</dc:title></oai_dc:dc></metadata></record></GetRecord></OAI-PMH>
