{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:34:02Z","timestamp":1725539642606},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642051173"},{"type":"electronic","value":"9783642051180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05118-0_4","type":"book-chapter","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T02:32:03Z","timestamp":1257301923000},"page":"47-61","source":"Crossref","is-referenced-by-count":10,"title":["Multicore Constraint-Based Automated Stabilization"],"prefix":"10.1007","author":[{"given":"Fuad","family":"Abujarad","sequence":"first","affiliation":[]},{"given":"Sandeep S.","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a017(3), 507\u2013535 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-642-05118-0_4","volume-title":"SSS 2009","author":"F. Abujarad","year":"2009","unstructured":"Abujarad, F., Kulkarni, S.S.: Multicore constraint-based automated stabilization. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol.\u00a05873, pp. 47\u201361. Springer, Heidelberg (2009)"},{"key":"4_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-540-32275-7_14","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"B. Aminof","year":"2005","unstructured":"Aminof, B., Ball, T., Kupferman, O.: Reasoning about systems with transition fairness. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 194\u2013208. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Arora, A., Attie, P.C., Emerson, E.A.: Synthesis of fault-tolerant concurrent programs. In: Principles of Distributed Computing (PODC), pp. 173\u2013182 (1998)","key":"4_CR4","DOI":"10.1145\/277697.277729"},{"issue":"11","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1109\/32.256850","volume":"19","author":"A. Arora","year":"1993","unstructured":"Arora, A., Gouda, M.G.: Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering\u00a019(11), 1015\u20131027 (1993)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"4_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.3233\/JHS-1996-5305","volume":"5","author":"A. Arora","year":"1996","unstructured":"Arora, A., Gouda, M.G., Varghese, G.: Constraint satisfaction as a basis for designing nonmasking fault-tolerant systems. Journal of High Speed Networks\u00a05(3), 293\u2013306 (1996)","journal-title":"Journal of High Speed Networks"},{"doi-asserted-by":"crossref","unstructured":"Arora, A., Kulkarni, S.S.: Designing masking fault-tolerance via nonmasking fault-tolerance. In: Proceedings of the Fourteenth Symposium on Reliable Distributed Systems, Bad Neuenahr, vol.\u00a014, pp. 174\u2013185 (1995)","key":"4_CR7","DOI":"10.1109\/RELDIS.1995.526225"},{"unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Sycraft: A tool for automated synthesis of fault-tolerant distributed programs. In: International Conference on Concurrency Theory (2008)","key":"4_CR8"},{"key":"4_CR9","volume-title":"Parallel program design: a foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel program design: a foundation. Addison-Wesley Longman Publishing Co., Inc., Boston (1988)"},{"unstructured":"Emerson, E.A., Lei, C.L.: Temporal model checking under generalized fairness constraints. In: Proc. 18th Hawaii International Conference on System Sciences, pp. 277\u2013288 (1985)","key":"4_CR10"},{"unstructured":"Ezekiel, J., L\u00fcttgen, G.: Measuring and evaluating parallel state-space exploration algorithms. In: International Workshop on Parallel and Distributed Methods in Verification, PDMC (2007)","key":"4_CR11"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-73368-3_31","volume-title":"Computer Aided Verification","author":"J. Ezekiel","year":"2007","unstructured":"Ezekiel, J., L\u00fcttgen, G., Ciardo, G.: Parallelising symbolic state-space generators. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 268\u2013280. Springer, Heidelberg (2007)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-70952-7_23","volume-title":"Formal Methods: Applications and Technology","author":"J. Ezekiel","year":"2007","unstructured":"Ezekiel, J., L\u00fcttgen, G., Siminiceanu, R.I.: Can Saturation be parallelised? on the parallelisation of a symbolic state-space generator. In: Brim, L., Haverkort, B.R., Leucker, M., van de Pol, J. (eds.) FMICS 2006 and PDMC 2006. LNCS, vol.\u00a04346, pp. 331\u2013346. Springer, Heidelberg (2007)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/11560548_12","volume-title":"Correct Hardware Design and Verification Methods","author":"O. Grumberg","year":"2005","unstructured":"Grumberg, O., Heyman, T., Ifergan, N., Schuster, A.: Achieving speedups in distributed symbolic reachability analysis through asynchronous computation. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol.\u00a03725, pp. 129\u2013145. Springer, Heidelberg (2005)"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10703-006-0011-4","volume":"29","author":"O. Grumberg","year":"2006","unstructured":"Grumberg, O., Heyman, T., Schuster, A.: A work-efficient distributed algorithm for reachability analysis. Formal Methods in System Design (FMSD)\u00a029(2), 157\u2013175 (2006)","journal-title":"Formal Methods in System Design (FMSD)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02278852","volume":"7","author":"S. Katz","year":"1993","unstructured":"Katz, S., Perry, K.: Self-stabilizing extensions for message passing systems. Distributed Computing\u00a07, 17\u201326 (1993)","journal-title":"Distributed Computing"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/15501320500330760","volume":"2","author":"S.S. Kulkarni","year":"2006","unstructured":"Kulkarni, S.S., Arumugam, M.: Infuse: A TDMA based data dissemination protocol for sensor networks. International Journal of Distributed Sensor Networks\u00a02(1), 55\u201378 (2006)","journal-title":"International Journal of Distributed Sensor Networks"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/3-540-49519-3_32","volume-title":"Formal Methods in Computer-Aided Design","author":"K. Milvang-Jensen","year":"1998","unstructured":"Milvang-Jensen, K., Hu, A.J.: BDDNOW: A parallel BDD package. In: Gopalakrishnan, G.C., Windley, P. (eds.) FMCAD 1998. LNCS, vol.\u00a01522, pp. 501\u2013507. Springer, Heidelberg (1998)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A tree based algorithm for mutual exclusion. ACM Transactions on Computer Systems\u00a07, 61\u201377 (1989)","journal-title":"ACM Transactions on Computer Systems"},{"unstructured":"Somenzi, F.: CUDD: Colorado University Decision Diagram Package, http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/cuddIntro.html","key":"4_CR20"},{"doi-asserted-by":"crossref","unstructured":"Stornetta, T., Brewer, F.: Implementation of an efficient parallel BDD package. In: Design automation (DAC), pp. 641\u2013644 (1996)","key":"4_CR21","DOI":"10.1145\/240518.240639"},{"doi-asserted-by":"crossref","unstructured":"Theel, O., Gartner, F.C.: An exercise in proving convergence through transfer functions. In: Proc. 4th Workshop on Self-stabilizing Systems, Austin, Texas, pp. 41\u201347 (1999)","key":"4_CR22","DOI":"10.1109\/SLFSTB.1999.777485"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05118-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:47:53Z","timestamp":1606168073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05118-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642051173","9783642051180"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05118-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}