{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:35:17Z","timestamp":1759336517917,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":64,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428961"},{"type":"electronic","value":"9783540456087"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45608-2_6","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:56:42Z","timestamp":1184605002000},"page":"331-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":96,"title":["Classification of Security Properties"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Focardi","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Gorrieri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/324133.324266","volume":"46","author":"M. Abadi","year":"1999","unstructured":"M. Abadi. \u201cSecrecy by Typing in Security Protocols\u201d. Journal of ACM, 46(5):749\u2013786, 1999. 331","journal-title":"Journal of ACM"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1\u201370, 1999. 331, 392","journal-title":"Information and Computation"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"A. Aldini. \u201cProbabilistic Information Flow in a Process Algebra\u201d. To appear in proceedings of CONCUR\u201901, 2001. 391","DOI":"10.1007\/3-540-44685-0_11"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"P. G. Allen. \u201cA Comparison of Non-Interference and Non-Deducibility using CSP\u201d. In Proceedings of the Fourth IEEE Computer Security Foundations Workshop, pages 43\u201354, Franconia, New Hampshire, June 1991. 368","DOI":"10.1109\/CSFW.1991.151568"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"D. E. Bell and L. J. La Padula. \u201cSecure Computer Systems: Unified Exposition and Multics Interpretation\u201d. ESD-TR-75-306, MITRE MTR-2997, March 1976.332.","DOI":"10.21236\/ADA023588"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"J. A. Bergstra and J. W. Klop. \u201cAlgebra of Communicating Processes with Abstraction\u201d. Theoretical Computer Science, 37:77\u2013121, 1985. 356","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.3233\/JCS-1992-1105","volume":"1","author":"P. Bieber","year":"1992","unstructured":"P. Bieber and F. Cuppens. \u201cA Logical View of Secure Dependencies\u201d. Journal of Computer Security, 1(1):99\u2013129, 1992. 333","journal-title":"Journal of Computer Security"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"C. Bodei, P. Degano, F. Nielson, and H. Riis Nielson. \u201cStatic Analysis of Processes for No Read-Up and No Write-Down\u201d. In proc. of 2nd FoSSaCS\u201999, Amsterdam, March 1999. Springer. 331","DOI":"10.1007\/3-540-49019-1_9"},{"issue":"3","key":"6_CR9","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. \u201cA Theory of Communicating Sequential Processes\u201d. Journal of the Association for Computing Machinery, 31(3):560\u2013599, July 1984. 340, 348, 353","journal-title":"Journal of the Association for Computing Machinery"},{"key":"6_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-15670-4_14","volume-title":"Proceedings of the Pittsburgh seminar on concurrency","author":"S.D. Brookes","year":"1985","unstructured":"S. D. Brookes and A. W. Roscoe. \u201cAn Improved Failures Model for Communicating Processes\u201d. In Proceedings of the Pittsburgh seminar on concurrency, pages 281\u2013305. Springer-Verlag, LNCS 197, 1985. 370, 375"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"C. Bodei, P. Degano, R. Focardi, and C. Priami. \u201cAuthentication via Localized Names\u201d. In Proceedings of CSFW\u201999, pages 98\u2013110. IEEE press, 1999. 331, 392","DOI":"10.1109\/CSFW.1999.779766"},{"key":"6_CR12","unstructured":"C. Bodei, P. Degano, R. Focardi, and C. Priami. \u201cPrimitives for Authentication in Process Algebras\u201d. Theoretical Computer Science, to appear, 2001. 331, 392"},{"key":"6_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"proceedings of FoSSaCS\u201998","author":"L. Cardelli","year":"1998","unstructured":"L. Cardelli and A. Gordon. \u201cMobile Ambients\u201d. In proceedings of FoSSaCS\u201998, pages 140\u2013155. Springer LNCS 1378, 1998. 392"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. \u201cThe Concurrency Workbench: a Semantics Based Tool for the Verification of Concurrent Systems\u201d. ACM Transactions on Programming Languages and Systems, Vol. 15 No. 1:36\u201372, January 1993. 334,377, 379, 380","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/363516.363532","volume":"9","author":"A. Durante","year":"2000","unstructured":"A. Durante, R. Focardi, and R. Gorrieri. \u201cA Compiler for Analysing Cryptographic Protocols Using Non-Interference\u201d. ACM Transactions on Software Engineering and Methodology, 9(4):489\u2013530, 2000. 392","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"6_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-45116-1_28","volume-title":"proceedings of Mathematical Methods, Models and Architectures for Computer Networks Security","author":"A. Durante","year":"2001","unstructured":"A. Durante, R. Focardi, and R. Gorrieri. \u201cCVS at Work: A Report on New Failures upon Some Cryptographic Protocols\u201d. In proceedings of Mathematical Methods, Models and Architectures for Computer Networks Security, pages 287\u2013299, St. Petersburg, Russia, May 2001. LNCS 2052. 392"},{"key":"6_CR17","unstructured":"N. Durgin, J. Mitchell, and D. Pavlovic. \u201cProtocol composition and correctness\u201d. In proceedings of Workshop on Issues in the Theory of Security (WITS\u2019 00), University of Geneva, July 2000. 331"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"R. Focardi. \u201cComparing Two Information Flow Security Properties\u201d. In Proceedings of Ninth IEEE Computer Security Foundation Workshop, (CSFW\u201996), (M. Merritt Ed.), pages 116\u2013122. IEEE press, June 1996. 348, 368","DOI":"10.1109\/CSFW.1996.503696"},{"key":"6_CR19","unstructured":"R. Focardi. \u201cLocated Entity Authentication\u201d. Technical Report CS98-5, University of Venice, 1998. 392"},{"key":"6_CR20","unstructured":"R. Focardi. \u201cUsing Entity Locations for the Analysis of Authentication Protocols\u201d. In Proceedings of Sixth Italian Conference on Theoretical Computer Science (ICTCS\u201998), November 1998. 392"},{"key":"6_CR21","unstructured":"R. Focardi. Analysis and Automatic Detection of Information Flows in Systems and Networks. PhD thesis, University of Bologna (Italy), 1999. 331, 348"},{"key":"6_CR22","unstructured":"R. Focardi and R. Gorrieri. \u201cAn Information Flow Security Property for CCS\u201d. In Proceedings of the Second North American Process Algebra Workshop (NAPAW\u2019 93), TR 93-1369, Cornell (Ithaca), August 1993. 348"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"R. Focardi and R. Gorrieri. \u201cA Taxonomy of Trace-based Security Properties for CCS \u201d. In Proceedings Seventh IEEE Computer Security Foundation Workshop, (CSFW\u201994), (Li Gong Ed.), pages 126\u2013136, Franconia (NH), June 1994. IEEE Press. 348,349.","DOI":"10.1109\/CSFW.1994.315941"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"R. Focardi and R. Gorrieri. \u201cA Classification of Security Properties for Process Algebras\u201d. Journal of Computer Security, 3(1):5\u201333, 1994\/1995. 333, 335, 348,362, 363, 376, 377","DOI":"10.3233\/JCS-1994\/1995-3103"},{"key":"6_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-61042-1_44","volume-title":"Proceedings of Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201996)","author":"R. Focardi","year":"1996","unstructured":"R. Focardi and R. Gorrieri. \u201cAutomatic Compositional Verification of Some Security Properties\u201d. In Proceedings of Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201996), pages167\u2013186, Passau (Germany), March 1996. Springer-Verlag, LNCS 1055. 377"},{"issue":"9","key":"6_CR26","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/32.629493","volume":"23","author":"R. Focardi","year":"1997","unstructured":"R. Focardi and R. Gorrieri. \u201cThe Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties\u201d. IEEE Transactions on Software Engineering, 23(9):550\u2013571, September 1997. 335, 348, 377","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR27","unstructured":"R. Focardi, R. Gorrieri, and F. Martinelli. \u201cClassification of Security Properties (Part II: Network Security)\u201d. Forthcoming. 392"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"R. Focardi, R. Gorrieri, and F. Martinelli. \u201cInformation Flow Analysis in a Discrete Time Process Algebra\u201d. In Proceedings of 13th IEEE Computer Security Foundations Workshop (CSFW13), (P. Syverson ed.), pages 170\u2013184. IEEE CS Press, July 2000. 391","DOI":"10.1109\/CSFW.2000.856935"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"R. Focardi, R. Gorrieri, and F. Martinelli. Message authentication through noninterference. In Proc. of 8th International Conference in Algebraic Methodology and Software Technology (AMAST), 2000. 392","DOI":"10.1007\/3-540-45499-3_20"},{"key":"6_CR30","series-title":"Lect Notes Comput Sci","first-page":"744","volume-title":"Proceedings of ICALP\u201900","author":"F. R","year":"2000","unstructured":"R. Focardi, R. Gorrieri, and F. Martinelli. \u201cNon Interference for the Analysis of Cryptographic Protocols\u201d. In Proceedings of ICALP\u201900, pages 744\u2013755. LNCS 1853, July 2000. 331, 392"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"R. Focardi, R. Gorrieri, and F. Martinelli. Secrecy in security protocols as noninterference. In Workshop on secure architectures and information flow, volume 32 of ENTCS, 2000. 392","DOI":"10.1016\/S1571-0661(04)00097-0"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"R. Focardi, R. Gorrieri, and V. Panini. \u201cThe Security Checker: a Semanticsbased Tool for the Verification of Security Properties\u201d. In Proceedings Eight IEEE Computer Security Foundation Workshop, (CSFW\u201995) (Li Gong Ed.), pages 60\u201369, Kenmare (Ireland), June 1995. IEEE Press. 377","DOI":"10.1109\/CSFW.1995.518553"},{"key":"6_CR33","unstructured":"R. Focardi, R. Gorrieri, and R. Segala. \u201cA New Definition of Multilevel Security\u201d. In proceedings of Workshop on Issues in the Theory of Security (WITS\u2019 00), University of Geneva, July 2000. 391"},{"key":"6_CR34","series-title":"Lect Notes Comput Sci","first-page":"794","volume-title":"Proceedings of World Congress on Formal Methods (FM\u201999)","author":"F. R","year":"1999","unstructured":"R. Focardi and F. Martinelli. \u201cA Uniform Approach for the Definition of Security Properties\u201d. In Proceedings of World Congress on Formal Methods (FM\u201999), pages 794\u2013813. Springer, LNCS 1708, 1999. 392"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"C. Fournet and M. Abadi. \u201cMobile Values, New Names, and Secure Communication\u201d. In Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL\u201901), pages 104\u2013115, January 2001. 392","DOI":"10.1145\/373243.360213"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"J. A. Goguen and J. Meseguer. \u201cSecurity Policy and Security Models\u201d. In Proceedings of the 1982 Symposium on Security and Privacy, pages 11\u201320. IEEE Computer Society Press, April 1982. 332, 333, 348","DOI":"10.1109\/SP.1982.10014"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"M. Hennessy and J. Riely. \u201cInformation Flow vs. Resource Access in the Asynchronous Pi-Calculus\u201d. In proceedings of ICALP, pages 415\u2013427, 2000. 392","DOI":"10.1007\/3-540-45022-X_35"},{"key":"6_CR38","unstructured":"Y. Hirshfeld. \u201cBisimulation Trees and the Decidability of Weak Bisimulations\u201c. Technical report, Tel Aviv University, 1996. 356"},{"key":"6_CR39","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985. 336,337, 368"},{"key":"6_CR40","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages and Computation., pages 22\u201324. Addison-Wesley, 1979. 381"},{"key":"6_CR41","unstructured":"D. M. Johnson and F. J. Thayer. \u201cSecurity and the Composition of Machines\u201d. In Proceedings of the Computer Security Foundations Workshop, pages 72\u201389, June 1988. 333, 376"},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. Kanellakis","year":"1990","unstructured":"P. Kanellakis and S. A. Smolka. \u201cCCS Expressions, Finite State Processes, and Three Problems of Equivalence\u201d. Information & Computation 86, pages 43\u201368, May 1990. 355, 380, 381","journal-title":"Information & Computation"},{"issue":"7","key":"6_CR43","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1145\/360248.360251","volume":"19","author":"R. Keller","year":"1976","unstructured":"R. Keller. \u201cFormal Verification of Parallel Programs\u201d. Communications of the ACM, 19 (7):561\u2013572, 1976. 333","journal-title":"Communications of the ACM"},{"key":"6_CR44","doi-asserted-by":"crossref","first-page":"53","DOI":"10.3233\/JCS-1998-61-204","volume":"6","author":"G. Lowe","year":"1998","unstructured":"G. Lowe. \u201cCasper: A Compiler for the Analysis of Security Protocols\u201d. Journal of Computer Security, 6:53\u201384, 1998. 331","journal-title":"Journal of Computer Security"},{"issue":"10","key":"6_CR45","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/32.637148","volume":"23","author":"G. Lowe","year":"1997","unstructured":"G. Lowe and B. Roscoe. \u201cUsing CSP to detect Errors in the TMN Protocol\u201d. IEEE Transactions on Software Engineering, 23(10):659\u2013669, 1997. 331","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"D. Marchignoli and F. Martinelli. Automatic verification of cryptographic protocols through compositional analysis techniques. In Proceedings of the International Conference on Tools and Algorithms for the Construction and the Analysis of Systems (TACAS), 1999. 392","DOI":"10.1007\/3-540-49059-0_11"},{"key":"6_CR47","unstructured":"F. Martinelli. \u201cPartial Model Checking and Theorem Proving for Ensuring Security Properties\u201d. In Proceedings of the 11th Computer Security Foundation Workshop, (CSFW\u201998). IEEE press, 1998. 361, 392"},{"key":"6_CR48","doi-asserted-by":"crossref","unstructured":"D. McCullough. \u201cNoninterference and the Composability of Security Properties\u201d. In Proceedings, 1988 IEEE Symposium on Security and Privacy, pages 177\u2013186. IEEE Computer Society Press, April 1988. 333, 376","DOI":"10.1109\/SECPRI.1988.8110"},{"key":"6_CR49","unstructured":"J. K. Millen. \u201cHookup Security for Synchronous Machines\u201d. In Proceedings of the Third Computer Security Foundation Workshop III. IEEE Computer Society Press, 1990. 333"},{"key":"6_CR50","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989. 333, 335, 337,339, 340, 343, 344, 361, 363, 364"},{"key":"6_CR51","unstructured":"J. C. Mitchell, M. Mitchell, and U. Stern. \u201cAutomated Analysis of Cryptographic Protocols Using Mur\u00f8\u201d. In Proceedings of the 1997 IEEE Symposium on Research in Security and Privacy, pages 141\u2013153. IEEE Computer Society Press, 1997. 331"},{"key":"6_CR52","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola and M. Hennessy. \u201cTesting equivalences for processes\u201d. Theoretical Computer Science, 34:83\u2013133, 1984. 341, 348, 353","journal-title":"Theoretical Computer Science"},{"key":"6_CR53","doi-asserted-by":"crossref","unstructured":"L. C. Paulson. \u201cProving Properties of Security Protocols by Induction\u201d. In 10th Computer Security Foundations Workshop, pages 70\u201383. IEEE Computer Society Press, 1997. 331","DOI":"10.1109\/CSFW.1997.596788"},{"key":"6_CR54","unstructured":"G. Plotkin. \u201cA Structural Approach to Operational Semantics\u201d. Technical Report DAIMI-FN-19, Aarhus University, 1981. 334"},{"key":"6_CR55","unstructured":"A. W. Roscoe. \u201cModel Checking CSP\u201d. In A. W. Roscoe (ed) A Classical Mind. Prentice Hall, 1994. 368, 375"},{"key":"6_CR56","series-title":"Lect Notes Comput Sci","first-page":"33","volume-title":"Proceeding of European Symposium on Research in Computer Security 1994 (ESORICS\u201994)","author":"A.W. Roscoe","year":"1994","unstructured":"A.W. Roscoe, J. C. P. Woodcock, and L. Wulf. \u201cNon-interference through Determinism\u201d. In Proceeding of European Symposium on Research in Computer Security 1994 (ESORICS\u201994), pages 33\u201353. Springer-Verlag LNCS 875, 1994. 368, 369, 370,375"},{"key":"6_CR57","unstructured":"P. Y. A. Ryan. \u201cA CSP Formulation of Non-Interference\u201d. In Proceedings of the 1990 Computer Security Foundation Workshop III, Franconia, 1990. IEEE press.368"},{"key":"6_CR58","unstructured":"P. Y. A. Ryan. \u201cMathematical Models of Computer Security\u201d. In this volume.376"},{"issue":"9","key":"6_CR59","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1109\/32.713329","volume":"24","author":"S. Schneider","year":"1998","unstructured":"S. Schneider. \u201cVerifying authentication protocols in CSP\u201d. IEEE Transactions on Software Engineering, 24(9), September 1998. 331,396.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR60","doi-asserted-by":"crossref","unstructured":"G. Smith and D. M. Volpano. \u201cSecure Information Flow in a Multi-Threaded Imperative Language\u201d. In Proc. of POPL, pages 355\u2013364, 1998. 331","DOI":"10.1145\/268946.268975"},{"key":"6_CR61","doi-asserted-by":"crossref","unstructured":"L. J. Stockmeyer and A. R. Meyer. \u201cWord problems requiring exponential time\u201d. In Proceedings of the 5th ACM Symposium on Theory of Computing, pages 1\u20139, Austin, Texas, 1973. 355","DOI":"10.1145\/800125.804029"},{"key":"6_CR62","unstructured":"D. Sutherland. \u201cA Model of Information\u201d. In Proceedings of the 9th National Computer Security Conference, pages 175\u2013183. National Bureau of Standards and National Computer Security Center, September 1986. 333, 376"},{"key":"6_CR63","doi-asserted-by":"crossref","unstructured":"C. R. Tsai, V. D. Gligor, and C. S. Chandersekaran. \u201cOn the Identification of Covert Storage Channels in Secure Systems\u201d. IEEE Transactions on Software Engineering, pages 569\u2013580, June 1990. 332","DOI":"10.1109\/32.55086"},{"key":"6_CR64","doi-asserted-by":"crossref","unstructured":"J. T. Wittbold and D. M. Johnson. \u201cInformation Flow in Nondeterministic Systems\u201d. In Proceedings of the 1990 IEEE Symposium on Research in Security and Privacy, pages 144\u2013161. IEEE Computer Society Press, 1990. 333 bm 397 397","DOI":"10.1109\/RISP.1990.63846"}],"container-title":["Lecture Notes in Computer Science","Foundations of Security Analysis and Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45608-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:09:49Z","timestamp":1737288589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45608-2_6"}},"subtitle":["(Part I: Information Flow)"],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428961","9783540456087"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/3-540-45608-2_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}