{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:55:43Z","timestamp":1725551743898},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297970"},{"type":"electronic","value":"9783540322504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11576280_26","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T14:01:26Z","timestamp":1130162486000},"page":"375-389","source":"Crossref","is-referenced-by-count":1,"title":["A Static Communication Elimination Algorithm for Distributed System Verification"],"prefix":"10.1007","author":[{"given":"Francesc","family":"Babot","sequence":"first","affiliation":[]},{"given":"Miquel","family":"Bertran","sequence":"additional","affiliation":[]},{"given":"August","family":"Climent","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"INMOS-Limited: Occam Programming Manual. Prentice Hall, Englewood Cliffs (1985)"},{"key":"26_CR2","unstructured":"INMOS-Limited: Occam 2 Reference Manual. Prentice Hall, Englewood Cliffs (1988)"},{"key":"26_CR3","volume-title":"Programming in Occam","author":"G. Jones","year":"1987","unstructured":"Jones, G.: Programming in Occam. Prentice Hall, Englewood Cliffs (1987)"},{"key":"26_CR4","volume-title":"The Temporal Logic of Reactive and Concurrent Systems. Specification","author":"Z. Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems. Specification. Springer, Heidelberg (1991)"},{"key":"26_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems. Safety","author":"Z. Manna","year":"1995","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems. Safety. Springer, Heidelberg (1995)"},{"key":"26_CR6","volume-title":"Design and Validation of Computer Protocols","author":"G. Holtzmann","year":"1991","unstructured":"Holtzmann, G.: Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs (1991)"},{"key":"26_CR7","volume-title":"Concurrency Verification: Introduction to Compositonal and Noncompositional Methods","author":"W.P. Roever de","year":"2001","unstructured":"de Roever, W.P., de Boer, F., Hanneman, U., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositonal and Noncompositional Methods. Cambridge University Press, Cambridge (2001)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/B:FORM.0000033963.55470.9e","volume":"25","author":"K. Yorav","year":"2004","unstructured":"Yorav, K., Grumberg, O.: Static Analysis for State-space Reductions. Formal Methods in System Design\u00a025, 67\u201396 (2004)","journal-title":"Formal Methods in System Design"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BFb0054182","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Kurshan","year":"1998","unstructured":"Kurshan, R., Levin, V., Minea, M., Peled, D., Yenigun, H.: Static Partial Order Reduction. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 335\u2013357. Springer, Heidelberg (1998)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.: Model Cheking and Abstraction. ACM Transactions on Programming Languages and Systems\u00a016, 1512\u20131542 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-47764-0_2","volume-title":"Static Analysis","author":"M. Bertran","year":"2001","unstructured":"Bertran, M., Babot, F., Climent, A., Nicolau, M.: Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 20\u201339. Springer, Heidelberg (2001)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Bertran, M., Babot, F.X., Climent, A.: An Input\/output Semantics for Distributed Program Equivalence Reasoning. Electronic Notes in Theoretical Computer Science\u00a0137 (2005)","DOI":"10.1016\/j.entcs.2005.01.038"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/s002360050151","volume":"35","author":"N.D. Francesco","year":"1998","unstructured":"Francesco, N.D., Santone, A.: A Transformation System for Concurrent Processes. Acta Informatica\u00a035, 1037\u20131073 (1998)","journal-title":"Acta Informatica"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002360050153","volume":"36","author":"M. Schenke","year":"1999","unstructured":"Schenke, M., Olderog, E.R.: Transformation Design for Real-Time Systems. part i: From Requirements to Program Specifications. Acta Informatica\u00a036, 1\u201365 (1999)","journal-title":"Acta Informatica"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s002360050154","volume":"36","author":"M. Schenke","year":"1999","unstructured":"Schenke, M.: Transformation Design for Real-Time Systems. part ii: From Program Specifications to Programs. Acta Informatica\u00a036, 67\u201396 (1999)","journal-title":"Acta Informatica"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(88)90049-7","volume":"60","author":"A. Roscoe","year":"1988","unstructured":"Roscoe, A., Hoare, C.: The laws of OCCAM programming. Theoretical Computer Science\u00a060, 177\u2013229 (1988)","journal-title":"Theoretical Computer Science"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T. Elrad","year":"1982","unstructured":"Elrad, T., Francez, N.: Decomposition of Distributed Programs into Communication Closed Layers. Science of Computer Programming\u00a02, 155\u2013173 (1982)","journal-title":"Science of Computer Programming"},{"key":"26_CR18","unstructured":"Babot, F., Bertran, M., Riera, J., Puig, R., Climent, A.: Mechanized Equivalence Proofs of Pipelined Processor Software Models. In: Actas de las III Jornadas de Programaci\u00f3n y Lenguajes, Alicante, Universitat d\u2019Alacant, 91\u2013104 (2003)"},{"key":"26_CR19","unstructured":"Babot, F.X.: Contributions to Communication Elimination Proofs for Distributed Program Simplification. Ph.d. dissertation, Escola T\u00e8cnica Superior d\u2019Enginyeria Electr\u00f2nica i Inform\u00e0tica La Salle, Universitat Ramon Llull (2005)"},{"key":"26_CR20","volume-title":"Computer Architecture: A Quantitative Approach","author":"J.L. Hennessy","year":"1990","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers Inc., San Mateo (1990)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11576280_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:44:20Z","timestamp":1619505860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11576280_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297970","9783540322504"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11576280_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}