{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:57Z","timestamp":1725493497842},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403326"},{"type":"electronic","value":"9783540449041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44904-3_16","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T05:49:32Z","timestamp":1193550572000},"page":"226-240","source":"Crossref","is-referenced-by-count":2,"title":["On a Semantic Definition of Data Independence"],"prefix":"10.1007","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Nowak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)00283-O","volume":"146","author":"M. Alimohamed","year":"1995","unstructured":"M. Alimohamed. A characterization of lambda definability in categorical models of implicit polymorphism. Theoretical Computer Science, 146:5\u201323, 1995.","journal-title":"Theoretical Computer Science"},{"key":"16_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-540-49382-2_27","volume-title":"Foundations of Software Technology and Theoretical Computer Science (FST&TCS\u201998)","author":"J. Bohn","year":"1998","unstructured":"J. Bohn, W. Damm, O. Grumberg, H. Hungar, and K. Laster. First-order-CTL model checking. In Foundations of Software Technology and Theoretical Computer Science (FST&TCS\u201998), volume 1530 of Lecture Notes in Computer Science, pages 283\u2013294. Springer-Verlag, 1998."},{"key":"16_CR3","unstructured":"M. Calder and C. Shankland. A symbolic semantics and bisimulation for full LOTOS. In International Conference on Formal Description Techniques for Networked and Distributed Systems (FORTE\u201901), pages 184\u2013200. Kluwer Academic Publishers, 2001."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"16_CR5","unstructured":"E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"D. Dill, R. Hojati, and R.K. Brayton. Verifying linear temporal properties of data intensive controllers using finite instantiations. In Hardware Description Languages and their Applications (CHDL\u2019 97). Chapman and Hall, 1997.","DOI":"10.1007\/978-0-387-35064-6_5"},{"key":"16_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-48959-2_12","volume-title":"Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA\u201999)","author":"M. Fiore","year":"1999","unstructured":"M. Fiore and A. Simpson. Lambda definability with sums via Grothendieck logical relations. In Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA\u201999), volume 1581 of Lecture Notes in Computer Science, pages 147\u2013161. Springer-Verlag, 1999."},{"key":"16_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic (CSL\u201902)","author":"J. Goubault-Larrecq","year":"2002","unstructured":"J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical relations for monadic types. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic (CSL\u201902), volume 2471 of Lecture Notes in Computer Science, pages 553-568. Springer-Verlag, 2002."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138(2):353\u2013389, 1995.","journal-title":"Theoretical Computer Science"},{"issue":"1\/2","key":"16_CR10","first-page":"41","volume":"9","author":"C. N. Ip","year":"1996","unstructured":"C. N. Ip and D. L. Dill. Better verification through symmetry. Formal Methods in System Design: An International Journal, 9(1\/2):41\u201375, 1996.","journal-title":"Formal Methods in System Design: An International Journal"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0304-3975(98)00356-9","volume":"228","author":"A. Jeffrey","year":"1999","unstructured":"A. Jeffrey. A fully abstract semantics for a higher-order functional language with nondeterministic computation. Theoretical Computer Science, 228:105\u2013150, 1999.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/inco.1993.1069","volume":"107","author":"B. Jonsson","year":"1993","unstructured":"B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. Information and Computation, 107(2):272\u2013302, 1993.","journal-title":"Information and Computation"},{"key":"16_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BFb0037110","volume-title":"Proceedings of the 1st International Conference on Typed Lambda Calculi and Applications (TLCA\u201993)","author":"A. Jung","year":"1993","unstructured":"A. Jung and J. Tiuryn. A new characterization of lambda definability. In Proceedings of the 1st International Conference on Typed Lambda Calculi and Applications (TLCA\u201993), volume 664 of Lecture Notes in Computer Science, pages 245\u2013257. Springer-Verlag, 1993."},{"key":"16_CR14","unstructured":"R. Lazi\u0107. A Semantic Study of Data Independence with Applications to Model Checking. DPhil thesis, Oxford University Computing Laboratory, 1999."},{"key":"16_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-44618-4_41","volume-title":"Proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000)","author":"R. Lazi\u0107","year":"2000","unstructured":"R. Lazi\u0107 and D. Nowak. A unifying approach to data-independence. In Proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000), volume 1877 of Lecture Notes in Computer Science, pages 581\u2013595. Springer-Verlag, 2000."},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"R. Lazi\u0107 and D. Nowak. On a semantic definition of data independence. Research report 392, Department of Computer Science, University of Warwick, 2003. http:\/\/www.dcs.warwick.ac.uk .","DOI":"10.1007\/3-540-44904-3_16"},{"issue":"6","key":"16_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/BF00263649","volume":"22","author":"T. Nipkow","year":"1986","unstructured":"T. Nipkow. Non-deterministic data types: models and implementations. Acta Informatica, 22(6):629\u2013661, 1986.","journal-title":"Acta Informatica"},{"key":"16_CR18","unstructured":"G. D. Plotkin. Lambda-definability in the full type hierarchy. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 363\u2013373. Academic Press, 1980."},{"key":"16_CR19","unstructured":"S. Qadeer. Verifying sequential consistency on shared-memory multiprocessors by model checking. Research Report 176, Compaq, 2001."},{"key":"16_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-60045-0_43","volume-title":"Proceedings of the 7th International Conference On Computer Aided Verification","author":"R. Hojati","year":"1995","unstructured":"R. Hojati and R. K. Brayton. Automatic datapath abstraction in hardware systems. In Proceedings of the 7th International Conference On Computer Aided Verification, volume 939 of Lecture Notes in Computer Science, pages 98\u2013113. Springer Verlag, 1995."},{"key":"16_CR21","unstructured":"J. C. Reynolds. Types, abstraction and parametric polymorphism. In Proceedings of the 9th IFIP World Computer Congress (IFIP\u201983), pages 513\u2013523. North-Holland, 1983."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"A. W. Roscoe and P. J. Broadfoot. Proving security protocols with model checkers by data independence techniques. Journal of Computer Security, Special Issue on the 11th IEEE Computer Security Foundations Workshop (CSFW11), pages 147\u2013190, 1999.","DOI":"10.3233\/JCS-1999-72-303"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Conference Record of the 13th Annual ACM Symposium on Principles of Programming Languages, pages 184\u2013193. ACM, 1986.","DOI":"10.1145\/512644.512661"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44904-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:27:41Z","timestamp":1556936861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44904-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403326","9783540449041"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44904-3_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}