{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:51:26Z","timestamp":1725573086864},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540242970"},{"type":"electronic","value":"9783540305798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30579-8_21","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T16:45:34Z","timestamp":1292863534000},"page":"313-329","source":"Crossref","is-referenced-by-count":10,"title":["I\/O Efficient Directed Model Checking"],"prefix":"10.1007","author":[{"given":"Shahid","family":"Jabbar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04558-9","volume-title":"Systems and Software Verification","author":"B. B\u00e9rard","year":"2001","unstructured":"B\u00e9rard, B., Bidoit, A.F.M., Laroussine, F., Petit, A., Petrucci, L., Schoenebelen, P., McKenzie, P.: Systems and Software Verification. Springer, Heidelberg (2001)"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillian, K.L., Hwang, J.: Symbolic model checking: 1020 states and beyond. Information and Computation\u00a098(2), 142\u2013170 (1992)","journal-title":"Information and Computation"},{"key":"21_CR3","volume-title":"Model Checking","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"21_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-30221-6_18","volume-title":"KI 2004: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"2004","unstructured":"Edelkamp, S., Jabbar, S., Schroedl, S.: External A*. In: Biundo, S., Fr\u00fchwirth, T., Palm, G. (eds.) KI 2004. LNCS (LNAI), vol.\u00a03238, pp. 226\u2013240. Springer, Heidelberg (2004)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology, STTT (2004)","DOI":"10.1007\/s10009-002-0104-3"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0095430","volume-title":"KI-98: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"1998","unstructured":"Edelkamp, S., Reffel, F.: OBDDs in heuristic search. In: Herzog, O. (ed.) KI 1998. LNCS, vol.\u00a01504, pp. 81\u201392. Springer, Heidelberg (1998)"},{"key":"21_CR8","unstructured":"Edelkamp, S., Schr\u00f6dl, S.: Localizing A*. In: National Conference on Artificial Intelligence (AAAI), pp. 885\u2013890 (2000)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum path cost. IEEE Transactions on on Systems Science and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Transactions on on Systems Science and Cybernetics"},{"key":"21_CR10","volume-title":"Design and Validation of Computer Protocols","author":"G.J. Holzmann","year":"1990","unstructured":"Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs (1990)"},{"key":"21_CR11","unstructured":"Jensen, R.M., Bryant, R.E., Veloso, M.M.: SetA*: An efficient BDD-based heuristic search algorithm. In: National Conference on Artificial Intelligence, AAAI (2002)"},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s100090050045","volume":"2","author":"M. Kamel","year":"2000","unstructured":"Kamel, M., Leue, S.: Formalization and validation of the General Inter-ORB Protocol (GIOP) using PROMELA and SPIN. International Journal on Software Tools for Technology Transfer\u00a02(4), 394\u2013409 (2000)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"21_CR13","unstructured":"Korf, R.: Best-first frontier search with delayed duplicate detection. In: National Conference on Artificial Intelligence (AAAI), pp. 650\u2013657 (2004)"},{"key":"21_CR14","unstructured":"Korf, R.E.: Breadth-first frontier search with delayed duplicate detection. In: Workshop on Model Checking and Artificial Intelligence (MoChArt), pp. 87\u201392 (2003)"},{"key":"21_CR15","unstructured":"Lluch-Lafuente, A.: Symmetry reduction and heuristic search for error detection in model checking. In: Model Checking and Artificial Intelligence, MoChArt 2003 (2003)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-46017-9_10","volume-title":"Model Checking Software","author":"A. Lluch-Lafuente","year":"2002","unstructured":"Lluch-Lafuente, A., Edelkamp, S., Leue, S.: Partial order reduction in directed model checking. In: Bo\u0161na\u010dki, D., Leue, S. (eds.) SPIN 2002. LNCS, vol.\u00a02318, pp. 112\u2013127. Springer, Heidelberg (2002)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/3-540-45749-6_63","volume-title":"Algorithms - ESA 2002","author":"K. Mehlhorn","year":"2002","unstructured":"Mehlhorn, K., Meyer, U.: External-memory breadth-first search with sublinear I\/O. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 723\u2013735. Springer, Heidelberg (2002)"},{"key":"21_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36574-5","volume-title":"Memory Hierarchies","author":"U. Meyer","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.: Memory Hierarchies. Springer, Heidelberg (2003)"},{"key":"21_CR19","unstructured":"Munagala, K., Ranade, A.: I\/O-complexity of graph algorithms. In: Symposium on Discrete Algorithms (SODA), pp. 87\u201388 (2001)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Sawatzki, D.: Experimental studies of symbolic shortest-path algorithms. In: Workshop on Algorithm Engineering (WAE), pp. 482\u2013497 (2004)","DOI":"10.1007\/978-3-540-24838-5_36"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Sawatzki, D.: A symbolic approach to the all-pairs shortest-paths problem. In: Workshop on Algorithm Engineering (WAE), pp. 482\u2013497 (2004)","DOI":"10.1007\/978-3-540-30559-0_13"},{"issue":"2","key":"21_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ipl.2004.03.015","volume":"91","author":"J.F. Sibeyn","year":"2004","unstructured":"Sibeyn, J.F.: External matrix multiplication and all-pairs shortest path. Information Processing Letters\u00a091(2), 99\u2013106 (2004)","journal-title":"Information Processing Letters"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0028743","volume-title":"Computer Aided Verification","author":"U. Stern","year":"1998","unstructured":"Stern, U., Dill, D.: Using magnetic disk instead of main memory in the murphi verifier. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 172\u2013183. Springer, Heidelberg (1998)"},{"key":"21_CR24","unstructured":"Zhou, R., Hansen, E.: Breadth-first heuristic search. In: International Conference on Automated Planning and Scheduling (ICAPS), pp. 92\u2013100 (2004)"},{"key":"21_CR25","unstructured":"Zhou, R., Hansen, E.: Structured duplicate detection in external-memory graph search. In: National Conference on Artificial Intelligence (AAAI), pp. 683\u2013689 (2004)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30579-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:17Z","timestamp":1605759857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30579-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540242970","9783540305798"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30579-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}