{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:55Z","timestamp":1725559195709},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258131"},{"type":"electronic","value":"9783540322658"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11423348_17","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T06:36:01Z","timestamp":1279089361000},"page":"275-291","source":"Crossref","is-referenced-by-count":4,"title":["On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations"],"prefix":"10.1007","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Newcomb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"17_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"S. Adve","year":"1996","unstructured":"Adve, S., Gharachorloo, K.: Shared memory consistency models: a tutorial. Computer\u00a029(12), 66\u201376 (1996)","journal-title":"Computer"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Broadfoot, P.J., Lowe, G., Roscoe, A.W.: Automating data independence. In: Proceedings of the 6th European Symposium on Research on Computer Security, pp. 75\u2013190 (2000)","DOI":"10.1007\/10722599_11"},{"key":"17_CR3","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 Publishing Company, Inc, Reading (1988)"},{"key":"17_CR4","unstructured":"Creese, S.J., Roscoe, A.W.: Data independent induction over structured networks. In: International Conference on Parallel and Distributed Processing Techniques and Applications, June 2000. CSREA Press (2000)"},{"key":"17_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139171496","volume-title":"Computability: An Introduction to Recursive Function Theory","author":"N. Cutland","year":"1980","unstructured":"Cutland, N.: Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge (1980)"},{"key":"17_CR6","first-page":"352","volume-title":"Proceedings of the 14th IEEE Symposium on Logic in Computer Science","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: Proceedings of the 14th IEEE Symposium on Logic in Computer Science, pp. 352\u2013359. IEEE Comp. Soc. Press, Los Alamitos (1999)"},{"issue":"1\u20132","key":"17_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1\u20132), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-60045-0_43","volume-title":"Computer Aided Verification","author":"R. Hojati","year":"1995","unstructured":"Hojati, R., Brayton, R.K.: Automatic datapath abstraction in hardware systems. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 98\u2013113. Springer, Heidelberg (1995)"},{"key":"17_CR9","unstructured":"Hojati, R., Isles, A.J., Brayton, R.K.: Automatic state reduction techniques for hardware systems modelled using uninterpreted functions and infinite memory. In: Proceedings of the IEEE International High Level Design Validation and Test Workshop (November 1997)"},{"key":"17_CR10","unstructured":"Lazi\u0107, R.S.: A Semantic Study of Data Independence with Applications to Model Checking. PhD thesis, Oxford University Computing Laboratory (1999)"},{"issue":"5\u20136","key":"17_CR11","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1017\/S1471068404002054","volume":"4","author":"R.S. Lazi\u0107","year":"2004","unstructured":"Lazi\u0107, R.S., Newcomb, T.C., Roscoe, A.W.: On model checking data-independent systems with arrays without reset. Theory and Practice of Logic Programming\u00a04(5\u20136), 659\u2013693 (2004)","journal-title":"Theory and Practice of Logic Programming"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-44618-4_41","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R.S. Lazi\u0107","year":"2000","unstructured":"Lazi\u0107, R.S., Nowak, D.: A unifying approach to data independence. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 581\u2013595. Springer, Heidelberg (2000)"},{"key":"17_CR13","first-page":"283","volume":"47","author":"I.A. Lomazova","year":"2001","unstructured":"Lomazova, I.A.: Nested petri nets: Multi-level and recursive systems. Fundamenta Informaticae\u00a047, 283\u2013294 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Verification of infinite state systems by compositional model checking. In: Conference on Correct Hardware Design and Verification Methods, pp. 219\u2013234 (1999)","DOI":"10.1007\/3-540-48153-2_17"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36126-X_1","volume-title":"Formal Methods in Computer-Aided Design","author":"T. Melham","year":"2002","unstructured":"Melham, T., Jones, R.: Abstraction by symbolic indexing transformations. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.\u00a02517. Springer, Heidelberg (2002)"},{"key":"17_CR16","unstructured":"Newcomb, T.C.: Model Checking Data-Independent Systems With Arrays. PhD thesis, Oxford University Computing Laboratory (2003)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Wolper, P.: Expressing interesting properties of programs in propositional temporal logic. In: Proceedings of the 13th ACM Symposium on Principles of Programming Languages, pp. 184\u2013193 (1986)","DOI":"10.1145\/512644.512661"}],"container-title":["Lecture Notes in Computer Science","Communicating Sequential Processes. The First 25 Years"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11423348_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:12:06Z","timestamp":1558296726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11423348_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258131","9783540322658"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11423348_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}