{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:38:44Z","timestamp":1764995924238},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332951"},{"type":"electronic","value":"9783642332968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33296-8_16","type":"book-chapter","created":{"date-parts":[[2012,9,16]],"date-time":"2012-09-16T22:24:55Z","timestamp":1347834295000},"page":"210-225","source":"Crossref","is-referenced-by-count":1,"title":["Alternating-Time Temporal Logic in the Calculus of (Co)Inductive Constructions"],"prefix":"10.1007","author":[{"given":"Dante","family":"Zanarini","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Luna","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Sierra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-49213-5_2","volume-title":"Compositionality: The Significant Difference","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-Time Temporal Logic. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 23\u201360. Springer, Heidelberg (1998)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM\u00a049, 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BFb0028774","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T., Mang, F., Qadeer, S., Rajamani, S., Tasiran, S.: Mocha: Modularity in Model Checking. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 521\u2013525. Springer, Heidelberg (1998)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions. In: Texts in Theoretical Computer Science. Springer (2004)","DOI":"10.1007\/978-3-662-07964-5"},{"issue":"1-2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10817-005-9019-5","volume":"36","author":"R. Chadha","year":"2006","unstructured":"Chadha, R., Kremer, S., Scedrov, A.: Formal analysis of multiparty contract signing. Journal of Automated Reasoning\u00a036(1-2), 39\u201383 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Coquand, T., Huet, G.: The Calculus of Constructions. In: Information and Computation, vol.\u00a076, pp. 95\u2013120. Academic Press (February\/March 1988)","DOI":"10.1016\/0890-5401(88)90005-3"},{"key":"16_CR7","unstructured":"Coupet-Grimal, S.: LTL in Coq. Contributions to the Coq system, Laboratoire d\u2019Informatique Fondamentale de Marseille (2002), \n                  \n                    http:\/\/coq.inria.fr\/contribs\/LTL.tar.gz"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Emerson, E.: Temporal and modal logic. In: Handbook of Theoretical Computer Science, pp. 995\u20131072. Elsevier (1995)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"16_CR9","unstructured":"Gim\u00e9nez, E.: A Calculus of Infinite Constructions and its application to the verification of communicating systems. PhD thesis, Ecole Normale Sup\u00e9rieure de Lyon (1996)"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2005.07.043","volume":"353","author":"V. Goranko","year":"2006","unstructured":"Goranko, V., van Drimmelen, G.: Complete axiomatization and decidability of alternating-time temporal logic. Theoretical Computer Science\u00a0353(1), 93\u2013117 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"16_CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/JCS-2003-11307","volume":"11","author":"S. Kremer","year":"2003","unstructured":"Kremer, S., Raskin, J.: A game-based verification of non-repudiation and fair exchange protocols. Journal of Computer Security\u00a011(3), 399\u2013429 (2003)","journal-title":"Journal of Computer Security"},{"issue":"7","key":"16_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X. Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Communications of the ACM\u00a052(7), 107\u2013115 (2009)","journal-title":"Communications of the ACM"},{"key":"16_CR13","unstructured":"Luna, C.: Computation tree logic for reactive systems and timed computation tree logic for real time systems. Contributions to the Coq system, Universidad de la Rep\u00fablica, Uruguay (2000)"},{"key":"16_CR14","unstructured":"Merz, S.: An encoding of TLA in Isabelle. Technical report, Institut f\u00fcr Informatic, Universit\u00e4t M\u00fcnchen, Germany (1999)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/BFb0037116","volume-title":"Typed Lambda Calculi and Applications","author":"C. Paulin-Mohring","year":"1993","unstructured":"Paulin-Mohring, C.: Inductive Definitions in the System Coq - rules and Properties. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 328\u2013345. Springer, Heidelberg (1993)"},{"key":"16_CR16","first-page":"46","volume-title":"Proceedings of the 18th Annual Symposium on Foundations of Computer Science","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE Computer Society, Washington, DC (1977)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","first-page":"598","volume-title":"Verification: Theory and Practice","author":"A. Pnueli","year":"2004","unstructured":"Pnueli, A., Arons, T.: tlpvs: A pvs-Based ltl Verification System. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 598\u2013625. Springer, Heidelberg (2004)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-48256-3_17","volume-title":"Theorem Proving in Higher Order Logics","author":"K. Schneider","year":"1999","unstructured":"Schneider, K., Hoffmann, D.W.: A HOL Conversion for Translating Linear Time Temporal Logic to \u03c9-Automata. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, pp. 255\u2013272. Springer, Heidelberg (1999)"},{"key":"16_CR19","unstructured":"The Coq development team. The Coq proof assistant reference manual, version 8.2. LogiCal Project, Distributed electronically (2010), \n                  \n                    http:\/\/coq.inria.fr"},{"key":"16_CR20","unstructured":"The Coq development team. The Coq Standard Library. LogiCal Project (2010), \n                  \n                    http:\/\/coq.inria.fr\/stdlib\/"},{"key":"16_CR21","unstructured":"van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics. Elsevier and MIT Press (1990)"},{"key":"16_CR22","unstructured":"Zanarini, D.: Formalizaci\u00f3n de l\u00f3gica temporal alternante en el c\u00e1lculo de construcciones coinductivas. Master\u2019s thesis, FCEIA, Universidad Nacional de Rosario, Argentina (2008), \n                  \n                    http:\/\/www.fceia.unr.edu.ar\/~dante"},{"key":"16_CR23","unstructured":"Zanarini, D.: Formalization of alternating time temporal logic in Coq (2010), \n                  \n                    http:\/\/www.fceia.unr.edu.ar\/~dante"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33296-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:03:35Z","timestamp":1620115415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33296-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332951","9783642332968"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33296-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}