<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-22T22:43:49Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/18953" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/18953</identifier><datestamp>2025-03-26T23:38:44Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Gurfinkel, Arie</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="17a31d35-3dd1-45a2-9e82-1ff06f4ad485" confidence="600">Zhou, Xiang</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-12-13T21:00:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-12-13T21:00:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-12-13</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2022-12-06</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/18953</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Ensuring memory safety in programs has been an important yet difficult topic of research. Most static analysis approaches rely on the theory of arrays to model memory&#xd;
access. The limitation of the theory of arrays in terms of scalability and compatibility&#xd;
with SAT/SMT solvers is well-known, and there has been many attempts at optimizing&#xd;
either the theory itself or memory encodings based on theory of arrays.&#xd;
In this thesis, we demonstrate that existing arrays-based memory encodings miss potential optimization opportunities by omitting language specific properties such as alignment and pointer arithmetic in C. We present SeaM, a new memory representation for C programs built around a more expressive First-order Theory: the Theory of Memory.&#xd;
We show that by preserving more C language specific rules and properties, the Theory&#xd;
of Memory allows for more thorough optimization methods during eager rewriting of sequences of stores. We introduce two such optimization methods in this thesis. First, we over-approximate pointer comparison with an abstract interpretation-like approach called AddressRangeMap. Second, we compress sequences of stores with Store-Map for faster&#xd;
address offset look-ups.&#xd;
The new memory representation is implemented in SeaBmc, a new BMC tool for&#xd;
LLVM. We evaluate our approach on real-world bounded model checking tasks from the&#xd;
aws-c-common library and Sv-Comp benchmarks and compare it against two existing&#xd;
memory representations in SeaBmc. Our results show that SeaM outperforms the theory&#xd;
of array based representation and is comparable with the λ based representation.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Expressive and Efficient Memory Representation for Bounded Model Checking of C programs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Applied Science</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Gurfinkel, Arie</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Engineering</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>