{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:41:48Z","timestamp":1743133308120,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319415277"},{"type":"electronic","value":"9783319415284"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-41528-4_8","type":"book-chapter","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T09:34:06Z","timestamp":1468316046000},"page":"136-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast, Flexible, and Minimal CTL Synthesis via SMT"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Klenze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Bayless","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan J.","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,13]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Attie, P., Cherri, A., Dak Al Bab, K., Sakr, M., Saklawi, J.: Model and program repair via SAT solving. In: Formal Methods and Models for Codesign (MEMOCODE), pp. 148\u2013157. ACM\/IEEE (2015)","DOI":"10.1109\/MEMCOD.2015.7340481"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-48320-9_11","volume-title":"CONCUR 1999. Concurrency Theory","author":"PC Attie","year":"1999","unstructured":"Attie, P.C.: Synthesis of large concurrent programs via pairwise composition. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 130\u2013145. Springer, Heidelberg (1999)"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/271510.271519","volume":"20","author":"PC Attie","year":"1998","unstructured":"Attie, P.C., Emerson, E.A.: Synthesis of concurrent systems with many similar processes. ACM Trans. Program. Lang. Sys. (TOPLAS) 20(1), 51\u2013115 (1998)","journal-title":"ACM Trans. Program. Lang. Sys. (TOPLAS)"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/383043.383044","volume":"23","author":"PC Attie","year":"2001","unstructured":"Attie, P.C., Emerson, E.A.: Synthesis of concurrent programs for an atomic read\/write model of computation. ACM Trans. Program. Lang. Sys. (TOPLAS) 23(2), 187\u2013242 (2001)","journal-title":"ACM Trans. Program. Lang. Sys. (TOPLAS)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bayless, S., Bayless, N., Hoos, H.H., Hu, A.J.: SAT modulo monotonic theories. In: Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9755"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48683-6_25","volume-title":"Computer Aided Verification","author":"G Bruns","year":"1999","unstructured":"Bruns, G., Godefroid, P.: Model checking partial state spaces with 3-valued temporal logics. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 274\u2013287. Springer, Heidelberg (1999)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/635499.635502","volume":"4","author":"D Bustan","year":"2003","unstructured":"Bustan, D., Grumberg, O.: Simulation-based minimization. ACM Trans. Comput. Logic 4(2), 181\u2013206 (2003)","journal-title":"ACM Trans. Comput. Logic"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E Clarke","year":"1982","unstructured":"Clarke, E., Emerson, E.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logics of Programs. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"issue":"10","key":"8_CR9","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1145\/362759.362813","volume":"14","author":"PJ Courtois","year":"1971","unstructured":"Courtois, P.J., Heymans, F., Parnas, D.L.: Concurrent control with readers and writers. Commun. ACM 14(10), 667\u2013668 (1971)","journal-title":"Commun. ACM"},{"issue":"3\u20134","key":"8_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.3233\/FI-2012-758","volume":"120","author":"E De Angelis","year":"2012","unstructured":"De Angelis, E., Pettorossi, A., Proietti, M.: Synthesizing concurrent programs using answer set programming. Fundamenta Informaticae 120(3\u20134), 205\u2013229 (2012)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-10452-7_3","volume-title":"Formal Methods: Foundations and Applications","author":"L de Moura","year":"2009","unstructured":"de Moura, L., Bj\u00f8rner, N.: Satisfiability modulo theories: an appetizer. In: Oliveira, M.V.M., Woodcock, J. (eds.) SBMF 2009. LNCS, vol. 5902, pp. 23\u201336. Springer, Heidelberg (2009)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. In: Symposium on Theory of Computing, STOC 1982, pp. 169\u2013180. ACM (1982)","DOI":"10.1145\/800070.802190"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260\u2013265. Springer, Heidelberg (2007)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11560586_23","volume-title":"Theoretical Computer Science","author":"S Heymans","year":"2005","unstructured":"Heymans, S., Van Nieuwenborgh, D., Hadavandi, E.: Synthesis from temporal specifications using preferred answer set programming. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 280\u2013294. Springer, Heidelberg (2005)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-28756-5_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Jacobs","year":"2012","unstructured":"Jacobs, S., Bloem, R.: Parameterized synthesis. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 362\u2013376. Springer, Heidelberg (2012)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S1571-0661(04)00214-2","volume":"52","author":"A Martin","year":"2002","unstructured":"Martin, A.: Adequate sets of temporal connectives in CTL. Electron. Notes Theor. Comput. Sci. 52(1), 21\u201331 (2002). EXPRESS 2001, 8th International Workshop on Expressiveness in Concurrency (Satellite Event of CONCUR 2001)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-75596-8_33","volume-title":"Automated Technology for Verification and Analysis","author":"S Schewe","year":"2007","unstructured":"Schewe, S., Finkbeiner, B.: Bounded synthesis. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 474\u2013488. Springer, Heidelberg (2007)"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.3233\/SAT190034","volume":"3","author":"R Sebastiani","year":"2007","unstructured":"Sebastiani, R.: Lazy satisfiability modulo theories. J. Satisfiability Boolean Model. Comput. (JSAT) 3, 141\u2013224 (2007)","journal-title":"J. Satisfiability Boolean Model. Comput. (JSAT)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41528-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T00:09:40Z","timestamp":1656806980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41528-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319415277","9783319415284"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41528-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"13 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}