{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:36Z","timestamp":1750306956548,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T00:00:00Z","timestamp":1367452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,5,2]]},"DOI":"10.1145\/2483028.2483088","type":"proceedings-article","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T20:51:54Z","timestamp":1367959914000},"page":"185-190","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Generating concise assertions with complete coverage"],"prefix":"10.1145","author":[{"given":"Chen-Hsuan","family":"Lin","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Lingyi","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, URBANA, IL, USA"}]},{"given":"Shobha","family":"Vasudevan","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, URBANA, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Berkeley Logic Synthesis and Verification Group.textitABC: Asystem for sequential synthesis and verification. http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/  Berkeley Logic Synthesis and Verification Group.textitABC: Asystem for sequential synthesis and verification. http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/647765.735854"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647771.734410"},{"key":"e_1_3_2_1_4_1","volume-title":"Handbook of Satisfiability,\" IOS Press","author":"Biere A.","year":"2009","unstructured":"A. Biere , M. Heule , H. van Maaren , and T. Walsh (editors). \" Handbook of Satisfiability,\" IOS Press , 2009 . A. Biere, M. Heule, H. van Maaren, and T. Walsh (editors). \"Handbook of Satisfiability,\" IOS Press, 2009."},{"key":"e_1_3_2_1_5_1","unstructured":"BugScope\u2122: A Full-Chip Assertion Synthesis http:\/\/www.nextopsoftware.com  BugScope\u2122: A Full-Chip Assertion Synthesis http:\/\/www.nextopsoftware.com"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403541"},{"key":"e_1_3_2_1_7_1","first-page":"607","volume-title":"Asian South Pacific Design Automation Conf.","author":"Chang P.-H.","year":"2010","unstructured":"P.-H. Chang and L.-C. Wang , \"Automatic assertion extraction viasequential data mining of simulation traces,\" in Proc . Asian South Pacific Design Automation Conf. pp. 607 -- 612 , 2010 . P.-H. Chang and L.-C. Wang, \"Automatic assertion extraction viasequential data mining of simulation traces,\" in Proc. Asian South Pacific Design Automation Conf. pp. 607--612, 2010."},{"key":"e_1_3_2_1_8_1","first-page":"502","volume-title":"Int. Conf. on Theory and Applications of Satisfiability Testing","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n and N. S\u00f6rensson , \" An Extensible SAT-solver,\" in Proc . Int. Conf. on Theory and Applications of Satisfiability Testing , pp. 502 -- 518 , 2003 . N. E\u00e9n and N. S\u00f6rensson, \"An Extensible SAT-solver,\" in Proc. Int. Conf. on Theory and Applications of Satisfiability Testing, pp. 502--518, 2003."},{"key":"e_1_3_2_1_9_1","volume-title":"MA","author":"Foster H.","year":"2003","unstructured":"H. Foster , D. Lacey , and A. Krolnik . \" Assertion-Based Design,\" Norwell , MA , USA : Kluwer Academic Publishers , 2003 . H. Foster, D. Lacey, and A. Krolnik. \"Assertion-Based Design,\" Norwell, MA, USA: Kluwer Academic Publishers, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770351.1770411"},{"key":"e_1_3_2_1_11_1","first-page":"354","author":"Gupta A.","year":"2000","unstructured":"A. Gupta , Z. Yang , P. Ashar , and A. Gupta , \"SAT-Based ImageComputation with Application in Reachability Analysis,\" in Proc. Formal Methods in Computer-Aided Design , pp. 354 -- 371 , 2000 . A. Gupta, Z. Yang, P. Ashar, and A. Gupta, \"SAT-Based ImageComputation with Application in Reachability Analysis,\" in Proc. Formal Methods in Computer-Aided Design, pp. 354--371, 2000.","journal-title":"Formal Methods in Computer-Aided Design"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2005.30"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065786"},{"key":"e_1_3_2_1_14_1","unstructured":"http:\/\/iwls.org\/iwls2005\/benchmarks.html  http:\/\/iwls.org\/iwls2005\/benchmarks.html"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837466"},{"key":"e_1_3_2_1_16_1","unstructured":"Mentor Graphics Inc. \"Assertion-Based Verification \" http:\/\/www.mentor.com\/products\/fv\/methodologies\/abv\/  Mentor Graphics Inc. \"Assertion-Based Verification \" http:\/\/www.mentor.com\/products\/fv\/methodologies\/abv\/"},{"key":"e_1_3_2_1_17_1","unstructured":"OpenCores website:textttopencores.org\/  OpenCores website:textttopencores.org\/"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/513918.513952"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_1_20_1","first-page":"154","volume-title":"Proc. Int. Conf. Computer-Aided Design","author":"Ravi K.","year":"1995","unstructured":"K. Ravi , F. Somenzi , \"High-Density ReachabilityAnalysis,\" in Proc. Int. Conf. Computer-Aided Design , pp. 154 -- 158 , 1995 . K. Ravi, F. Somenzi, \"High-Density ReachabilityAnalysis,\" in Proc. Int. Conf. Computer-Aided Design, pp. 154--158, 1995."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964028"},{"key":"e_1_3_2_1_22_1","first-page":"113","volume-title":"A technique for invariant generation,\" in Proc. of TACAS","author":"Tiwari A.","year":"2001","unstructured":"A. Tiwari , H. Ruess , and N. Shankar , \" A technique for invariant generation,\" in Proc. of TACAS ., pp. 113 -- 127 , 2001 . A. Tiwari, H. Ruess, and N. Shankar, \"A technique for invariant generation,\" in Proc. of TACAS., pp. 113--127, 2001."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"G. Tseitin \"On the complexity of derivation in propositional calculus \" Studies in Constructive Mathematics and Mathematical Logic pp. 466--483 1970.  G. Tseitin \"On the complexity of derivation in propositional calculus \" Studies in Constructive Mathematics and Mathematical Logic pp. 466--483 1970.","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"e_1_3_2_1_24_1","unstructured":"S. Vijayaraghavan and M. Ramanathan \"A Practical Guide for System Verilog Assertions \" Springer Science  S. Vijayaraghavan and M. Ramanathan \"A Practical Guide for System Verilog Assertions \" Springer Science"},{"key":"e_1_3_2_1_25_1","unstructured":"Business Media Inc. New York 2005.  Business Media Inc. New York 2005."},{"key":"e_1_3_2_1_26_1","first-page":"545","author":"Vasudevan S.","year":"2010","unstructured":"S. Vasudevan , D. Sheridan , S. Patel , D. Tcheng , B. Tuohy , and D. Johnson , \"Goldmine: Automatic assertion generation using data mining and static analysis,\" in Proc. of DATE. , pp. 545 -- 548 , 2010 . S. Vasudevan, D. Sheridan, S. Patel, D. Tcheng, B. Tuohy, and D. Johnson, \"Goldmine: Automatic assertion generation using data mining and static analysis,\" in Proc. of DATE., pp. 545--548, 2010.","journal-title":"of DATE."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277188"},{"key":"e_1_3_2_1_28_1","first-page":"310","volume-title":"Int. Conf. Computer-Aided Design.","author":"Wang C.","year":"2007","unstructured":"C. Wang , H. Kim , and A. Gupta , \" Hybrid cegar: combining variablehiding and predicate abstraction,\" in Proc . Int. Conf. Computer-Aided Design. pp. 310 -- 317 , 2007 . C. Wang, H. Kim, and A. Gupta, \"Hybrid cegar: combining variablehiding and predicate abstraction,\" in Proc. Int. Conf. Computer-Aided Design. pp. 310--317, 2007."}],"event":{"name":"GLSVLSI'13: Great Lakes Symposium on VLSI 2013","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEEE CASS"],"location":"Paris France","acronym":"GLSVLSI'13"},"container-title":["Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2483028.2483088","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2483028.2483088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:06Z","timestamp":1750235946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2483028.2483088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,2]]},"references-count":28,"alternative-id":["10.1145\/2483028.2483088","10.1145\/2483028"],"URL":"https:\/\/doi.org\/10.1145\/2483028.2483088","relation":{},"subject":[],"published":{"date-parts":[[2013,5,2]]},"assertion":[{"value":"2013-05-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}