{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:05Z","timestamp":1725558965874},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253334"},{"type":"electronic","value":"9783540319801"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31980-1_41","type":"book-chapter","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:44:59Z","timestamp":1278888299000},"page":"575-580","source":"Crossref","is-referenced-by-count":10,"title":["DiVer: SAT-Based Model Checking Platform for Verifying Large Scale Systems"],"prefix":"10.1007","author":[{"given":"Malay K","family":"Ganai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aarti","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranav","family":"Ashar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"41_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking: An Approach to the State Explosion Problem","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, Dordrecht (1993)"},{"issue":"8","key":"41_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Proceedings of DAC (1999)","DOI":"10.21236\/ADA360973"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., Stalmarck, G.: Checking Safety Properties using Induction and a SAT Solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 108\u2013125. Springer, Heidelberg (2000)"},{"key":"41_CR6","unstructured":"Ganai, M., Aziz, A.: Improved SAT-based Bounded Reachability Analysis. In: Proceedings of VLSI Design Conference (2002)"},{"key":"41_CR7","unstructured":"Ganai, M., Zhang, L., Gupta, A., Ashar, P., Yang, Z.: Efficient Approaches for Bounded Model Checking. US Patent Application 2003-0225552, Filed on May 30 (2002)"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45657-0_19","volume-title":"Computer Aided Verification","author":"K. McMillan","year":"2002","unstructured":"McMillan, K.: Applying SAT methods in Unbounded Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 250. Springer, Heidelberg (2002)"},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-36577-X_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. McMillan","year":"2003","unstructured":"McMillan, K., Amla, N.: Automatic Abstraction without Counterexamples. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 2\u201317. Springer, Heidelberg (2003)"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"K. McMillan","year":"2003","unstructured":"McMillan, K.: Interpolation and SAT-based Model Checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 1\u201313. Springer, Heidelberg (2003)"},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-45069-6_20","volume-title":"Computer Aided Verification","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Ganai, M., Wang, C., Yang, Z., Ashar, P.: Abstraction and Bdds Complement SAT-Based BMC in DiVer. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 206\u2013209. Springer, Heidelberg (2003)"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Ganai, M., Gupta, A., Ashar, P.: Distributed SAT and Distributed Bounded Model Checking. In: Proceedings of CHARME (2003)","DOI":"10.1007\/978-3-540-39724-3_30"},{"key":"41_CR13","unstructured":"Gupta, A., Ganai, M., Ashar, P., Yang, Z.: Iterative Abstraction using SAT-based BMC with Proof Analysis. In: Proceedings of ICCAD (2003)"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-27813-9_34","volume-title":"Computer Aided Verification","author":"M. Ganai","year":"2004","unstructured":"Ganai, M., Gupta, A., Ashar, P.: Efficient Modeling of Embedded Memories in Bounded Model Checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 440\u2013452. Springer, Heidelberg (2004)"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Ganai, M., Gupta, A., Ashar, P.: Efficient SAT-based Unbounded Model Checking Using Circuit Cofactoring. In: Proceedings of ICCAD (2004)","DOI":"10.1145\/775832.776040"},{"key":"41_CR16","unstructured":"Gupta, A., Ganai, M., Ashar, P.: Lazy Constraints and SAT Heuristics for Proof-based Abstraction. In: Proceedings of VLSI Design (2005)"},{"key":"41_CR17","unstructured":"Ganai, M., Gupta, A., Ashar, P.: Verification of Embedded Memory Systems using Efficient Memory Modeling. In: Proceedings of DATE (2005)"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Kuehlmann, A., Ganai, M., Paruthi, V.: Circuit-based Boolean Reasoning. In: Proceedings of DAC (2001)","DOI":"10.1145\/378239.378470"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of DAC (2001)","DOI":"10.1145\/378239.379017"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Ganai, M., Zhang, L., Ashar, P., Gupta, A.: Combining Strengths of Circuit-based and CNF-based Algorithms for a High Performance SAT Solver. In: Proceedings of DAC (2002)","DOI":"10.1145\/513918.514105"},{"key":"41_CR21","unstructured":"Ganai, M., Kuehlmann, A.: On-the-fly Compression of Logical Circuits. In: Proceedings of IWLS (2000)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31980-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T05:31:01Z","timestamp":1635658261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31980-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253334","9783540319801"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31980-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}