iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1145/1837274.1837319
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:05:39Z","timestamp":1730315139108,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1837274.1837319","type":"proceedings-article","created":{"date-parts":[[2010,10,28]],"date-time":"2010-10-28T14:47:40Z","timestamp":1288277260000},"page":"176-181","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Analyzing\n k<\/i>\n -step induction to compute invariants for SAT-based property checking"],"prefix":"10.1145","author":[{"given":"Max","family":"Thalmaier","sequence":"first","affiliation":[{"name":"University of Kaiserslautern"}]},{"given":"Minh D.","family":"Nguyen","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern"}]},{"given":"Markus","family":"Wedler","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern"}]},{"given":"Dominik","family":"Stoffel","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern"}]},{"given":"J\u00f6rg","family":"Bormann","sequence":"additional","affiliation":[{"name":"Abstract RT Solutions, Munich, Germany"}]},{"given":"Wolfgang","family":"Kunz","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ABC. http:\/\/www.eecs.berkeley.edu\/alanmi\/abc\/. ABC. http:\/\/www.eecs.berkeley.edu\/alanmi\/abc\/."},{"volume-title":"Proc. International Conference on Computer-Aided Design (ICCAD)","year":"2005","author":"Ali M. F.","key":"e_1_3_2_1_2_1","unstructured":"M. F. Ali , S. Safarpour , A. Veneris , M. S. Abadir , and R. Drechsler . Post-verification debugging of hierarchical designs . In Proc. International Conference on Computer-Aided Design (ICCAD) , 2005 . M. F. Ali, S. Safarpour, A. Veneris, M. S. Abadir, and R. Drechsler. Post-verification debugging of hierarchical designs. In Proc. International Conference on Computer-Aided Design (ICCAD), 2005."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646483.691738"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646186.683097"},{"volume-title":"Technische Universit\u00e4t Kaiserslautern","year":"2009","author":"Bormann J.","key":"e_1_3_2_1_5_1","unstructured":"J. Bormann . Vollst\u00e4ndige Verifikation . Dissertation , Technische Universit\u00e4t Kaiserslautern , 2009 . J. Bormann. Vollst\u00e4ndige Verifikation. Dissertation, Technische Universit\u00e4t Kaiserslautern, 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647765.735860"},{"key":"e_1_3_2_1_7_1","first-page":"1693","article-title":"Improving SAT-based bounded model checking by means of BDD-based approximate traversals","volume":"10","author":"Cabodi G.","year":"2004","unstructured":"G. Cabodi , S. Nocco , and S. Quer . Improving SAT-based bounded model checking by means of BDD-based approximate traversals . Journal of Universal Computer Science , 10 : 1693 -- 1730 , 2004 . G. Cabodi, S. Nocco, and S. Quer. Improving SAT-based bounded model checking by means of BDD-based approximate traversals. Journal of Universal Computer Science, 10:1693--1730, 2004.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.552080"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.552079"},{"key":"e_1_3_2_1_10_1","first-page":"495","volume-title":"Proc. International Conference on Computer Aided Verification (CAV), number 1633 in Lecture Notes in Computer Science","author":"Cimatti A.","year":"1999","unstructured":"A. Cimatti , E. M. Clarke , F. Giunchiglia , and M. Roveri . NuSMV: a new symbolic model verifier . In N. Halbwachs and D. Peled, editors, Proc. International Conference on Computer Aided Verification (CAV), number 1633 in Lecture Notes in Computer Science , pages 495 -- 499 , Trento, Italy, July 1999 . Springer . A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new symbolic model verifier. In N. Halbwachs and D. Peled, editors, Proc. International Conference on Computer Aided Verification (CAV), number 1633 in Lecture Notes in Computer Science, pages 495--499, Trento, Italy, July 1999. Springer."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647769.734089"},{"volume-title":"Model Checking","year":"1999","author":"Clarke E. M.","key":"e_1_3_2_1_13_1","unstructured":"E. M. Clarke , O. Grumberg , and D. A. Peled . Model Checking . MIT Press , London, England , 1999 . E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, London, England, 1999."},{"volume-title":"Proc. International Workshop on Bounded Model Checking (BMC03)","year":"2003","author":"Een N.","key":"e_1_3_2_1_14_1","unstructured":"N. Een and N. Soerensson . Temporal induction by incremental sat solving . In Proc. International Workshop on Bounded Model Checking (BMC03) , 2003 . N. Een and N. Soerensson. Temporal induction by incremental sat solving. In Proc. International Workshop on Bounded Model Checking (BMC03), 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45069-6_20"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/996070.1009924"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763507.1763566"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45069-6_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765871.1765875"},{"key":"e_1_3_2_1_20_1","first-page":"41","volume-title":"Proc. International Conference on Computer-Aided Design (ICCAD)","author":"Moon I.-H.","year":"1999","unstructured":"I.-H. Moon , J. Kakula , T. Shiple , and F. Somenzi . Least fixpoint approximations for reachability analysis . In Proc. International Conference on Computer-Aided Design (ICCAD) , pages 41 -- 44 , 1999 . I.-H. Moon, J. Kakula, T. Shiple, and F. Somenzi. Least fixpoint approximations for reachability analysis. In Proc. International Conference on Computer-Aided Design (ICCAD), pages 41--44, 1999."},{"volume-title":"Proc. Forum on Specification & Design Languages(FDL)","year":"2009","author":"Nguyen M.","key":"e_1_3_2_1_21_1","unstructured":"M. Nguyen , M. Thalmaier , M. Wedler , D. Stoffel , and W. Kunz . A re-use methodology for formal soc protocol compliance . In Proc. Forum on Specification & Design Languages(FDL) , Sophia Antipolis, France , September 2009 . M. Nguyen, M. Thalmaier, M. Wedler, D. Stoffel, and W. Kunz. A re-use methodology for formal soc protocol compliance. In Proc. Forum on Specification & Design Languages(FDL), Sophia Antipolis, France, September 2009."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2006092"},{"key":"e_1_3_2_1_23_1","unstructured":"Onespin Solutions GmbH Germany. OneSpin 360MV. Onespin Solutions GmbH Germany. OneSpin 360MV."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646186.683237"},{"key":"e_1_3_2_1_25_1","unstructured":"F. Somenzi. CUDD: CU Decision Diagram Package. F. Somenzi. CUDD: CU Decision Diagram Package ."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/996070.1009923"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.812320"}],"event":{"name":"DAC '10: The 47th Annual Design Automation Conference 2010","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA"],"location":"Anaheim California","acronym":"DAC '10"},"container-title":["Proceedings of the 47th Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1837274.1837319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T22:56:07Z","timestamp":1673477767000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837274.1837319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":27,"alternative-id":["10.1145\/1837274.1837319","10.1145\/1837274"],"URL":"http:\/\/dx.doi.org\/10.1145\/1837274.1837319","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}