{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:50Z","timestamp":1750307270688,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-2007-1 Project 216471"],"award-info":[{"award-number":["FP7-ICT-2007-1 Project 216471"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["PTDC\/MAT\/68723\/2006"],"award-info":[{"award-number":["PTDC\/MAT\/68723\/2006"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1982185.1982507","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:14Z","timestamp":1305637154000},"page":"1502-1509","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of fairness constraints for the Dolev-Yao attacker model"],"prefix":"10.1145","author":[{"given":"Jan","family":"Cederquist","sequence":"first","affiliation":[{"name":"Instituto Superior T\u00e9cnico, Tagus Park, Porto Salvo, Portugal"}]},{"given":"Mohammad Torabi","family":"Dashti","sequence":"additional","affiliation":[{"name":"Universit\u00e4tstrasse, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.002"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0047"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90056-0"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2007.24"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.839935"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151414.1151416"},{"key":"e_1_3_2_1_7_1","volume-title":"CSFW '01, page 82","author":"Blanchet B.","year":"2001","unstructured":"B. Blanchet . An efficient cryptographic protocol verifier based on Prolog rules . In CSFW '01, page 82 . IEEE Computer Society , 2001 . B. Blanchet. An efficient cryptographic protocol verifier based on Prolog rules. In CSFW '01, page 82. IEEE Computer Society, 2001."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/363516.363528"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"422","volume-title":"ESORICS","author":"Cortier V.","year":"2007","unstructured":"V. Cortier , R. K\u00fcsters , and B. Warinschi . A cryptographic model for branching time security properties . In ESORICS , volume 4734 of LNCS , pages 422 -- 437 , 2007 . V. Cortier, R. K\u00fcsters, and B. Warinschi. A cryptographic model for branching time security properties. In ESORICS, volume 4734 of LNCS, pages 422--37, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_11_1","first-page":"995","volume-title":"Leeuwen {16}","author":"Emerson E.","unstructured":"E. Emerson . Temporal and modal logic . In Leeuwen {16} , pages 995 -- 1072 . E. Emerson. Temporal and modal logic. In Leeuwen {16}, pages 995--1072."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness. Springer 1986.   N. Francez. Fairness . Springer 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-004-0063-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.26"},{"key":"e_1_3_2_1_15_1","series-title":"LNCS","first-page":"551","volume-title":"CONCUR '01","author":"Kremer S.","year":"2001","unstructured":"S. Kremer and J. Raskin . A game-based verification of non-repudiation and fair exchange protocols . In CONCUR '01 , volume 2154 of LNCS , pages 551 -- 565 , 2001 . S. Kremer and J. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In CONCUR '01, volume 2154 of LNCS, pages 551--565, 2001."},{"key":"e_1_3_2_1_16_1","volume-title":"MIT","author":"van Leeuwen J.","year":"1990","unstructured":"J. van Leeuwen , editor. Handbook of theoretical computer science (vol. B): Formal models and semantics . MIT , 1990 . J. van Leeuwen, editor. Handbook of theoretical computer science (vol. B): Formal models and semantics. MIT, 1990."},{"key":"e_1_3_2_1_17_1","volume-title":"Distributed Algorithms","author":"Lynch N.","year":"1996","unstructured":"N. Lynch . Distributed Algorithms . Morgan Kaufmann Publishers , 1996 . N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996."},{"key":"e_1_3_2_1_18_1","volume-title":"Counter-Free Automata","author":"McNaughton R.","year":"1971","unstructured":"R. McNaughton and S. Papert . Counter-Free Automata . MIT Press , 1971 . R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, 1971."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2003.12.001"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502007"},{"key":"e_1_3_2_1_21_1","first-page":"174","volume-title":"CSFW '01","author":"Rusinowitch M.","unstructured":"M. Rusinowitch and M. Turuani . Protocol insecurity with finite number of sessions is NP-complete . In CSFW '01 , page 174 . IEEE CS, 2001. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In CSFW '01, page 174. IEEE CS, 2001."},{"issue":"5","key":"e_1_3_2_1_22_1","first-page":"495","article-title":"Safety, liveness and fairness in temporal logic","volume":"6","author":"Sistla A.","year":"1994","unstructured":"A. Sistla . Safety, liveness and fairness in temporal logic . FAC , 6 ( 5 ): 495 -- 512 , 1994 . A. Sistla. Safety, liveness and fairness in temporal logic. FAC, 6(5): 495--512, 1994.","journal-title":"FAC"},{"key":"e_1_3_2_1_23_1","first-page":"133","volume-title":"Leeuwen {16}","author":"Thomas W.","unstructured":"W. Thomas . Automata on infinite objects . In Leeuwen {16} , pages 133 -- 191 . W. Thomas. Automata on infinite objects. In Leeuwen {16}, pages 133--191."},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","first-page":"202","volume-title":"FAST '06","author":"Wei K.","year":"2007","unstructured":"K. Wei and J. Heather . A theorem-proving approach to verification of fair non-repudiation protocols . In FAST '06 , volume 4691 of LNCS , pages 202 -- 219 , 2007 . K. Wei and J. Heather. A theorem-proving approach to verification of fair non-repudiation protocols. In FAST '06, volume 4691 of LNCS, pages 202--219, 2007."}],"event":{"name":"SAC'11: The 2011 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"TaiChung Taiwan","acronym":"SAC'11"},"container-title":["Proceedings of the 2011 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1982185.1982507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:56Z","timestamp":1750243976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":24,"alternative-id":["10.1145\/1982185.1982507","10.1145\/1982185"],"URL":"https:\/\/doi.org\/10.1145\/1982185.1982507","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}