{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:57:03Z","timestamp":1725530223455},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642007675"},{"type":"electronic","value":"9783642007682"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00768-2_20","type":"book-chapter","created":{"date-parts":[[2009,3,26]],"date-time":"2009-03-26T21:16:10Z","timestamp":1238102170000},"page":"201-214","source":"Crossref","is-referenced-by-count":3,"title":["Memoised Garbage Collection for Software Model Checking"],"prefix":"10.1007","author":[{"given":"Viet Yen","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theo C.","family":"Ruys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Aan de Brugh, N.H.M.: Software Model Checking for Mono. Master\u2019s thesis, University of Twente, Enschede, The Netherlands (August 2006)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-642-00768-2_15","volume-title":"TACAS 2009","author":"N.H.M. Aan de Brugh","year":"2009","unstructured":"Aan de Brugh, N.H.M., Ruys, T.C., Nguyen, V.Y.: MoonWalker: Verification of .NET Programs. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 170\u2013173. Springer, Heidelberg (2009)"},{"key":"20_CR3","unstructured":"Cherkassky, B.V., Goldberg, A.V., Silverstein, C.: Buckets, Heaps, Lists, and Monotone Priority Queues. In: Saks, M. (ed.) SODA 1997: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 83\u201392. Society for Industrial and Applied Mathematics (1997)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Corbett, J.C., Dwyer, M.B., Hatcliff, J., Bandera, R.: A Source-Level Interface for Model Checking Java Programs. In: ICSE 2000, pp. 762\u2013765 (2000)","DOI":"10.1145\/337180.337625"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.: A Note on Two Problems in Connexion with Graphs. In: Numerische Mathematik, vol.\u00a01, pp. 269\u2013271 (1959)","DOI":"10.1007\/BF01386390"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/11940197_13","volume-title":"Formal Approaches to Software Testing and Runtime Verification","author":"T. Elmas","year":"2006","unstructured":"Elmas, T., Qadeer, S., Tasiran, S.: Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets. In: Havelund, K., N\u00fa\u00f1ez, M., Ro\u015fu, G., Wolff, B. (eds.) FATES 2006 and RV 2006. LNCS, vol.\u00a04262, pp. 193\u2013208. Springer, Heidelberg (2006)"},{"key":"20_CR7","first-page":"110","volume-title":"POPL 2005","author":"C. Flanagan","year":"2005","unstructured":"Flanagan, C., Godefroid, P.: Dynamic Partial-Order Reduction for Model Checking Software. In: Palsberg, J., Abadi, M. (eds.) POPL 2005, pp. 110\u2013121. ACM, New York (2005)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Grieskamp, W., Tillmann, N., Schulte, W.: XRT- Exploring Runtime for. NET Architecture and Applications. In: Cook, B., Stoller, S., Visser, W. (eds.) Proceedings of the Workshop on Software Model Checking, SoftMC 2005. Electr. Notes Theor. Comput. Sci., vol.\u00a0144, pp. 3\u201326 (2006)","DOI":"10.1016\/j.entcs.2006.01.002"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-48234-2_11","volume-title":"Theoretical and Practical Aspects of SPIN Model Checking","author":"K. Havelund","year":"1999","unstructured":"Havelund, K.: Java PathFinder, A Translator from Java to Promela. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol.\u00a01680, p. 152. Springer, Heidelberg (1999)"},{"key":"20_CR10","volume-title":"The Spin Model Checker \u2013 Primer and Reference Manual","author":"G.J. Holzmann","year":"2004","unstructured":"Holzmann, G.J.: The Spin Model Checker \u2013 Primer and Reference Manual. Addison-Wesley, Boston (2004)"},{"key":"20_CR11","first-page":"254","volume-title":"ASE 2001","author":"R. Iosif","year":"2001","unstructured":"Iosif, R.: Exploiting Heap Symmetries in Explicit-State Model Checking of Software. In: ASE 2001, pp. 254\u2013261. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"4","key":"20_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s10009-004-0154-9","volume":"6","author":"R. Iosif","year":"2004","unstructured":"Iosif, R.: Symmetry Reductions for Model Checking of Concurrent Dynamic Software. STTT\u00a06(4), 302\u2013319 (2004)","journal-title":"STTT"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/10722468_2","volume-title":"SPIN Model Checking and Software Verification","author":"R. Iosif","year":"2000","unstructured":"Iosif, R., Sisto, R.: Using Garbage Collection in Model Checking. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.\u00a01885, pp. 20\u201333. Springer, Heidelberg (2000)"},{"key":"20_CR14","volume-title":"Garbage Collection","author":"R. Jones","year":"1996","unstructured":"Jones, R., Lins, R.: Garbage Collection. John Wiley & Sons, Chichester (1996)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45139-0_6","volume-title":"Model Checking Software","author":"F. Lerda","year":"2001","unstructured":"Lerda, F., Visser, W.: Addressing Dynamic Issues of Program Model Checking. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 80\u2013102. Springer, Heidelberg (2001)"},{"issue":"4","key":"20_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, J.: Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I. Communications of the ACM\u00a03(4), 184\u2013195 (1960)","journal-title":"Communications of the ACM"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/11537328_6","volume-title":"Model Checking Software","author":"M. Musuvathi","year":"2005","unstructured":"Musuvathi, M., Dill, D.L.: An Incremental Heap Canonicalization Algorithm. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 28\u201342. Springer, Heidelberg (2005)"},{"key":"20_CR18","unstructured":"Nguyen, V.Y.: Optimising Techniques for Model Checkers. Master\u2019s thesis, University of Twente, Enschede, The Netherlands (December 2007)"},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: An Incremental Algorithm for a Generalization of the Shortest-Path Problem. Journal Algorithms\u00a021(2), 267\u2013305 (1996)","journal-title":"Journal Algorithms"},{"key":"20_CR20","first-page":"369","volume-title":"ASE 2006","author":"Robby","year":"2006","unstructured":"Robby, Dwyer, M.B., Hatcliff, J.: Domain-specific Model Checking Using The Bogor Framework. In: ASE 2006, pp. 369\u2013370. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.entcs.2007.02.066","volume":"190","author":"T.C. Ruys","year":"2007","unstructured":"Ruys, T.C., Aan de Brugh, N.H.M.: MMC: the Mono Model Checker. Electr. Notes Theor. Comput. Sci.\u00a0190(1), 149\u2013160 (2007); Proc. of Bytecode 2007","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"20_CR22","volume-title":"ACM\/IEEE Conference on Supercomputing (SC 2001)","author":"L.A. Smith","year":"2001","unstructured":"Smith, L.A., Bull, J.M., Obdrz\u00e1lek, J.: A Parallel Java Grande Benchmark Suite. In: ACM\/IEEE Conference on Supercomputing (SC 2001). ACM, New York (2001)"},{"key":"20_CR23","first-page":"3","volume-title":"ASE 2000","author":"W. Visser","year":"2000","unstructured":"Visser, W., Havelund, K., Brat, G.P., Park, S.: Model Checking Programs. In: ASE 2000, pp. 3\u201312. IEEE Computer Society, Los Alamitos (2000)"},{"key":"20_CR24","unstructured":"The Java Grande Forum Benchmark Suite, http:\/\/www.epcc.ed.ac.uk\/research\/activities\/java-grande\/"},{"key":"20_CR25","unstructured":"Java PathFinder, http:\/\/javapathfinder.sourceforge.net\/"},{"key":"20_CR26","unstructured":"MoonWalker, http:\/\/www.cs.utwente.nl\/~ruys\/moonwalker\/"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00768-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T23:52:27Z","timestamp":1558223547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00768-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642007675","9783642007682"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00768-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}