{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:40:56Z","timestamp":1743025256119,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_20","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T23:02:35Z","timestamp":1561244555000},"page":"323-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Multiresolution Analysis of Flow Graphs"],"prefix":"10.1007","author":[{"given":"Steve","family":"Huntsman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0019-9958(76)90390-9","volume":"31","author":"ES Bainbridge","year":"1976","unstructured":"Bainbridge, E.S.: Feedback and generalized logic. Inf. Control 31, 75 (1976)","journal-title":"Inf. Control"},{"key":"20_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-1-84800-998-1"},{"key":"20_CR3","first-page":"21","volume":"11S","author":"B Boissinot","year":"2012","unstructured":"Boissinot, B., et al.: SSI properties revisited. ACM TECS 11S, 21 (2012)","journal-title":"ACM TECS"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"A1","DOI":"10.37236\/919","volume":"15","author":"R Brown","year":"2008","unstructured":"Brown, R., et al.: Graphs of morphisms of graphs. Electron. J. Comb. 15, A1 (2008)","journal-title":"Electron. J. Comb."},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-22110-1_37","volume-title":"Computer Aided Verification","author":"D Brumley","year":"2011","unstructured":"Brumley, D., Jager, I., Avgerinos, T., Schwartz, E.J.: BAP: a binary analysis platform. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 463\u2013469. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_37"},{"key":"20_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12821-9","volume-title":"New Structures for Physics","year":"2010","unstructured":"Coecke, B. (ed.): New Structures for Physics. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12821-9"},{"key":"20_CR7","volume-title":"Engineering a Compiler","author":"KD Cooper","year":"2012","unstructured":"Cooper, K.D., Torczon, L.: Engineering a Compiler, 2nd edn. Morgan Kaufmann, Burlington (2012)","edition":"2"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Delaney, C., Marcolli, M.: Dyson-Schwinger equations in the theory of computation. In: \u00c1lvarez-C\u00f3nsul, L., Burgos-Gil, J.I., Ebrahimi-Fard, K. (eds.) AMS Feynman Amplitudes, Periods, and Motives (2015)","DOI":"10.1090\/conm\/648\/12999"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.tcs.2006.03.023","volume":"360","author":"DJ Dougherty","year":"2006","unstructured":"Dougherty, D.J., Guti\u00e9rrez, C.: Normal forms for binary relations. Theor. Comput. Sci. 360, 228 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303 (1965)","journal-title":"J. Math. Anal. Appl."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0166-218X(83)90040-9","volume":"5","author":"S Fugishige","year":"1983","unstructured":"Fugishige, S.: Canonical decompositions of symmetric submodular systems. Discret. Appl. Math. 5, 175 (1983)","journal-title":"Discret. Appl. Math."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Gulwani, S.: Dimensions in program synthesis. In: PPDP (2010)","DOI":"10.1145\/1836089.1836091"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77\u201390. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44541-2_8"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 135 (1973)","journal-title":"SIAM J. Comput."},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Johnson, R., Pearson, D., Pingali, K.: The program structure tree: computing control regions in linear time. In: PLDI (1994)","DOI":"10.1145\/178243.178258"},{"key":"20_CR16","volume-title":"Basic Concepts of Enriched Category Theory","author":"GM Kelly","year":"1982","unstructured":"Kelly, G.M.: Basic Concepts of Enriched Category Theory. Cambridge University Press, Cambridge (1982)"},{"key":"20_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525896","volume-title":"Higher Operads, Higher Categories","author":"T Leinster","year":"2004","unstructured":"Leinster, T.: Higher Operads, Higher Categories. Cambridge University Press, Cambridge (2004)"},{"key":"20_CR18","volume-title":"Categories for the Working Mathematician","author":"S MacLane","year":"2010","unstructured":"MacLane, S.: Categories for the Working Mathematician, 2nd edn. Springer, Heidelberg (2010)","edition":"2"},{"key":"20_CR19","unstructured":"Manin, Yu.I.: Renormalization and computation I: motivation and background. arXiv:0904.4921 (2009)"},{"key":"20_CR20","unstructured":"Markl, M., Shnider, S., Stasheff, J.: Operads in Algebra, Topology and Physics. AMS (2002)"},{"key":"20_CR21","volume-title":"Advanced Compiler Design and Implementation","author":"SS Muchnick","year":"1997","unstructured":"Muchnick, S.S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, Burlington (1997)"},{"key":"20_CR22","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"2010","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (2010)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-19589-1_2","volume-title":"Web Services and Formal Methods","author":"A Polyvyanyy","year":"2011","unstructured":"Polyvyanyy, A., Vanhatalo, J., V\u00f6lzer, H.: Simplified computation and generalization of the refined process structure tree. In: Bravetti, M., Bultan, T. (eds.) WS-FM 2010. LNCS, vol. 6551, pp. 25\u201341. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19589-1_2"},{"key":"20_CR24","unstructured":"Rupel, D., Spivak, D.I.: The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes. arXiv:1307.6894 (2013)"},{"key":"20_CR25","unstructured":"Spivak, D.I.: The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits. arXiv:1305.0297 (2013)"},{"key":"20_CR26","first-page":"630","volume":"51","author":"J Stasheff","year":"2004","unstructured":"Stasheff, J.: What is an operad? Not. AMS 51, 630 (2004)","journal-title":"Not. AMS"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E., Valdes, J.: Prime subprogram parsing of a program. In: POPL (1980)","DOI":"10.1145\/567446.567456"},{"key":"20_CR28","unstructured":"Tsin, Y.H.: Decomposing a multigraph into split components. In: CATS (2012)"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.datak.2009.02.015","volume":"68","author":"J Vanhatalo","year":"2009","unstructured":"Vanhatalo, J., V\u00f6lzer, H., Koehler, J.: The refined process structure tree. Data Knowl. Eng. 68, 793 (2009)","journal-title":"Data Knowl. Eng."},{"key":"20_CR30","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1109\/TSE.2004.1274043","volume":"30","author":"F Zhang","year":"2004","unstructured":"Zhang, F., D\u2019Hollander, E.H.: Using hammock graphs to structure programs. IEEE Trans. Soft. Eng. 30, 231 (2004)","journal-title":"IEEE Trans. Soft. Eng."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T11:34:05Z","timestamp":1610019245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","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":"60","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":"41","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":"6","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":"68% - 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,3","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":"8","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)"}}]}}