<?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-22T10:30:26Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5804" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5804</identifier><datestamp>2017-03-21T20:27:05Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</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="author" authority="755f54e3-839b-4c86-9e84-9e9b17654839" confidence="600">Vlad, Ciubotariu</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2011-02-23T17:03:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2011-02-23T17:03:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2011-02-23T17:03:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2011-02-18</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5804</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Pipelined circuits operate as an assembly line that starts processing new instructions while older ones&#xd;
continue execution. Control properties specify the correct behaviour of the pipeline with respect to&#xd;
how it handles the concurrency between instructions. Control properties stand out as one of the most&#xd;
challenging aspects of pipelined circuit verification. Their verification depends on the datapath and&#xd;
memories, which in practice account for the largest part of the state space of the circuit. To alleviate&#xd;
the state explosion problem, abstraction of memories and datapath becomes mandatory. This thesis&#xd;
provides a methodology for an efficient abstraction of the datapath under all possible control-visible&#xd;
behaviours. For verification of control properties, the abstracted datapath is then substituted in place&#xd;
of the original one and the control circuitry is left unchanged. With respect to control properties, the&#xd;
abstraction is shown conservative by both language containment and simulation.&#xd;
For verification of control properties, the pipeline datapath is represented by a network of registers,&#xd;
unrestricted combinational datapath blocks and muxes. The values flowing through the datapath are&#xd;
called parcels. The control is the state machine that steers the parcels through the network. As parcels&#xd;
travel through the pipeline, they undergo transformations through the datapath blocks. The control-&#xd;
visible results of these transformations fan-out into control variables which in turn influence the next&#xd;
stage the parcels are transferred to by the control. The semantics of the datapath is formalized as a&#xd;
labelled transition system called a parcel automaton. Parcel automata capture the set of all control&#xd;
visible paths through the pipeline and are derived without the need of reachability analysis of the&#xd;
original pipeline. Datapath abstraction is defined using familiar concepts such as language containment&#xd;
or simulation. We have proved results that show that datapath abstraction leads to pipeline abstraction.&#xd;
Our approach has been incorporated into a practical algorithm that yields directly the abstract parcel&#xd;
automaton, bypassing the construction of the concrete parcel automaton. The algorithm uses a SAT&#xd;
solver to generate incrementally all possible control visible behaviours of the pipeline datapath. Our&#xd;
largest case study is a 32-bit two-wide superscalar OpenRISC microprocessor written in VHDL, where&#xd;
it reduced the size of the implementation from 35k gates to 2k gates in less than 10 minutes while using&#xd;
less than 52MB of memory.</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="subject" lang="en">Datapath abstraction pipelined circuits model checking formal verification</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Automatic Datapath Abstraction Of Pipelined Circuits</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</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>