{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:55:20Z","timestamp":1725519320377},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540883869"},{"type":"electronic","value":"9783540883876"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88387-6_28","type":"book-chapter","created":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T01:42:45Z","timestamp":1223602965000},"page":"318-331","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Shimizu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyoharu","family":"Hamaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshinobu","family":"Kashiwabara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-58179-0_44","volume-title":"Computer Aided Verification","author":"J.R. Burch","year":"1994","unstructured":"Burch, J.R., Dill, D.L.: Automated verification of pipelined microprocessor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 68\u201380. Springer, Heidelberg (1994)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-40922-X_28","volume-title":"Formal Methods in Computer-Aided Design","author":"K. Hamaguchi","year":"2000","unstructured":"Hamaguchi, K., Urushihara, H., Kashiwabara, T.: Symbolic Checking of Signal-Transition Consistency for Verifying High-Level Designs. In: Hunt Jr., W.A., Johnson, S.D. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 455\u2013469. Springer, Heidelberg (2000)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/BFb0031810","volume-title":"Formal Methods in Computer-Aided Design","author":"R. Hojati","year":"1996","unstructured":"Hojati, R., Isles, A., Kirkpatrick, D., Brayton, R.K.: Verification using uninterpreted functions and finite instantiations. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol.\u00a01166, pp. 218\u2013232. Springer, Heidelberg (1996)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Isles, A.J., Hojati, R., Brayton, R.K.: Computing Reachable Control States of Systems Modeled with Uninterpreted Functions and Infinite Memory. In: 10th International Conference on Computer Aided Verification, pp. 256\u2013267 (1998)","DOI":"10.1007\/BFb0028750"},{"key":"28_CR6","unstructured":"SAL, \n                    \n                      http:\/\/sal.csl.sri.com\/"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Armando, A., Benerecetti, M., Carotenuto, D., Mantovani, J., Spica, P.: The Eureka Tool for Software Model Checking. In: 22nd IEEE\/ACM ASE Conference (2007)","DOI":"10.1145\/1321631.1321734"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Corella, F., Zhou, Z., Song, X., Langevin, M., Cerny, E.: Multiway Decision Graphs for Automated Hardware Verification. Formal Methods in System Design, vol.\u00a010(1), pp. 7\u201346 (1997)","DOI":"10.1023\/A:1008663530211"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-39724-3_31","volume-title":"Correct Hardware Design and Verification Methods","author":"R.E. Bryant","year":"2003","unstructured":"Bryant, R.E., Lahiri, S.K., Seshia, S.A.: Convergence Testing in Term-Level Bounded Model Checking. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol.\u00a02860, pp. 348\u2013362. Springer, Heidelberg (2003)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Kozawa, H., Hamaguchi, K., Kashiwabara, T.: Satisfiability Checking for Logic with Equality and Uninterpreted Functions under Equivalence Constraints. In: IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, pp. 2778\u20132789 (2007)","DOI":"10.1093\/ietfec\/e90-a.12.2778"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"28_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)"},{"issue":"5","key":"28_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng.\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Kroening, D., Lerda, F.: A Tool for Checking ANSI-C Programs. In: Proceedings of Tools and Algorithms for the Analysis and Construction of Systems, pp. 168\u2013176 (2004)","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-45657-0_7","volume-title":"Computer Aided Verification","author":"R.E. Bryant","year":"2002","unstructured":"Bryant, R.E., German, S., Velev, M.N.: Modeling and Verifying Systems using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 78\u201392. Springer, Heidelberg (2002)"},{"key":"28_CR16","unstructured":"Yices: An SMT Solver, \n                    \n                      http:\/\/yices.csl.sri.com\/"},{"key":"28_CR17","unstructured":"OPENCORES.ORG, \n                    \n                      http:\/\/www.opencores.org\/"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88387-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T12:18:52Z","timestamp":1551615532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88387-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540883869","9783540883876"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88387-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}