{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/11188"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/11188","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Formal Verification of FPGA Based Systems","abstract":"<p>In design verication, although simulation is still a widely used verication</p> <p>technique in FPGA design, formal verication is obtaining greater acceptance</p> <p>as the complexity of designs increases. In the simulation method, for a circuit</p> <p>with n inputs and m registers an exhaustive test vector will have as many as</p> <p>2<sup>(m+n)</sup> elements making it impractical for many modern circuits. Therefore</p> <p>this method is incomplete, i.e., it may fail to catch some design errors due to</p> <p>the lack of complete test coverage. Formal verication can be introduced as a</p> <p>complement to traditional verication techniques.</p> <p>The primary objectives of this thesis are determining: (i) how to for-</p> <p>malize FPGA implementations at dierent levels of abstraction, and (ii) how</p> <p>to prove their functional correctness. This thesis explores two variations of a</p> <p>formal verication framework by proving the functional correctness of several</p> <p>FPGA implementations of commonly used safety subsystem components us-</p> <p>ing the theorem prover PVS. We formalize components at the netlist level and</p> <p>the Verilog Register Transfer HDL level, preserving their functional semantics.</p> <p>Based on these formal models, we prove correctness conditions for the com-</p> <p>ponents using PVS. Finally, we present some techniques which can facilitate</p> <p>the proving process and describe some general strategies which can be used to</p> <p>prove properties of a synchronous circuit design.</p>","abstract_html":"&lt;p&gt;In design verication, although simulation is still a widely used verication&lt;/p&gt; &lt;p&gt;technique in FPGA design, formal verication is obtaining greater acceptance&lt;/p&gt; &lt;p&gt;as the complexity of designs increases. In the simulation method, for a circuit&lt;/p&gt; &lt;p&gt;with n inputs and m registers an exhaustive test vector will have as many as&lt;/p&gt; &lt;p&gt;2&lt;sup&gt;(m+n)&lt;/sup&gt; elements making it impractical for many modern circuits. Therefore&lt;/p&gt; &lt;p&gt;this method is incomplete, i.e., it may fail to catch some design errors due to&lt;/p&gt; &lt;p&gt;the lack of complete test coverage. Formal verication can be introduced as a&lt;/p&gt; &lt;p&gt;complement to traditional verication techniques.&lt;/p&gt; &lt;p&gt;The primary objectives of this thesis are determining: (i) how to for-&lt;/p&gt; &lt;p&gt;malize FPGA implementations at dierent levels of abstraction, and (ii) how&lt;/p&gt; &lt;p&gt;to prove their functional correctness. This thesis explores two variations of a&lt;/p&gt; &lt;p&gt;formal verication framework by proving the functional correctness of several&lt;/p&gt; &lt;p&gt;FPGA implementations of commonly used safety subsystem components us-&lt;/p&gt; &lt;p&gt;ing the theorem prover PVS. We formalize components at the netlist level and&lt;/p&gt; &lt;p&gt;the Verilog Register Transfer HDL level, preserving their functional semantics.&lt;/p&gt; &lt;p&gt;Based on these formal models, we prove correctness conditions for the com-&lt;/p&gt; &lt;p&gt;ponents using PVS. Finally, we present some techniques which can facilitate&lt;/p&gt; &lt;p&gt;the proving process and describe some general strategies which can be used to&lt;/p&gt; &lt;p&gt;prove properties of a synchronous circuit design.&lt;/p&gt;","abstract_has_math":false,"creators":["Deng, Honghan"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Software Engineering","school":null,"contributors":[],"advisors":["Lawford, Mark"],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-10","date_published":"2011-10","updated_at":"2026-11-18T19:39:47Z","subjects":["Formal method","PVS","Hardware verification","FPGA","HDL.","Digital Circuits","Hardware Systems","Other Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/23976"],"render_values":[{"text":"https://doi.org/10.71548/23976","href":"https://doi.org/10.71548/23976","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/6175","7188","2240955"],"render_values":[{"text":"opendissertations/6175","href":null,"code":true},{"text":"7188","href":null,"code":true},{"text":"2240955","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/11188","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/11188","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F11188","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Lawford, Mark"]},{"key":"dc:contributor.department","label":"Department","values":["Software Engineering"]},{"key":"dc:creator","label":"Author","values":["Deng, Honghan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:53:51Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:53:51Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-09-15"]},{"key":"dc:date.issued","label":"Date","values":["2011-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Formal method","PVS","Hardware verification","FPGA","HDL.","Digital Circuits","Hardware Systems","Other Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/6175","7188","2240955"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/11188","https://doi.org/10.71548/23976"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>In design verication, although simulation is still a widely used verication</p> <p>technique in FPGA design, formal verication is obtaining greater acceptance</p> <p>as the complexity of designs increases. In the simulation method, for a circuit</p> <p>with n inputs and m registers an exhaustive test vector will have as many as</p> <p>2<sup>(m+n)</sup> elements making it impractical for many modern circuits. Therefore</p> <p>this method is incomplete, i.e., it may fail to catch some design errors due to</p> <p>the lack of complete test coverage. Formal verication can be introduced as a</p> <p>complement to traditional verication techniques.</p> <p>The primary objectives of this thesis are determining: (i) how to for-</p> <p>malize FPGA implementations at dierent levels of abstraction, and (ii) how</p> <p>to prove their functional correctness. This thesis explores two variations of a</p> <p>formal verication framework by proving the functional correctness of several</p> <p>FPGA implementations of commonly used safety subsystem components us-</p> <p>ing the theorem prover PVS. We formalize components at the netlist level and</p> <p>the Verilog Register Transfer HDL level, preserving their functional semantics.</p> <p>Based on these formal models, we prove correctness conditions for the com-</p> <p>ponents using PVS. Finally, we present some techniques which can facilitate</p> <p>the proving process and describe some general strategies which can be used to</p> <p>prove properties of a synchronous circuit design.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Applied Science (MASc)"]},{"key":"dc:title","label":"Title","values":["Formal Verification of FPGA Based Systems"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Lawford, Mark"],"dc:contributor.department":["Software Engineering"],"dc:creator":["Deng, Honghan"],"dc:date.accessioned":["2014-06-18T16:53:51Z"],"dc:date.available":["2014-06-18T16:53:51Z"],"dc:date.created":["2011-09-15"],"dc:date.issued":["2011-10"],"dc:description.abstract":["<p>In design verication, although simulation is still a widely used verication</p> <p>technique in FPGA design, formal verication is obtaining greater acceptance</p> <p>as the complexity of designs increases. In the simulation method, for a circuit</p> <p>with n inputs and m registers an exhaustive test vector will have as many as</p> <p>2<sup>(m+n)</sup> elements making it impractical for many modern circuits. Therefore</p> <p>this method is incomplete, i.e., it may fail to catch some design errors due to</p> <p>the lack of complete test coverage. Formal verication can be introduced as a</p> <p>complement to traditional verication techniques.</p> <p>The primary objectives of this thesis are determining: (i) how to for-</p> <p>malize FPGA implementations at dierent levels of abstraction, and (ii) how</p> <p>to prove their functional correctness. This thesis explores two variations of a</p> <p>formal verication framework by proving the functional correctness of several</p> <p>FPGA implementations of commonly used safety subsystem components us-</p> <p>ing the theorem prover PVS. We formalize components at the netlist level and</p> <p>the Verilog Register Transfer HDL level, preserving their functional semantics.</p> <p>Based on these formal models, we prove correctness conditions for the com-</p> <p>ponents using PVS. Finally, we present some techniques which can facilitate</p> <p>the proving process and describe some general strategies which can be used to</p> <p>prove properties of a synchronous circuit design.</p>"],"dc:description.degree":["Master of Applied Science (MASc)"],"dc:identifier.other":["opendissertations/6175","7188","2240955"],"dc:identifier.uri":["http://hdl.handle.net/11375/11188","https://doi.org/10.71548/23976"],"dc:subject":["Formal method","PVS","Hardware verification","FPGA","HDL.","Digital Circuits","Hardware Systems","Other Computer Engineering"],"dc:title":["Formal Verification of FPGA Based Systems"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:39:47Z"}