{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T03:00:33Z","timestamp":1791342033267,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":57,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642166112","type":"print"},{"value":"9783642166129","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16612-9_9","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T11:45:14Z","timestamp":1289994314000},"page":"89-105","source":"Crossref","is-referenced-by-count":51,"title":["You Should Better Enforce Than Verify"],"prefix":"10.1007","author":[{"given":"Yli\u00e8s","family":"Falcone","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-69149-5_40","volume-title":"Verified Software: Theories, Tools, Experiments","author":"K. Havelund","year":"2008","unstructured":"Havelund, K., Goldberg, A.: Verify your runs. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol.\u00a04171, pp. 374\u2013383. Springer, Heidelberg (2008)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jlap.2008.08.004","volume":"78","author":"M. Leucker","year":"2008","unstructured":"Leucker, M., Schallhart, C.: A brief account of runtime verification. Journal of Logic and Algebraic Programming\u00a078, 293\u2013303 (2008)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Schneider, F.B.: Enforceable security policies. ACM Transactions on Information and System Security 3 (2000)","DOI":"10.1145\/353323.353382"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Ligatti, J., Bauer, L., Walker, D.: Run-time enforcement of nonsafety policies. ACM Transaction Information System Security 12 (2009)","DOI":"10.1145\/1455526.1455532"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/1111596.1111601","volume":"28","author":"K.W. Hamlen","year":"2006","unstructured":"Hamlen, K.W., Morrisett, G., Schneider, F.B.: Computability classes for enforcement mechanisms. ACM Trans. Programming Lang. and Syst.\u00a028, 175\u2013205 (2006)","journal-title":"ACM Trans. Programming Lang. and Syst."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Falcone, Y., Fernandez, J.C., Mounier, L.: Enforcement monitoring wrt. the safety-progress classification of properties. In: SAC 2009: Proceedings of the ACM symposium on Applied Computing, pp. 593\u2013600 (2009)","DOI":"10.1145\/1529282.1529408"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-642-03013-0_25","volume-title":"ECOOP 2009 \u2013 Object-Oriented Programming","author":"M. Dam","year":"2009","unstructured":"Dam, M., Jacobs, B., Lundblad, A., Piessens, F.: Security monitor inlining for multithreaded Java. In: Drossopoulou, S. (ed.) ECOOP 2009 \u2013 Object-Oriented Programming. LNCS, vol.\u00a05653, pp. 546\u2013569. Springer, Heidelberg (2009)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-68237-0_19","volume-title":"FM 2008: Formal Methods","author":"I. Aktug","year":"2008","unstructured":"Aktug, I., Dam, M., Gurov, D.: Provably correct runtime monitoring. In: Cuellar, J., Maibaum, T., Sere, K. (eds.) FM 2008. LNCS, vol.\u00a05014, pp. 262\u2013277. Springer, Heidelberg (2008)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Erlingsson, U., Schneider, F.B.: SASI enforcement of security policies: a retrospective. In: NSPW 1999: Workhop on New Security Paradigms, pp. 87\u201395 (2000)","DOI":"10.1145\/335169.335201"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2009.02.071","volume":"234","author":"H. Cirstea","year":"2009","unstructured":"Cirstea, H., Moreau, P.E., de Oliveira, A.S.: Rewrite based specification of access control policies. Electron. Notes Theor. Comput. Sci.\u00a0234, 37\u201354 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"de Oliveira, A.S., Wang, E.K., Kirchner, C., Kirchner, H.: Weaving rewrite-based access control policies. In: FMSE 2007: Proceedings of the ACM workshop on Formal Methods in Security Engineering, pp. 71\u201380 (2007)","DOI":"10.1145\/1314436.1314446"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Havelund, K., Rosu, G.: An overview of the runtime verification tool Java PathExplorer. Formal Methods in System Design 24 (2003)","DOI":"10.1023\/B:FORM.0000017721.39909.4b"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-540-68524-1_3","volume-title":"Testing of Software and Communicating Systems","author":"K. Havelund","year":"2008","unstructured":"Havelund, K.: Runtime verification of C programs. In: Suzuki, K., Higashino, T., Ulrich, A., Hasegawa, T. (eds.) TestCom\/FATES 2008. LNCS, vol.\u00a05047, pp. 7\u201322. Springer, Heidelberg (2008)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/10722468_19","volume-title":"SPIN Model Checking and Software Verification","author":"D. Drusinsky","year":"2000","unstructured":"Drusinsky, D.: The Temporal Rover and the ATG rover. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.\u00a01885, pp. 323\u2013330. Springer, Heidelberg (2000)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Chen, F., Ro\u015fu, G.: MOP: An Efficient and Generic Runtime Verification Framework. In: OOPSLA 2007: Object-Oriented Programming, Systems, Languages and Applications, pp. 569\u2013588 (2007)","DOI":"10.1145\/1297105.1297069"},{"key":"9_CR16","series-title":"LNCS","first-page":"246","volume-title":"TACAS 2009","author":"F. Chen","year":"2009","unstructured":"Chen, F., Rosu, G.: Parametric trace slicing and monitoring. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 246\u2013261. Springer, Heidelberg (2009)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 995\u20131072 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering\u00a03, 125\u2013143 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining Liveness. Information Processing Letters\u00a021, 181\u2013185 (1985)","journal-title":"Information Processing Letters"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0167-6423(84)90003-0","volume":"4","author":"Z. Manna","year":"1984","unstructured":"Manna, Z., Pnueli, A.: Adequate proof principles for invariance and liveness properties of concurrent programs. Sci. Comput. Program.\u00a04, 257\u2013289 (1984)","journal-title":"Sci. Comput. Program."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. Owicki","year":"1982","unstructured":"Owicki, S., Lamport, L.: Proving liveness properties of concurrent programs. ACM Transaction Programming Languages and Systems\u00a04, 455\u2013495 (1982)","journal-title":"ACM Transaction Programming Languages and Systems"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Sistla, A.P.: On characterization of safety and liveness properties in temporal logic. In: PODC 1985: Proceedings of the 4 th annual ACM symposium on Principles of distributed computing, pp. 39\u201348 (1985)","DOI":"10.1145\/323596.323600"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: A hierarchy of temporal properties (invited paper, 1989). In: PODC 1990: Proceedings of the 9 th annual ACM symposium on Principles of distributed computing, pp. 377\u2013410 (1990)","DOI":"10.1145\/93385.93442"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/3-540-55719-9_97","volume-title":"Automata, Languages and Programming","author":"E.Y. Chang","year":"1992","unstructured":"Chang, E.Y., Manna, Z., Pnueli, A.: Characterization of temporal property classes. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 474\u2013486. Springer, Heidelberg (1992)"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Chang, E., Manna, Z., Pnueli, A.: The Safety-Progress Classification. Technical report, Stanford University, Dept. of Computer Science (1992)","DOI":"10.1007\/978-3-642-58041-3_5"},{"key":"9_CR26","first-page":"375","volume-title":"STOC 1981: Proceedings of the 13 th Symp. on Theory Of computing","author":"R.S. Streett","year":"1981","unstructured":"Streett, R.S.: Propositional Dynamic Logic of looping and converse. In: STOC 1981: Proceedings of the 13 th Symp. on Theory Of computing, pp. 375\u2013383. ACM, New York (1981)"},{"key":"9_CR27","unstructured":"Falcone, Y., Fernandez, J.C., Mounier, L.: What can you verify and enforce at runtime? Software Tools for Technology Transfer, special issue on Runtime Verification (2010), Invited Paper, under review. Preprint as Verimag TR-2010-5"},{"key":"9_CR28","unstructured":"Runtime Verification (2001-2009), http:\/\/www.runtime-verification.org"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/11498490_24","volume-title":"Model-Based Testing of Reactive Systems","author":"S. Colin","year":"2005","unstructured":"Colin, S., Mariani, L.: Run-time verification. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472, pp. 525\u2013556. Springer, Heidelberg (2005)"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Chen, F., \u015eerb\u0103nu\u0163\u0103, T.F., Ro\u015fu, G.: jPredictor: a predictive runtime analysis tool for Java. In: ICSE 2008: Proceedings of the 30 th International Conference on Software Engineering, pp. 221\u2013230 (2008)","DOI":"10.1145\/1368088.1368119"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Bodden, E., Havelund, K.: Racer: Effective race detection using AspectJ. IEEE Transactions on Software Engineering (2009)","DOI":"10.1145\/1390630.1390650"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11678779_15","volume-title":"Hardware and Software, Verification and Testing","author":"S. Bensalem","year":"2006","unstructured":"Bensalem, S., Havelund, K.: Dynamic deadlock analysis of multi-threaded programs. In: Ur, S., Bin, E., Wolfsthal, Y. (eds.) HVC 2005. LNCS, vol.\u00a03875, pp. 208\u2013223. Springer, Heidelberg (2006)"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N.: Atomizer: a dynamic atomicity checker for multithreaded programs. In: POPL 2004: Proceedings of the 31 st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 256\u2013267 (2004)","DOI":"10.1145\/964001.964023"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-01465-9_19","volume-title":"Formal Aspects in Security and Trust","author":"N. Bielova","year":"2009","unstructured":"Bielova, N., Massacci, F.: Do you really mean what you actually enforced? In: Degano, P., Guttman, J., Martinelli, F. (eds.) FAST 2008. LNCS, vol.\u00a05491, pp. 287\u2013301. Springer, Heidelberg (2009)"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BFb0053381","volume-title":"ECOOP \u201997 - Object-Oriented Programming","author":"G. Kiczales","year":"1997","unstructured":"Kiczales, G., Lamping, J., Mendhekar, A., Maeda, C., Lopes, C.V., Loingtier, J.M., Irwin, J.: Aspect-oriented programming. In: Aksit, M., Matsuoka, S. (eds.) ECOOP 1997. LNCS, vol.\u00a01241, pp. 220\u2013242. Springer, Heidelberg (1997)"},{"key":"9_CR36","unstructured":"The Apache Jakarta Project: Byte Code Engineering Library (2009), http:\/\/jakarta.apache.org\/bcel\/"},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/TSE.2004.91","volume":"30","author":"N. Delgado","year":"2004","unstructured":"Delgado, N., Gates, A.Q., Roach, S.: A taxonomy and catalog of runtime software-fault monitoring tools. IEEE Trans. on Software Engineering\u00a030, 859\u2013872 (2004)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-540-31862-0_38","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"M. Viswanathan","year":"2005","unstructured":"Viswanathan, M., Kim, M.: Foundations for the run-time monitoring of reactive systems - fundamentals of the MaC language. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol.\u00a03407, pp. 543\u2013556. Springer, Heidelberg (2005)"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11813040_38","volume-title":"FM 2006: Formal Methods","author":"A. Pnueli","year":"2006","unstructured":"Pnueli, A., Zaks, A.: PSL model checking and run-time verification via testers. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 573\u2013586. Springer, Heidelberg (2006)"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Comparing LTL semantics for runtime verification. Journal of Logic and Computation (2009)","DOI":"10.1093\/logcom\/exn075"},{"key":"9_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-642-04694-0_4","volume-title":"RV 2009","author":"Y. Falcone","year":"2009","unstructured":"Falcone, Y., Fernandez, J.-C., Mounier, L.: Runtime verification of safety-progress properties. In: Bensalem, S., Peled, D. (eds.) RV 2009. LNCS, vol.\u00a05779, pp. 40\u201359. Springer, Heidelberg (2009)"},{"key":"9_CR42","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. Technical Report TUM-I0724, Technische Universit\u00e4t M\u00fcnchen (2007)"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11513988_36","volume-title":"Computer Aided Verification","author":"M. d\u2019Amorim","year":"2005","unstructured":"d\u2019Amorim, M., Ro\u015fu, G.: Efficient monitoring of \u03c9-languages. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 364\u2013378. Springer, Heidelberg (2005)"},{"key":"9_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-77395-5_10","volume-title":"Runtime Verification","author":"H. Barringer","year":"2007","unstructured":"Barringer, H., Rydeheard, D.E., Havelund, K.: Rule systems for run-time monitoring: From Eagle to RuleR. In: Sokolsky, O., Ta\u015f\u0131ran, S. (eds.) RV 2007. LNCS, vol.\u00a04839, pp. 111\u2013125. Springer, Heidelberg (2007)"},{"key":"9_CR45","unstructured":"Ligatti, J.A.: Policy Enforcement via Program Monitoring. PhD thesis, Princeton University (2006)"},{"key":"9_CR46","unstructured":"Falcone, Y., Mounier, L., Fernandez, J.C., Richier, J.L.: Runtime enforcement monitors: composition, synthesis, and enforcement abilities (2010), under revision at Formal Methods in System Design. Preprint as Verimag TR 2008-7"},{"key":"9_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/11555827_21","volume-title":"Computer Security \u2013 ESORICS 2005","author":"J. Ligatti","year":"2005","unstructured":"Ligatti, J., Bauer, L., Walker, D.: Enforcing non-safety security policies with program monitors. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 355\u2013373. Springer, Heidelberg (2005)"},{"key":"9_CR48","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s10207-004-0046-8","volume":"4","author":"J. Ligatti","year":"2005","unstructured":"Ligatti, J., Bauer, L., Walker, D.: Edit automata: Enforcement mechanisms for run-time security policies. Int. Journal of Information Security\u00a04, 2\u201316 (2005)","journal-title":"Int. Journal of Information Security"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Fong, P.W.L.: Access control by tracking shallow execution history. In: Proceedings of the 2004 IEEE Symposium on Security and Privacy, pp. 43\u201355 (2004)","DOI":"10.1109\/SECPRI.2004.1301314"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Talhi, C., Tawbi, N., Debbabi, M.: Execution monitoring enforcement for limited-memory systems. In: PST 2006: Proceedings of the International Conference on Privacy, Security and Trust, pp. 1\u201312 (2006)","DOI":"10.1145\/1501434.1501480"},{"key":"9_CR51","unstructured":"Viswanathan, M.: Foundations for the run-time analysis of software systems. PhD thesis, University of Pennsylvania, Philadelphia, PA, USA (2000)"},{"key":"9_CR52","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.entcs.2009.06.037","volume":"229","author":"D. Beauquier","year":"2009","unstructured":"Beauquier, D., Cohen, J., Lanotte, R.: Security policies enforcement using finite edit automata. Electr. Notes Theor. Comput. Sci.\u00a0229, 19\u201335 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"9_CR53","volume-title":"Infinite Words, Automata, Semigroups, Logic and Games","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite Words, Automata, Semigroups, Logic and Games. Elsevier, Amsterdam (2004)"},{"key":"9_CR54","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.entcs.2006.08.029","volume":"179","author":"F. Martinelli","year":"2007","unstructured":"Martinelli, F., Matteucci, I.: Through modeling to synthesis of security automata. Electronic Notes in Theoritical Compututer Science\u00a0179, 31\u201346 (2007)","journal-title":"Electronic Notes in Theoritical Compututer Science"},{"key":"9_CR55","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.entcs.2007.03.025","volume":"186","author":"I. Matteucci","year":"2007","unstructured":"Matteucci, I.: Automated synthesis of enforcing mechanisms for security properties in a timed setting. Elec. Notes in Theoritical Comp. Science\u00a0186, 101\u2013120 (2007)","journal-title":"Elec. Notes in Theoritical Comp. Science"},{"key":"9_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-89862-7_3","volume-title":"Information Systems Security","author":"Y. Falcone","year":"2008","unstructured":"Falcone, Y., Fernandez, J.C., Mounier, L.: Synthesizing enforcement monitors wrt. the safety-progress classification of properties. In: Sekar, R., Pujari, A.K. (eds.) ICISS 2008. LNCS, vol.\u00a05352, pp. 41\u201355. Springer, Heidelberg (2008)"},{"key":"9_CR57","doi-asserted-by":"crossref","unstructured":"Chabot, H., Khoury, R., Tawbi, N.: Generating in-line monitors for Rabin automata. In: NordSec 2009: 14 th Nordic Conf. on Secure IT Systems, pp. 287\u2013301 (2009)","DOI":"10.1007\/978-3-642-04766-4_20"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16612-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T09:57:20Z","timestamp":1559815040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16612-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642166112","9783642166129"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16612-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}