{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:20Z","timestamp":1725512000542},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709510"},{"type":"electronic","value":"9783540709527"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-70952-7_4","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T08:40:01Z","timestamp":1182847201000},"page":"51-66","source":"Crossref","is-referenced-by-count":14,"title":["\u201dTo Store or Not To Store\u201d Reloaded: Reclaiming Memory on Demand"],"prefix":"10.1007","author":[{"given":"Moritz","family":"Hammer","sequence":"first","affiliation":[]},{"given":"Michael","family":"Weber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-3-540-45069-6_40","volume-title":"Computer Aided Verification","author":"G. Behrmann","year":"2003","unstructured":"Behrmann, G., Larsen, K.G., Pel\u00e1nek, R.: To store or not to store. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 433\u2013445. Springer, Heidelberg (2003)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"issue":"7","key":"4_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM\u00a013(7), 422\u2013426 (1970), doi:10.1145\/362686.362692","journal-title":"Commun. ACM"},{"key":"4_CR4","first-page":"13","volume":"4","author":"H. Garavel","year":"2002","unstructured":"Garavel, H., Lang, F., Mateescu, R.: An overview of CADP 2001. EASST Newsletter\u00a04, 13\u201324 (2002)","journal-title":"EASST Newsletter"},{"doi-asserted-by":"crossref","unstructured":"Holm\u00e9n, F., Leucker, M., Lindstr\u00f6m, M.: UppDMC \u2013 a distributed model checker for fragments of the \u03bc-calculus. In: Brim, L., Leucker, M., eds.: Proc. 3rd PDMC. Volume 128(3) of ENTCS. Elsevier Science Publishers (2004)","key":"4_CR5","DOI":"10.1016\/j.entcs.2004.10.021"},{"key":"4_CR6","volume-title":"The SPIN model checker: primer and reference manual","author":"G.J. Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The SPIN model checker: primer and reference manual. Addison-Wesley, Boston (2003)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-3-540-30232-2_22","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"O. Wibling","year":"2004","unstructured":"Wibling, O., Parrow, J., Pears, A.: Automatized verification of ad hoc routing protocols. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol.\u00a03235, pp. 343\u2013358. Springer, Heidelberg (2004)"},{"issue":"4","key":"4_CR8","doi-asserted-by":"crossref","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. STTT\u00a02(4), 394\u2013409 (2000)","journal-title":"STTT"},{"unstructured":"Pel\u00e1nek, R.: Evaluation of on-the-fly state space reductions. In: Proc. of Mathematical and Engineering Methods in Computer Science (MEMICS\u201905), pp. 121\u2013127 (2005)","key":"4_CR9"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1008696026254","volume":"13","author":"G.J. Holzmann","year":"1998","unstructured":"Holzmann, G.J.: An analysis of bitstate hashing. Form. Methods Syst. Des.\u00a013(3), 289\u2013307 (1998)","journal-title":"Form. Methods Syst. Des."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Model Checking Software","author":"P.C. Dillinger","year":"2004","unstructured":"Dillinger, P.C., Manolios, P.: Fast and accurate bitstate verification for SPIN. In: Graf, S., Mounier, L. (eds.) Model Checking Software. LNCS, vol.\u00a02989, Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Stern, U., Dill, D.L.: Using magnatic disk instead of main memory in the murphi verifier. In: Computer Aided Verification, pp. 172\u2013183 (1998), http:\/\/citeseer.ist.psu.edu\/stern98using.html","key":"4_CR12","DOI":"10.1007\/BFb0028743"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/978-3-540-31980-1_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Bao","year":"2005","unstructured":"Bao, T., Jones, M.: Time-efficient model checking with magnetic disk. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 526\u2013540. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Eastlake, D.E., Jones, P.E.: US secure hash algorithm 1 (SHA1). Internet informational RFC 3174 (2001)","key":"4_CR14","DOI":"10.17487\/rfc3174"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"unstructured":"Gailly, J., Adler, M.: zlib data compression library (1995), http:\/\/www.zlib.net\/","key":"4_CR16"},{"unstructured":"Weber, M., Sch\u00fcrmans, S.: NIPS virtual machine and compiler implementation (2005), http:\/\/www.cwi.nl\/~weber\/nips\/","key":"4_CR17"},{"issue":"4","key":"4_CR18","doi-asserted-by":"crossref","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. STTT\u00a02(4), 394\u2013409 (2000)","journal-title":"STTT"},{"unstructured":"Knapp, A., Merz, S.: Model Checking and Code Generation for UML State Machines and Collaborations. In: Proc. 5th Wsh. Tools for System Design and Verification, Technical Report 2002-11, pp. 59\u201364. Institut f\u00fcr Informatik, Universit\u00e4t Augsburg (2002)","key":"4_CR19"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/3-540-36126-X_13","volume-title":"Formal Methods in Computer-Aided Design","author":"G.D. Penna","year":"2002","unstructured":"Penna, G.D., Intrigila, B., Tronci, E., Zilli, M.V.: Exploiting transition locality in the disk based murphi verifier. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.\u00a02517, pp. 202\u2013219. Springer, Heidelberg (2002)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-63166-6_26","volume-title":"Computer Aided Verification","author":"U. Stern","year":"1997","unstructured":"Stern, U., Dill, D.L.: Parallelizing the Mur\u03d5 verifier. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 256\u2013267. Springer, Heidelberg (1997)"},{"unstructured":"Edelkamp, S., Jabbar, S.: Accelerating external search with bitstate hashing. In: 19. Workshop on New Results in Planning, Scheduling and Design (2005)","key":"4_CR22"},{"doi-asserted-by":"crossref","unstructured":"Barnat, J., Brim, L., \u010cern\u00e1, I., \u0160ime\u010dek, P.: DiVinE the distributed verification environment. In: Leucker, M., van de Pol, J. (eds.) 4th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC\u201905), Lisbon, Portugal, July (2005)","key":"4_CR23","DOI":"10.1007\/11817963_26"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Applications and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70952-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T14:01:17Z","timestamp":1683900077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70952-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709510","9783540709527"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70952-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}