{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:40:35Z","timestamp":1743018035135,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030628215"},{"type":"electronic","value":"9783030628222"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62822-2_7","type":"book-chapter","created":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T21:04:28Z","timestamp":1604869468000},"page":"108-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compiling FL$$^{res}$$ on Finite Words"],"prefix":"10.1007","author":[{"given":"Wanwei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Liangze","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Tun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"unstructured":"Accellera: Accellera property languages reference manual, June 2004. http:\/\/www.eda.org\/vfv\/docs\/PSL-v1.1.pdf","key":"7_CR1"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01371727","volume":"26","author":"JC Birget","year":"1993","unstructured":"Birget, J.C.: State-complexity of finite-state devices, state compressibility and incompressibility. Math. Syst. Theory 26(3), 237\u2013269 (1993)","journal-title":"Math. Syst. Theory"},{"unstructured":"Bustan, D., Fisman, D., Havlicek, J.: Automata construction for PSL. Technical Report MCS05-04, IBM Haifa Research Lab, May 2005","key":"7_CR3"},{"doi-asserted-by":"crossref","unstructured":"Cimatti, A., Roveri, M., Semprini, S., Tonetta, S.: From PSL to NBA: a modular symbolic encoding. In: FMCAD 2006 (2006)","key":"7_CR4","DOI":"10.1109\/FMCAD.2006.19"},{"issue":"10","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1109\/TCAD.2008.2003303","volume":"27","author":"A Cimatti","year":"2008","unstructured":"Cimatti, A., Roveri, M., Tonetta, S.: Symbolic compilation of PSL. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 27(10), 1737\u20131750 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0025774"},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-36123-9","volume-title":"A Practical Introduction to PSL","author":"C Eisner","year":"2006","unstructured":"Eisner, C., Fisman, D.: A Practical Introduction to PSL. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-36123-9"},{"unstructured":"De Giacomo, G., Vardi, M.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI 2013, pp. 2000\u20132007. AAAI Press (2013)","key":"7_CR8"},{"unstructured":"De Giacomo, G., Vardi, M.: Synthesis for LTL and IDL on finite traces. In: IJCAI 2015, pp. 1558\u20131564. AAAI Press (2015)","key":"7_CR9"},{"unstructured":"IEEE Computer Society and IEEE Standards Association Corporate Advisory Group: IEEE standard for SystemVerilog \u2013 unified hardware design, specification, and verification language, December 2017","key":"7_CR10"},{"doi-asserted-by":"crossref","unstructured":"Jin, N., Shen, C.: Dynamic verifying the properties of the simple subset of PSL. In: 1st IEEE Symposium of Theoretical Aspects on Software Engineering, pp. 173\u2013182. IEEE Society (2007)","key":"7_CR11","DOI":"10.1109\/TASE.2007.20"},{"unstructured":"Li, J., Rozier, K.Y., Pu, G., Zhang, Y., Vardi, M.Y.: SAT-based explicit LTL$$_f$$ satisfiability checking. CoRR, abs\/1811.03176 (2018)","key":"7_CR12"},{"unstructured":"Li, J., Zhang, L., Pu, G., Vardi, M.Y., He, J.: LTL$$_f$$ satisfiability checking. In: ECAI 2014, volume 263 of Frontiers in Artificial Intelligence and Applications, pp. 513\u2013518. IOS Press (2014)","key":"7_CR13"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/s10703-018-00326-5","volume":"54","author":"J Li","year":"2019","unstructured":"Li, J., Zhu, S., Pu, G., Zhang, L., Vardi, M.Y.: SAT-based explicit LTL reasoning and its application to satisfiability checking. Formal Methods Syst. Des. 54(2), 164\u2013190 (2019)","journal-title":"Formal Methods Syst. Des."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-46691-6_8","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"C L\u00f6ding","year":"1999","unstructured":"L\u00f6ding, C.: Optimal bounds for transformations of $$\\Omega $$-automata. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds.) FSTTCS 1999. LNCS, vol. 1738, pp. 97\u2013109. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46691-6_8"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","volume":"54","author":"DE Muller","year":"1987","unstructured":"Muller, D.E., Schupp, P.E.: Alternating automata on infinite trees. Theoret. Comput. Sci. 54, 267\u2013276 (1987)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of 18th IEEE Symposium on Foundation of Computer Science (FOCS 1977), pp. 46\u201357. IEEE Computer Society (1977)","key":"7_CR17","DOI":"10.1109\/SFCS.1977.32"},{"unstructured":"Ruah, S., Fisman, D., Ben-David, S.: Automata construction for on-the-fly model checking PSL safety simple subset. Technical Report H0234, IBM Haifa Research Lab, April 2005","key":"7_CR18"},{"issue":"1\u20132","key":"7_CR19","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P Wolper","year":"1983","unstructured":"Wolper, P.: Temporal logic can be more expressive. Inf. Control 56(1\u20132), 72\u201399 (1983)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62822-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T01:05:11Z","timestamp":1604970311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-62822-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030628215","9783030628222"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62822-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lcs.ios.ac.cn\/setta2020\/","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":"20","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":"10","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":"1","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":"50% - 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":"5","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":"3","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)"}}]}}