<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><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-11-22T09:24:09Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/120904" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/120904</identifier><datestamp>2026-05-15T17:53:34Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Bao, Jialu</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Hsu, Justin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Kozen, Dexter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Halpern, Joseph</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Martins da Silva, Alexandra</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-04-02T18:52:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2026-04-02T18:52:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2025-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 15243</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 32171133</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/120904</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/fn9n-nh65</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">17422685</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">389 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Randomized algorithms are hard to test, thus accentuating the need for formalmethods to ensure their correctness. When probabilistic separation logic was first developed as a formal method for proving probabilistic independence be- tween program variables, it was unclear whether this approach generalizes to weaker forms of probabilistic separation used in program analysis. We first overview existing work in Bunched logic — the assertion logic underlying separation logic — and probabilistic separation logic for independence in chapter 2. In chapter 3, we extend probabilistic separation logic to reason about negativedependence, a relation in which an increase in one variable makes others less likely to increase. We demonstrate the utility of this program logic by analyzing hash-based data structures, such as Bloom filters. In chapter 4, we introduce a variation of probabilistic separation logic forreasoning about dependence and independence. Specifically, we use it to establish  conditional independence between programs variables in simple programs. Last, in chapter 5, we present the unary fragment of BLUEBELL to provide amore ergonomic way to reason about conditional independence and independence.  We illustrate its application through more intricate examples drawn from cryptography, security, and probabilistic graphical models. All the program logics developed in this thesis target imperative programsthat can sample from probability distributions.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="rights">Attribution 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://creativecommons.org/licenses/by/4.0/</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Formal Verification</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Probabilistic Programs</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Programming Languages</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">PROBABILISTIC SEPARATION LOGICS FOR RANDOMIZED ALGORITHMS</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Computer Science</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810.2</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://ecommons.cornell.edu/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Bao, Jialu</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b250aa50-8c84-4b7c-b383-2a1daf32e455">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>PROBABILISTIC SEPARATION LOGICS FOR RANDOMIZED ALGORITHMS&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2025-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/fn9n-nh65&lt;/DOI&gt;
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Bao, Jialu&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://creativecommons.org/licenses/by/4.0/&lt;/License>
    &lt;Keyword>Formal Verification&lt;/Keyword>
    &lt;Keyword>Probabilistic Programs&lt;/Keyword>
    &lt;Keyword>Programming Languages&lt;/Keyword>
   	&lt;Abstract>Randomized algorithms are hard to test, thus accentuating the need for formalmethods to ensure their correctness. When probabilistic separation logic was first developed as a formal method for proving probabilistic independence be- tween program variables, it was unclear whether this approach generalizes to weaker forms of probabilistic separation used in program analysis. We first overview existing work in Bunched logic — the assertion logic underlying separation logic — and probabilistic separation logic for independence in chapter 2. In chapter 3, we extend probabilistic separation logic to reason about negativedependence, a relation in which an increase in one variable makes others less likely to increase. We demonstrate the utility of this program logic by analyzing hash-based data structures, such as Bloom filters. In chapter 4, we introduce a variation of probabilistic separation logic forreasoning about dependence and independence. Specifically, we use it to establish  conditional independence between programs variables in simple programs. Last, in chapter 5, we present the unary fragment of BLUEBELL to provide amore ergonomic way to reason about conditional independence and independence.  We illustrate its application through more intricate examples drawn from cryptography, security, and probabilistic graphical models. All the program logics developed in this thesis target imperative programsthat can sample from probability distributions.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>