{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:23:00Z","timestamp":1725560580166},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213772"},{"type":"electronic","value":"9783540247562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24756-2_14","type":"book-chapter","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T20:18:31Z","timestamp":1280261911000},"page":"247-266","source":"Crossref","is-referenced-by-count":0,"title":["Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption"],"prefix":"10.1007","author":[{"given":"Xu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. S.","family":"Lazi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Lazic, R.S., Roscoe, A.: Data independence with generalised predicate symbols. In: International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, USA, vol.\u00a0I, pp. 319\u2013325. CSREA (1999)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Parrow, J.: Deciding bisimulation equivalences for a class of nonfinite- state programs. In: Symposium on Theoretical Aspects of Computer Science, pp. 421\u2013433 (1989)","DOI":"10.1007\/BFb0029004"},{"key":"14_CR3","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"},{"key":"14_CR4","unstructured":"Lazi\u0107, R.: A Semantic Study of Data Independence with Applications to Model Checking. PhD thesis, Oxford University Computing Laboratory (1999)"},{"key":"14_CR5","unstructured":"Lazi\u0107, R., Newcomb, T., Roscoe, A.: On model checking data-independent systems with arrays without reset. Technical Report RR-02-02, Oxford University Computing Laboratory (2002), To appear in the Journal of Theory and Practice of Logic Programming."},{"key":"14_CR6","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. Lazi\u0107","year":"2000","unstructured":"Lazi\u0107, R., Nowak, D.: A unifying approach to data independence. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 581\u2013595. Springer, Heidelberg (2000)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Typed Lambda Calculi and Applications","author":"R. Lazi\u0107","year":"2003","unstructured":"Lazi\u0107, R., Nowak, D.: On a semantic definition of data independence. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, Springer, Heidelberg (2003)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(00)00103-1","volume":"256","author":"Y. Kesten","year":"2001","unstructured":"Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic model checking with rich assertional languages. Theoretical Computer Science\u00a0256, 93\u2013112 (2001)","journal-title":"Theoretical Computer Science"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. Theoretical Computer Science\u00a0138, 353\u2013389 (1995)","journal-title":"Theoretical Computer Science"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-61604-7_47","volume-title":"CONCUR \u201996: Concurrency Theory","author":"H. Lin","year":"1996","unstructured":"Lin, H.: Symbolic transition graph with assignment. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 50\u201365. Springer, Heidelberg (1996)"},{"key":"14_CR11","unstructured":"Roscoe, A., Lazi\u0107, R.: What can you decide about resetable arrays ?(preliminary version). In: Proceedings of the 2nd International Workshop on Verification and Computational Logic, Technical Report, Department of Electronics and Computer Science, University of Southampton, UK (2001)"},{"key":"14_CR12","unstructured":"Newcomb, T.: Model Checking Data-Independent Systems With Arrays. PhD thesis, Oxford University Computing Laboratory (2003) (to appear)"},{"key":"14_CR13","volume-title":"The Theory and Practice of Concurrency","author":"A. Roscoe","year":"1998","unstructured":"Roscoe, A.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"14_CR14","unstructured":"Formal Systems (Europe) Ltd: Failures-Divergence Refinement: FDR2 User Manual (1999), http:\/\/www.formal.demon.co.uk"},{"key":"14_CR15","first-page":"353","volume-title":"A Classical Mind: Essays in Honour of C.A.R.","author":"A.W. Roscoe","year":"1994","unstructured":"Roscoe, A.W.: Model-checking CSP. In: Roscoe, A.W. (ed.) A Classical Mind: Essays in Honour of C.A.R., Hoare, pp. 353\u2013378. Prentice Hall, Englewood Cliffs (1994)"},{"key":"14_CR16","unstructured":"Wang, X., Roscoe, A., Lazi\u0107, R.: Translating CSP trace refinement to Unity unreachability: a study in data independence. Technical Report RR-03-08, Oxford University Computing Laboratory (2003)"},{"key":"14_CR17","unstructured":"Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of the 1st Annual IEEE Symposium on Logic in Computer Science, Washington, DC, pp. 332\u2013344 (1986)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"Lectures on Petri Nets I: Basic Models","author":"A. Valmari","year":"1998","unstructured":"Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 429\u2013528. Springer, Heidelberg (1998)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.: Computer-aided verification: An introduction to model building and model checking for concurrent systems. Draft (1999)","DOI":"10.1007\/BFb0028774"},{"key":"14_CR20","volume-title":"Communicating and Mobile Systems: the \u03c0-calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-calculus. Cambridge University Press, Cambridge (1999)"},{"key":"14_CR21","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"14_CR22","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, 63\u201392 (2001)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24756-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:33:16Z","timestamp":1559316796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24756-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213772","9783540247562"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24756-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}