{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:21:05Z","timestamp":1725560465705},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213147"},{"type":"electronic","value":"9783540247326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24732-6_3","type":"book-chapter","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T20:14:47Z","timestamp":1280261687000},"page":"23-38","source":"Crossref","is-referenced-by-count":12,"title":["State Caching Reconsidered"],"prefix":"10.1007","author":[{"given":"Jaco","family":"Geldenhuys","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-45069-6_40","volume-title":"Computer Aided Verification","author":"G. Berhmann","year":"2003","unstructured":"Berhmann, 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":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-44804-7_7","volume-title":"Process Algebra and Probabilistic Methods. Performance Modelling and Verification","author":"L. Brim","year":"2001","unstructured":"Brim, L., \u010cern\u00e1, I., Ne\u010desal, M.: Randomization helps in LTL model checking. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol.\u00a02165, pp. 105\u2013119. Springer, Heidelberg (2001)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45139-0_5","volume-title":"Model Checking Software","author":"S. Edelkamp","year":"2001","unstructured":"Edelkamp, S., Lafuente, A.L., Leue, S.: Directed explicit model checking with HSFSpin. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 57\u201379. Springer, Heidelberg (2001)"},{"key":"3_CR5","unstructured":"Geldenhuys, J.: Efficiency Issues in the Design of a Model Checker. Master\u2019s thesis, University of Stellenbosch (1999)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BFb0023731","volume-title":"Computer-Aided Verification","author":"P. Godefroid","year":"1990","unstructured":"Godefroid, P.: Using partial orders to improve automatic verification methods. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol.\u00a0531, pp. 176\u2013185. Springer, Heidelberg (1990)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","first-page":"175","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"1992","unstructured":"Godefroid, P., Holzmann, G.J., Pirottin, D.: State space caching revisited. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 175\u2013186. Springer, Heidelberg (1992); Also appeared in Formal Methods in System Design 7(3), 227\u2013241 (1995), http:\/\/www.montefiore.ulg.ac.be\/services\/verif\/po-pack.html"},{"key":"#cr-split#-3_CR8.1","unstructured":"Godefroid, P.: Partial-order Methods for the Verification of Concurrent Systems, An Approach to the State-explosion Problem. PhD thesis, University of Li\u00e8ge (December 1994);"},{"key":"#cr-split#-3_CR8.2","unstructured":"Also published as LNCS #1032, Springer-Verlag (1996)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: On the costs and benefits of using partial-order methods for the verification of concurrent systems. In: Proc. Workshop on Partial Order Methods in Verification. DIMACS Series, vol.\u00a029, pp. 289\u2013303 (1996)","DOI":"10.1090\/dimacs\/029\/16"},{"issue":"10","key":"3_CR10","doi-asserted-by":"crossref","first-page":"2413","DOI":"10.1002\/j.1538-7305.1985.tb00010.x","volume":"64","author":"G.J. Holzmann","year":"1985","unstructured":"Holzmann, G.J.: Tracing protocols. AT&T Technical J.\u00a064(10), 2413\u20132433 (1985)","journal-title":"AT&T Technical J."},{"issue":"6","key":"3_CR11","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/TSE.1987.233206","volume":"13","author":"G.J. Holzmann","year":"1987","unstructured":"Holzmann, G.J.: Automated protocol validation in Argos, assertion proving and scatter searching. IEEE Trans. on Software Engineering\u00a013(6), 683\u2013696 (1987)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"3_CR12","volume-title":"Design and Validation of Computer Protocols","author":"G.J. Holzmann","year":"1991","unstructured":"Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs (1991)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","first-page":"275","volume-title":"Automatic Verification Methods for Finite State Systems","author":"C. Jard","year":"1990","unstructured":"Jard, C., J\u00e9ron, T.: On-line model checking for finite linear temporal logic specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 275\u2013285. Springer, Heidelberg (1990)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","first-page":"192","volume-title":"Computer Aided Verification","author":"C. Jard","year":"1991","unstructured":"Jard, C., J\u00e9ron, T.: Bounded memory algorithm for verification on-the-fly. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 192\u2013202. Springer, Heidelberg (1991)"},{"key":"3_CR15","unstructured":"Jard, C., J\u00e9ron, T., Fernandez, J.-C., Mounier, L.: On-the-fly Verification of Finite Transition Systems. Tech. rep. #701, IRISA (1993)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. on Modeling and Computer Simulation\u00a08(1), 3\u201330 (1998), http:\/\/www.math.keio.ac.jp\/~matumoto\/emt.html","journal-title":"ACM Trans. on Modeling and Computer Simulation"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0035380","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A.N. Parashkevov","year":"1997","unstructured":"Parashkevov, A.N., Yantchev, J.T.: Space efficient reachability analysis through use of pseudo-root states. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 50\u201364. Springer, Heidelberg (1997)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: On model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"3_CR19","unstructured":"Stern, U., Dill, D.L.: Combining state space caching and hash compaction. In: Methoden des Entwurfs und der Verifikation digitaler Systeme, 4. GI\/ITG\/GME Workshop, pp. 81\u201390 (1996)"},{"key":"3_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to Distributed Algorithms","author":"G. Tel","year":"2000","unstructured":"Tel, G.: Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"Valmari, A.: A stubborn attack on state explosion. Formal Methods in System Design\u00a01(1), 297\u2013322 (1992)","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24732-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:29:52Z","timestamp":1559316592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24732-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213147","9783540247326"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24732-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}