{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:46Z","timestamp":1761596986101},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371878"},{"type":"electronic","value":"9783540371885"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11814771_3","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T11:44:21Z","timestamp":1160048661000},"page":"4-20","source":"Crossref","is-referenced-by-count":4,"title":["Representing and Reasoning with Operational Semantics"],"prefix":"10.1007","author":[{"given":"Dale","family":"Miller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"J. of Logic and Computation"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11541868_4","volume-title":"Theorem Proving in Higher Order Logics: 18th International Conference","author":"B.E. Aydemir","year":"2005","unstructured":"Aydemir, B.E., Bohannon, A., Fairbairn, M., Foster, J.N., Pierce, B.C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized metatheory for the masses: The PoplMark challenge. In: Theorem Proving in Higher Order Logics: 18th International Conference, pp. 50\u201365. Springer, Heidelberg (2005)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1996.0032","volume":"126","author":"M. Boreale","year":"1996","unstructured":"Boreale, M., Nicola, R.D.: A symbolic semantics for the \u03c0-calculus. Information and Computation\u00a0126(1), 34\u201352 (1996)","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Borras, P., Cl\u00e9ment, D., Despeyroux, T., Incerpi, J., Kahn, G., Lang, B., Pascual, V.: Centaur: the system. In: Proceedings of SIGSOFT 1988: Third Annual Symposium on Software Development Environments (SDE3), Boston (1988)","key":"3_CR4","DOI":"10.1145\/64135.65005"},{"issue":"3","key":"3_CR5","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/1385-7258(78)90052-5","volume":"40","author":"N. Bruijn","year":"1979","unstructured":"Bruijn, N.: Lambda calculus notation with namefree formulas involving symbols that represent reference transforming mappings. Indag. Math.\u00a040(3), 348\u2013356 (1979)","journal-title":"Indag. Math."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. J.of Symbolic Logic\u00a05, 56\u201368 (1940)","journal-title":"J.of Symbolic Logic"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, J., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"3_CR8","volume-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"R.L. Constable","year":"1986","unstructured":"Constable, R.L., et al.: Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs (1986)"},{"issue":"2\/3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Information and Computation\u00a076(2\/3), 95\u2013120 (1988)","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Despeyroux, J., Felty, A., Hirschowitz, A.: Higher-order abstract syntax in Coq. In: Second International Conference on Typed Lambda Calculi and Applications, pp. 124\u2013138 (April 1995)","key":"3_CR10","DOI":"10.1007\/BFb0014049"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2001","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013, 341\u2013363 (2001)","journal-title":"Formal Aspects of Computing"},{"key":"3_CR12","first-page":"68","volume-title":"The Collected Papers of Gerhard Gentzen","author":"G. Gentzen","year":"1969","unstructured":"Gentzen, G.: Investigations into logical deductions. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, pp. 68\u2013131. North-Holland, Amsterdam (1969)"},{"unstructured":"Girard, J.-Y.: A fixpoint theorem in linear logic. An email posting to the mailing list linear@cs.stanford.edu (February 1992)","key":"3_CR13"},{"unstructured":"Gordon, M.: HOL: A machine oriented formulation of higher-order logic. Technical Report\u00a068, University of Cambridge (July 1985)","key":"3_CR14"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. Information and Computation\u00a0100, 202\u2013260 (1992)","journal-title":"Information and Computation"},{"issue":"5","key":"3_CR16","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1093\/logcom\/1.5.635","volume":"1","author":"L. Halln\u00e4s","year":"1991","unstructured":"Halln\u00e4s, L., Schroeder-Heister, P.: A proof-theoretic approach to logic programming. II. Programs as definitions. J. of Logic and Computation\u00a01(5), 635\u2013660 (1991)","journal-title":"J. of Logic and Computation"},{"issue":"2","key":"3_CR17","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(2), 353\u2013389 (1995)","journal-title":"Theoretical Computer Science"},{"key":"3_CR18","first-page":"204","volume-title":"14th Symp. on Logic in Computer Science","author":"M. Hofmann","year":"1999","unstructured":"Hofmann, M.: Semantical analysis of higher-order abstract syntax. In: 14th Symp. on Logic in Computer Science, pp. 204\u2013213. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation\u00a0124(2), 103\u2013112 (1996)","journal-title":"Information and Computation"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF00264598","volume":"11","author":"G. Huet","year":"1978","unstructured":"Huet, G., Lang, B.: Proving and applying program transformations expressed with second-order patterns. Acta Informatica\u00a011, 31\u201355 (1978)","journal-title":"Acta Informatica"},{"doi-asserted-by":"crossref","unstructured":"Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: Proceedings of the 14th ACM Symposium on the Principles of Programming Languages (1987)","key":"3_CR21","DOI":"10.1145\/41625.41635"},{"unstructured":"Kiniry, J.R., Chalin, P., Hurlin, C.: Integrating static checking and interactive verification: Supporting multiple theories and provers in verification. In: VSTTE 2005, Proceedings of Verified Software: Theories, Tools, Experiements, Zurich, Switzerland (October 2005)","key":"3_CR22"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0049-237X(09)70189-2","volume-title":"Sixth International Congress for Logic, Methodology, and Philosophy of Science","author":"P. Martin-L\u00f6f","year":"1982","unstructured":"Martin-L\u00f6f, P.: Constructive mathematics and computer programming. In: Sixth International Congress for Logic, Methodology, and Philosophy of Science, pp. 153\u2013175. North-Holland, Amsterdam (1982)"},{"key":"3_CR24","first-page":"434","volume-title":"12th Symp. on Logic in Computer Science","author":"R. McDowell","year":"1997","unstructured":"McDowell, R., Miller, D.: A logic for reasoning with higher-order abstract syntax. In: Winskel, G. (ed.) 12th Symp. on Logic in Computer Science, Warsaw, Poland, July 1997, pp. 434\u2013445. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(99)00171-1","volume":"232","author":"R. McDowell","year":"2000","unstructured":"McDowell, R., Miller, D.: Cut-elimination for a logic with definitions and induction. Theoretical Computer Science\u00a0232, 91\u2013119 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/504077.504080","volume":"3","author":"R. McDowell","year":"2002","unstructured":"McDowell, R., Miller, D.: Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. on Computational Logic\u00a03(1), 80\u2013136 (2002)","journal-title":"ACM Trans. on Computational Logic"},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0304-3975(01)00168-2","volume":"294","author":"R. McDowell","year":"2003","unstructured":"McDowell, R., Miller, D., Palamidessi, C.: Encoding transition systems in sequent calculus. Theoretical Computer Science\u00a0294(3), 411\u2013437 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"3_CR28","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. of Logic and Computation\u00a01(4), 497\u2013536 (1991)","journal-title":"J. of Logic and Computation"},{"key":"3_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44957-4_16","volume-title":"Computational Logic - CL 2000","author":"D. Miller","year":"2000","unstructured":"Miller, D.: Abstract syntax for variable binders: An overview. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 239\u2013253. Springer, Heidelberg (2000)"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-30124-0_4","volume-title":"Computer Science Logic","author":"D. Miller","year":"2004","unstructured":"Miller, D.: Bindings, mobility of bindings, and the \n                    \n                      \n                    \n                    $\\nabla$\n                  -quantifier. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, p. 24. Springer, Heidelberg (2004)"},{"key":"3_CR31","series-title":"London Mathematical Society Lecture Note","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/CBO9780511550850.004","volume-title":"Linear Logic in Computer Science","author":"D. Miller","year":"2004","unstructured":"Miller, D.: Overview of linear logic programming. In: Ehrhard, T., Girard, J.-Y., Ruet, P., Scott, P. (eds.) Linear Logic in Computer Science. London Mathematical Society Lecture Note, vol.\u00a0316, pp. 119\u2013150. Cambridge University Press, Cambridge (2004)"},{"unstructured":"Miller, D., Nadathur, G.: A logic programming approach to manipulating formulas and programs. In: Haridi, S. (ed.) IEEE Symposium on Logic Programming, San Francisco, pp. 379\u2013388 (September 1987)","key":"3_CR32"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic\u00a051, 125\u2013157 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"Miller, D., Palamidessi, C.: Foundational aspects of syntax. ACM Computing Surveys, 31 (September 1999)","key":"3_CR34","DOI":"10.1145\/333580.333590"},{"key":"3_CR35","first-page":"118","volume-title":"18th Symp. on Logic in Computer Science","author":"D. Miller","year":"2003","unstructured":"Miller, D., Tiu, A.: A proof theory for generic judgments: An extended abstract. In: 18th Symp. on Logic in Computer Science, June 2003, pp. 118\u2013127. IEEE, Los Alamitos (2003)"},{"issue":"4","key":"3_CR36","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1094622.1094628","volume":"6","author":"D. Miller","year":"2005","unstructured":"Miller, D., Tiu, A.: A proof theory for generic judgments. ACM Trans. on Computational Logic\u00a06(4), 749\u2013783 (2005)","journal-title":"ACM Trans. on Computational Logic"},{"key":"3_CR37","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs (1989)"},{"doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Part II. In: Information and Computation, pp. 41\u201377 (1992)","key":"3_CR38","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-24849-1_19","volume-title":"Types for Proofs and Programs","author":"A. Momigliano","year":"2004","unstructured":"Momigliano, A., Tiu, A.: Induction and co-induction in sequent calculus. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 293\u2013308. Springer, Heidelberg (2004)"},{"key":"3_CR40","first-page":"810","volume-title":"Fifth International Logic Programming Conference","author":"G. Nadathur","year":"1988","unstructured":"Nadathur, G., Miller, D.: An Overview of \u03bbProlog. In: Fifth International Logic Programming Conference, August 1988, pp. 810\u2013827. MIT Press, Cambridge (1988)"},{"issue":"4","key":"3_CR41","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1145\/96559.96570","volume":"37","author":"G. Nadathur","year":"1990","unstructured":"Nadathur, G., Miller, D.: Higher-order Horn clauses. Journal of the ACM\u00a037(4), 777\u2013814 (1990)","journal-title":"Journal of the ACM"},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-48660-7_25","volume-title":"Proceedings of the 16th International Conference on Automated Deduction","author":"G. Nadathur","year":"1999","unstructured":"Nadathur, G., Mitchell, D.J.: System description: Teyjus\u2014a compiler and abstract machine based implementation of Lambda Prolog. In: Ganzinger, H. (ed.) Proceedings of the 16th International Conference on Automated Deduction, Trento, Italy, July 1999, pp. 287\u2013291. Springer, Heidelberg (1999)"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1007\/3-540-55602-8_217","volume-title":"Automated Deduction - CADE-11","author":"S. Owre","year":"1992","unstructured":"Owre, S., Rushby, J.M., Shankar, N.: PVS: A prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 748\u2013752. Springer, Heidelberg (1992)"},{"key":"3_CR45","first-page":"219","volume-title":"Methods and Tools for Compiler Construction","author":"L. Paulson","year":"1984","unstructured":"Paulson, L.: Compiler Generation from Denotational Semantics. In: Lorho, B. (ed.) Methods and Tools for Compiler Construction, pp. 219\u2013250. Cambridge University Press, Cambridge (1984)"},{"issue":"3","key":"3_CR46","first-page":"291","volume":"17","author":"L.C. Paulson","year":"1996","unstructured":"Paulson, L.C., Gr\u0105bczewski, K.: Mechanizing set theory: Cardinal arithmetic and the axiom of choice. J. of Automated Deduction\u00a017(3), 291\u2013323 (1996)","journal-title":"J. of Automated Deduction"},{"key":"3_CR47","first-page":"199","volume-title":"Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation","author":"F. Pfenning","year":"1988","unstructured":"Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation, June 1988, pp. 199\u2013208. ACM Press, New York (1988)"},{"key":"3_CR48","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F. Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System description: Twelf \u2014 A meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"issue":"1","key":"3_CR49","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the \u03c0-calculus. Acta Informatica\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"3_CR50","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/LICS.1993.287585","volume-title":"Eighth Annual Symposium on Logic in Computer Science","author":"P. Schroeder-Heister","year":"1993","unstructured":"Schroeder-Heister, P.: Rules of definitional reflection. In: Vardi, M. (ed.) Eighth Annual Symposium on Logic in Computer Science, June 1993, pp. 222\u2013232. IEEE Computer Society Press, IEEE (1993)"},{"key":"3_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/10930755_8","volume-title":"Theorem Proving in Higher Order Logics","author":"C. Sch\u00fcrmann","year":"2003","unstructured":"Sch\u00fcrmann, C., Pfenning, F.: A coverage checking algorithm for LF. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 120\u2013135. Springer, Heidelberg (2003)"},{"unstructured":"Tiu, A.: A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University (May 2004)","key":"3_CR52"},{"key":"3_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11539452_7","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A. Tiu","year":"2005","unstructured":"Tiu, A.: Model checking for \u03c0-calculus using proof search. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 36\u201350. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Tiu, A., Miller, D.: A proof search specification of the \u03c0-calculus. In: 3rd Workshop on the Foundations of Global Ubiquitous Computing, September 2004, vol.\u00a0138, pp. 79\u2013101 (2004)","key":"3_CR54","DOI":"10.1016\/j.entcs.2005.05.006"},{"unstructured":"Tiu, A., Nadathur, G., Miller, D.: Mixing finite success and finite failure in an automated prover. In: Proceedings of ESHOL 2005: Empirically Successful Automated Reasoning in Higher-Order Logics, December 2005, pp. 79\u201398 (2005)","key":"3_CR55"},{"key":"3_CR56","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings of SOS 2005: Structural Operational Semantics","author":"A. Ziegler","year":"2005","unstructured":"Ziegler, A., Miller, D., Palamidessi, C.: A congruence format for name-passing calculi. In: Proceedings of SOS 2005: Structural Operational Semantics, Lisbon, Portugal, July 2005. Electronic Notes in Theoretical Computer Science, Elsevier Science B.V, Amsterdam (2005)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814771_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:33:45Z","timestamp":1558294425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814771_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371878","9783540371885"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/11814771_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}