{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:34:57Z","timestamp":1743068097709,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031084201"},{"type":"electronic","value":"9783031084218"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08421-8_9","type":"book-chapter","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T21:02:38Z","timestamp":1658178158000},"page":"123-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reasoning About Smart Contracts Encoded in\u00a0LTL"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-1324","authenticated-orcid":false,"given":"Valeria","family":"Fionda","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5799-6828","authenticated-orcid":false,"given":"Gianluigi","family":"Greco","sequence":"additional","affiliation":[]},{"given":"Marco Antonio","family":"Mastratisi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Douglis, F., Stavrou, A.: Distributed ledger technologies. IEEE Internet Comput. 24(3) (2020)","DOI":"10.1109\/MIC.2020.3002415"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-42019-6_11","volume-title":"Rule Technologies. Research, Tools, and Applications","author":"F Idelberger","year":"2016","unstructured":"Idelberger, F., Governatori, G., Riveret, R., Sartor, G.: Evaluation of logic-based smart contracts for blockchain systems. In: Alferes, J.J.J., Bertossi, L., Governatori, G., Fodor, P., Roman, D. (eds.) RuleML 2016. LNCS, vol. 9718, pp. 167\u2013183. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42019-6_11"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Hu, J., Zhong, Y.: A method of logic-based smart contracts for blockchain system. In: Proceedings of ICDPA, pp. 58\u201361 (2018)","DOI":"10.1145\/3224207.3224218"},{"key":"9_CR4","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-45688-7_40","volume-title":"Trends and Innovations in Information Systems and Technologies","author":"A Stancu","year":"2020","unstructured":"Stancu, A., Dragan, M.: Logic-based smart contracts. In: Rocha, \u00c1., Adeli, H., Reis, L.P., Costanzo, S., Orovic, I., Moreira, F. (eds.) WorldCIST 2020. AISC, vol. 1159, pp. 387\u2013394. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45688-7_40"},{"key":"9_CR5","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"issue":"2014","key":"9_CR6","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Proj. Yellow Pap. 151(2014), 1\u201332 (2014)","journal-title":"Ethereum Proj. Yellow Pap."},{"key":"9_CR7","unstructured":"Szabo, N.: The idea of smart contracts. Nick Szabo\u2019s Papers and Concise Tutorials, 6 (1997)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4842-2535-6","volume-title":"Introducing Ethereum and Solidity","author":"C Dannen","year":"2017","unstructured":"Dannen, C.: Introducing Ethereum and Solidity, p. 185. Apress, Berkeley (2017)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The Temporal logic of programs. In: Proceedings of FOCS, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A Pnueli","year":"1981","unstructured":"Pnueli, A.: The temporal semantics of concurrent programs. Theoret. Comput. Sci. 13, 45\u201360 (1981)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"9_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1018985923441","volume":"22","author":"F Bacchus","year":"1998","unstructured":"Bacchus, F., Kabanza, F.: Planning for temporally extended goals. Ann. Math. Artif. Intell. 22(1\u20132), 5\u201327 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9_CR12","unstructured":"Calvanese, D., De Giacomo, G., Vardi, M.Y.: Reasoning about actions and planning in LTL action theories. In: Proceedings of KR, pp. 593\u2013602 (2002)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Sohrabi, S., Baier, J.A., McIlraith, S.A.: Preferred explanations: theory and generation via planning. In Proceedings of AAAI, pp. 261\u2013267 (2011)","DOI":"10.1609\/aaai.v25i1.7845"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Bobadilla, L., Sanchez, O., Czarnowski, J., Gossman, K., LaValle, S.: Controlling wild bodies using linear temporal logic. In: Proceedings of RSS, pp. 17\u201324 (2011)","DOI":"10.15607\/RSS.2011.VII.003"},{"issue":"5","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TAC.2014.2298143","volume":"59","author":"X Ding","year":"2014","unstructured":"Ding, X., Smith, S., Belta, C., Rus, D.: Optimal control of Markov decision processes with linear temporal logic constraints. IEEE Trans. Autom. Control 59(5), 1244\u20131257 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-23059-2_13","volume-title":"Business Process Management","author":"FM Maggi","year":"2011","unstructured":"Maggi, F.M., Montali, M., Westergaard, M., van der Aalst, W.M.P.: Monitoring business constraints with linear temporal logic: an approach based on colored automata. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 132\u2013147. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23059-2_13"},{"issue":"5","key":"9_CR17","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1109\/TKDE.2019.2897309","volume":"32","author":"V Fionda","year":"2020","unstructured":"Fionda, V., Guzzo, A.: Control-flow modeling with declare: behavioral properties, computational complexity, and tools. IEEE Trans. Knowl. Data Eng. 32(5), 898\u2013911 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR18","unstructured":"Chekol, M.W., Fionda, V., Pirr\u00f2, G.: Time travel queries in RDF archives. In: Proceedings of MEPDaW, pp. 28\u201342 (2017)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1613\/jair.1.11256","volume":"63","author":"V Fionda","year":"2018","unstructured":"Fionda, V., Greco, G.: LTL on finite and process traces: complexity results and a practical reasoner. J. Artif. Intell. Res. 63, 557\u2013623 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-16164-3_11","volume-title":"Model Checking Software","author":"M Pe\u0161i\u0107","year":"2010","unstructured":"Pe\u0161i\u0107, M., Bo\u0161na\u010dki, D., van der Aalst, W.M.P.: Enacting declarative languages using LTL: avoiding errors and improving performance. In: van de Pol, J., Weber, M. (eds.) SPIN 2010. LNCS, vol. 6349, pp. 146\u2013161. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16164-3_11"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Pesic, M., Schonenberg, H., Van der Aalst, W.: DECLARE: full support for loosely- structured processes. In: Proceedings of EDOC, pp. 287\u2013298 (2007)","DOI":"10.1109\/EDOC.2007.14"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00450-009-0057-9","volume":"23","author":"W Van Der Aalst","year":"2009","unstructured":"Van Der Aalst, W., Pesic, M., Schonenberg, H.: Declarative workflows: balancing between flexibility and support. Comput. Sci. Res. Dev. 23(2), 99\u2013113 (2009)","journal-title":"Comput. Sci. Res. Dev."},{"key":"9_CR23","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of IJCAI, pp. 854\u2013860 (2013)"},{"key":"9_CR24","unstructured":"Li, J., Zhang, L., Pu, G., Vardi, M.Y., He, J.: LTLf satisfiability checking. In: Proceedings of ECAI, pp. 513\u2013518 (2014)"},{"issue":"5","key":"9_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-2(5:5)2006","volume":"2","author":"A Biere","year":"2006","unstructured":"Biere, A., Heljanko, K., Junttila, T., Latvala, T., Schuppan, V.: Linear encodings of bounded LTL model checking. Log. Methods Comput. Sci. 2(5), 1\u201364 (2006)","journal-title":"Log. Methods Comput. Sci."},{"key":"9_CR26","unstructured":"Audemard, G., and Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of IJCAI, pp. 399\u2013404 (2009)"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2021 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08421-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T22:29:57Z","timestamp":1676154597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08421-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031084201","9783031084218"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08421-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2021.disco.unimib.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}