{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/55156"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/55156","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation","abstract":"We present methods for automatically generating and evaluating register transfer level (RTL) assertions. We detail the GoldMine methodology and each of its data mining algorithms. We introduce the Best-Gain Decision Forest algorithm to mine concise RTL assertions. We develop an assertion ranking methodology. We define assertion importance, complexity, rank and ideality and we detail methods to compute each of them. We present a case study and experimental results to demonstrate the effectiveness of assertion rank. We develop an assertion rank aggregation methodology. We define assertion coverage and expectedness. We aggregate rankings for assertion importance, complexity, coverage and expectedness. We present experimental results to demonstrate the value of these metrics and the rank aggregation methodology. We rigorously analyze the performance of each data mining algorithm in GoldMine. We present experimental results that demonstrate each algorithm's performance with respect to various metrics.","abstract_html":"We present methods for automatically generating and evaluating register transfer level (RTL) assertions. We detail the GoldMine methodology and each of its data mining algorithms. We introduce the Best-Gain Decision Forest algorithm to mine concise RTL assertions. We develop an assertion ranking methodology. We define assertion importance, complexity, rank and ideality and we detail methods to compute each of them. We present a case study and experimental results to demonstrate the effectiveness of assertion rank. We develop an assertion rank aggregation methodology. We define assertion coverage and expectedness. We aggregate rankings for assertion importance, complexity, coverage and expectedness. We present experimental results to demonstrate the value of these metrics and the rank aggregation methodology. We rigorously analyze the performance of each data mining algorithm in GoldMine. We present experimental results that demonstrate each algorithm's performance with respect to various metrics.","abstract_has_math":false,"creators":["Hertz, Samuel"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Vasudevan, Shobha"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-06-11T19:44:43Z","date_published":"2013-06-11T19:44:43Z","updated_at":"2026-07-22T22:25:41Z","subjects":["assertion","assertion generation","assertion evaluation","assertion ranking","GoldMine","static analysis","data mining","evaluation","ranking","verification","validation"],"languages":["en"],"rights":["Copyright 2013 Samuel Hertz"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/55156","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Vasudevan, Shobha"]},{"key":"dc:creator","label":"Author","values":["Hertz, Samuel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013-06-11T19:44:43Z","2014-09-25T22:54:19Z","2016-09-26T10:01:42Z","2013-05","2013-06-11"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["assertion","assertion generation","assertion evaluation","assertion ranking","GoldMine","static analysis","data mining","evaluation","ranking","verification","validation"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2013 Samuel Hertz"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/55156"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We present methods for automatically generating and evaluating register transfer level (RTL) assertions. We detail the GoldMine methodology and each of its data mining algorithms. We introduce the Best-Gain Decision Forest algorithm to mine concise RTL assertions. We develop an assertion ranking methodology. We define assertion importance, complexity, rank and ideality and we detail methods to compute each of them. We present a case study and experimental results to demonstrate the effectiveness of assertion rank. We develop an assertion rank aggregation methodology. We define assertion coverage and expectedness. We aggregate rankings for assertion importance, complexity, coverage and expectedness. We present experimental results to demonstrate the value of these metrics and the rank aggregation methodology. We rigorously analyze the performance of each data mining algorithm in GoldMine. We present experimental results that demonstrate each algorithm's performance with respect to various metrics.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-24T22:41:51Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Hertz_Samuel.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5)","Made available in DSpace on 2013-06-11T19:44:43Z (GMT). No. of bitstreams: 1 Hertz_Samuel.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5)","Item reinstated by Joseph Torchedlo (torched2@illinois.edu) on 2013-06-11T19:44:43Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Hertz_Samuel.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5)","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-07-23T19:20:23Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 SUBMISSION_LOG.csv: 9523 bytes, checksum: 2ff00d3989abffa01eb68c6142ec7385 (MD5) MODS.xml: 4289 bytes, checksum: 231416e3696a5c6cf7a4b30d71ad5096 (MD5) HERTZ-THESIS.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5)","Made available in DSpace on 2014-09-25T22:54:19Z (GMT). No. of bitstreams: 4 Samuel_Hertz.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5) SUBMISSION_LOG.csv: 9523 bytes, checksum: 2ff00d3989abffa01eb68c6142ec7385 (MD5) MODS.xml: 4289 bytes, checksum: 231416e3696a5c6cf7a4b30d71ad5096 (MD5) license.txt: 4062 bytes, checksum: 5715db2583dc1dfe582809a51fade28b (MD5) Previous issue date: 2013-06-11","Embargo set by: Seth Robbins for item 55261 Lift date: 2016-09-25T22:54:27Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 55261 on 2016-09-26T10:01:42Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation"]}]}],"canonical_facts":{"dc:contributor":["Vasudevan, Shobha"],"dc:creator":["Hertz, Samuel"],"dc:date":["2013-06-11T19:44:43Z","2014-09-25T22:54:19Z","2016-09-26T10:01:42Z","2013-05","2013-06-11"],"dc:description":["We present methods for automatically generating and evaluating register transfer level (RTL) assertions. We detail the GoldMine methodology and each of its data mining algorithms. We introduce the Best-Gain Decision Forest algorithm to mine concise RTL assertions. We develop an assertion ranking methodology. We define assertion importance, complexity, rank and ideality and we detail methods to compute each of them. We present a case study and experimental results to demonstrate the effectiveness of assertion rank. We develop an assertion rank aggregation methodology. We define assertion coverage and expectedness. We aggregate rankings for assertion importance, complexity, coverage and expectedness. We present experimental results to demonstrate the value of these metrics and the rank aggregation methodology. We rigorously analyze the performance of each data mining algorithm in GoldMine. We present experimental results that demonstrate each algorithm's performance with respect to various metrics.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-24T22:41:51Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Hertz_Samuel.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5)","Made available in DSpace on 2013-06-11T19:44:43Z (GMT). No. of bitstreams: 1 Hertz_Samuel.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5)","Item reinstated by Joseph Torchedlo (torched2@illinois.edu) on 2013-06-11T19:44:43Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Hertz_Samuel.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5)","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-07-23T19:20:23Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 SUBMISSION_LOG.csv: 9523 bytes, checksum: 2ff00d3989abffa01eb68c6142ec7385 (MD5) MODS.xml: 4289 bytes, checksum: 231416e3696a5c6cf7a4b30d71ad5096 (MD5) HERTZ-THESIS.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5)","Made available in DSpace on 2014-09-25T22:54:19Z (GMT). No. of bitstreams: 4 Samuel_Hertz.pdf: 1329404 bytes, checksum: 7c55235ca0b87af37ed129d3585a617c (MD5) SUBMISSION_LOG.csv: 9523 bytes, checksum: 2ff00d3989abffa01eb68c6142ec7385 (MD5) MODS.xml: 4289 bytes, checksum: 231416e3696a5c6cf7a4b30d71ad5096 (MD5) license.txt: 4062 bytes, checksum: 5715db2583dc1dfe582809a51fade28b (MD5) Previous issue date: 2013-06-11","Embargo set by: Seth Robbins for item 55261 Lift date: 2016-09-25T22:54:27Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 55261 on 2016-09-26T10:01:42Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/55156"],"dc:language":["en"],"dc:rights":["Copyright 2013 Samuel Hertz"],"dc:subject":["assertion","assertion generation","assertion evaluation","assertion ranking","GoldMine","static analysis","data mining","evaluation","ranking","verification","validation"],"dc:title":["Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:41Z"}