{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:41:29Z","timestamp":1758127289941},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642380877"},{"type":"electronic","value":"9783642380884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38088-4_3","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T20:38:27Z","timestamp":1368045507000},"page":"32-47","source":"Crossref","is-referenced-by-count":8,"title":["Improved on-the-Fly Livelock Detection"],"prefix":"10.1007","author":[{"given":"Alfons","family":"Laarman","sequence":"first","affiliation":[]},{"given":"David","family":"Farag\u00f3","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press (2008)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Barnat, J., Brim, L., Rockai, P.: Parallel Partial Order Reduction with Topological Sort Proviso. In: SEFM, pp. 222\u2013231. IEEE Computer Society (2010)","DOI":"10.1109\/SEFM.2010.35"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-10373-5_21","volume-title":"Formal Methods and Software Engineering","author":"J. Barnat","year":"2009","unstructured":"Barnat, J., Brim, L., Ro\u010dkai, P.: A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol.\u00a05885, pp. 407\u2013425. Springer, Heidelberg (2009)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Barnat, J., Havl\u00ed\u010dek, J., Ro\u010dkai, P.: Distributed LTL Model Checking with Hash Compaction. In: PASM\/PDMC. ENTCS. Elsevier (2012)","DOI":"10.1016\/j.entcs.2013.07.006"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"van der Berg, F., Laarman, A.: SpinS: Extending LTSmin with Promela through SpinJa. In: PASM\/PDMC. ENTCS. Elsevier (2012)","DOI":"10.1016\/j.entcs.2013.07.007"},{"issue":"2","key":"3_CR6","first-page":"275","volume":"1","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Vardi, M., Wolper, P., Yannakakis, M.: Memory-Efficient Algorithms for the Verification of Temporal Properties. FMSD\u00a01(2), 275\u2013288 (1992)","journal-title":"FMSD"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-33365-1_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A.E. Dalsgaard","year":"2012","unstructured":"Dalsgaard, A.E., Laarman, A., Larsen, K.G., Olesen, M.C., van de Pol, J.: Multi-Core Reachability for Timed Automata. In: Jurdzi\u0144ski, M., Ni\u010dkovi\u0107, D. (eds.) FORMATS 2012. LNCS, vol.\u00a07595, pp. 91\u2013106. Springer, Heidelberg (2012)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-33386-6_22","volume-title":"Automated Technology for Verification and Analysis","author":"S. Evangelista","year":"2012","unstructured":"Evangelista, S., Laarman, A., Petrucci, L., van de Pol, J.: Improved multi-core nested depth-first search. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol.\u00a07561, pp. 269\u2013283. Springer, Heidelberg (2012)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10009-010-0137-y","volume":"12","author":"S. Evangelista","year":"2010","unstructured":"Evangelista, S., Pajault, C.: Solving the Ignoring Problem for Partial Order Reduction. STTF\u00a012, 155\u2013170 (2010)","journal-title":"STTF"},{"key":"3_CR10","unstructured":"Farag\u00f3, D.: Model Checking of Randomized Leader Election Algorithms. Master\u2019s thesis, Universit\u00e4t Karlsruhe (2007)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-02652-2_8","volume-title":"Model Checking Software","author":"D. Farag\u00f3","year":"2009","unstructured":"Farag\u00f3, D., Schmitt, P.H.: Improving Non-Progress Cycle Checks. In: P\u0103s\u0103reanu, C.S. (ed.) SPIN 2009. LNCS, vol.\u00a05578, pp. 50\u201367. Springer, Heidelberg (2009)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Holzmann, G.: The spin Model Checker: Primer&Ref. Man. Addison-Wesley (2011)","DOI":"10.1007\/978-3-642-31759-0_12"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-31759-0_12","volume-title":"Model Checking Software","author":"G.J. Holzmann","year":"2012","unstructured":"Holzmann, G.J.: Parallelizing the Spin Model Checker. In: Donaldson, A., Parker, D. (eds.) SPIN 2012. LNCS, vol.\u00a07385, pp. 155\u2013171. Springer, Heidelberg (2012)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Holzmann, G., Peled, D.: An Improvement in Formal Verification. In: Proceedings of the Formal Description Techniques, pp. 197\u2013211. Chapman & Hall (1994)","DOI":"10.1007\/978-0-387-34878-0_13"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Holzmann, G., Peled, D., Yannakakis, M.: On nested depth first search. In: SPIN, pp. 23\u201332. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/032\/03"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0013032","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"S. Katz","year":"1989","unstructured":"Katz, S., Peled, D.: An Efficient Verification Method for Parallel and Distributed Programs. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 489\u2013507. Springer, Heidelberg (1989)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-24372-1_23","volume-title":"Automated Technology for Verification and Analysis","author":"A. Laarman","year":"2011","unstructured":"Laarman, A., Langerak, R., van de Pol, J., Weber, M., Wijs, A.: Multi-Core nested depth-first search. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 321\u2013335. Springer, Heidelberg (2011)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-22306-8_4","volume-title":"Model Checking Software","author":"A. Laarman","year":"2011","unstructured":"Laarman, A., van de Pol, J., Weber, M.: Parallel Recursive State Compression for Free. In: Groce, A., Musuvathi, M. (eds.) SPIN 2011. LNCS, vol.\u00a06823, pp. 38\u201356. Springer, Heidelberg (2011)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Laarman, A., van de Pol, J.: Variations on Multi-Core Nested Depth-First Search. In: PDMC. EPTCS, vol.\u00a072, pp. 13\u201328 (2011)","DOI":"10.4204\/EPTCS.72.2"},{"key":"3_CR20","unstructured":"Laarman, A., van de Pol, J., Weber, M.: Boosting Multi-Core Reachability Performance with Shared Hash Tables. In: FMCAD. IEEE Computer Society (2010)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-642-20398-5_40","volume-title":"NASA Formal Methods","author":"A. Laarman","year":"2011","unstructured":"Laarman, A., van de Pol, J., Weber, M.: Multi-Core LTSmin: Marrying Modularity and Scalability. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol.\u00a06617, pp. 506\u2013511. Springer, Heidelberg (2011)"},{"issue":"10","key":"3_CR22","first-page":"114","volume":"38","author":"G. Moore","year":"1965","unstructured":"Moore, G.: Cramming more Components onto Integrated Circuits. Electronics\u00a038(10), 114\u2013117 (1965)","journal-title":"Electronics"},{"key":"3_CR23","unstructured":"Pater, E.: Partial Order Reduction for PINS, Master\u2019s thesis. Uni. of Twente (2011)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-73370-6_17","volume-title":"Model Checking Software","author":"R. Pel\u00e1nek","year":"2007","unstructured":"Pel\u00e1nek, R.: BEEM: Benchmarks for Explicit Model Checkers. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol.\u00a04595, pp. 263\u2013267. Springer, Heidelberg (2007)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-33386-6_23","volume-title":"Automated Technology for Verification and Analysis","author":"R.T. Saad","year":"2012","unstructured":"Saad, R.T., Dal Zilio, S., Berthomieu, B.: An experiment on parallel model checking of a CTL fragment. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol.\u00a07561, pp. 284\u2013299. Springer, Heidelberg (2012)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn Sets for Reduced State Space Generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483, pp. 491\u2013515. Springer, Heidelberg (1991)"},{"key":"3_CR27","unstructured":"Vardi, M., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: LICS, pp. 332\u2013344 (1986)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38088-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:38:45Z","timestamp":1557689925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38088-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380877","9783642380884"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38088-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}