{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:51Z","timestamp":1760202651394},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370748"},{"type":"electronic","value":"9783642370755"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37075-5_20","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:37:23Z","timestamp":1361216243000},"page":"305-320","source":"Crossref","is-referenced-by-count":8,"title":["Type-Based Complexity Analysis for Fork Processes"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Hainry","sequence":"first","affiliation":[]},{"given":"Jean-Yves","family":"Marion","sequence":"additional","affiliation":[]},{"given":"Romain","family":"P\u00e9choux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.entcs.2006.05.005","volume":"154","author":"R.M. Amadio","year":"2006","unstructured":"Amadio, R.M., Dabrowski, F.: Feasible reactivity for synchronous cooperative threads. Electron. Notes Theor. Comput. Sci.\u00a0154(3), 33\u201343 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/1273920.1273951","volume-title":"Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2007","author":"R.M. Amadio","year":"2007","unstructured":"Amadio, R.M., Dabrowski, F.: Feasible reactivity in a synchronous pi-calculus. In: Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2007, pp. 221\u2013230. ACM, New York (2007)"},{"key":"20_CR3","unstructured":"Biba, K.: Integrity considerations for secure computer systems. Technical report, Mitre corp Rep. (1977)"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/28395.28409","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987","author":"S.R. Buss","year":"1987","unstructured":"Buss, S.R.: The boolean formula value problem is in ALOGTIME. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 123\u2013131. ACM, New York (1987)"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.entcs.2010.08.017","volume":"265","author":"R. Cockett","year":"2010","unstructured":"Cockett, R., Redmond, B.: A categorical setting for lower complexity. Electron. Notes Theor. Comput. Sci.\u00a0265, 277\u2013300 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Gaboardi, M., Marion, J.-Y., Ronchi Della Rocca, S.: A logical account of PSPACE. In: POPL 2008, pp. 121\u2013131. ACM (2008)","DOI":"10.1145\/1328897.1328456"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1017\/S0956796800003889","volume":"11","author":"N.D. Jones","year":"2001","unstructured":"Jones, N.D.: The expressive power of higher-order types or, life without cons. J. Funct. Program.\u00a011(1), 5\u201394 (2001)","journal-title":"J. Funct. Program."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Jones, N.D., Kristiansen, L.: A flow calculus of wp-bounds for complexity analysis. ACM Trans. Comput. Log.\u00a010(4) (2009)","DOI":"10.1145\/1555746.1555752"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R.E. Ladner","year":"1980","unstructured":"Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM\u00a027(4), 831\u2013838 (1980)","journal-title":"J. ACM"},{"issue":"1-2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y. Lafont","year":"2004","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theor. Comput. Sci.\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Di Giamberardino, P.: Soft session types. In: EXPRESS 2011. EPTCS, vol.\u00a064, pp. 59\u201373 (2011)","DOI":"10.4204\/EPTCS.64.5"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Martini, S., Sangiorgi, D.: Light logics and higher-order processes. In: EXPRESS 2010. EPTCS, vol.\u00a041, pp. 46\u201360 (2010)","DOI":"10.4204\/EPTCS.41.4"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BFb0022277","volume-title":"Computer Science Logic","author":"D. Leivant","year":"1995","unstructured":"Leivant, D., Marion, J.-Y.: Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 486\u2013500. Springer, Heidelberg (1995)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BFb0030611","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"D. Leivant","year":"1997","unstructured":"Leivant, D., Marion, J.-Y.: Predicative Functional Recurrence and Poly-Space. In: Bidoit, M., Dauchet, M. (eds.) TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 369\u2013380. Springer, Heidelberg (1997)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Madet, A.: A polynomial time lambda-calculus with multithreading and side effects. In: PPDP (2012)","DOI":"10.1145\/2370776.2370785"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Marion, J.-Y.: A type system for complexity flow analysis. In: LICS, pp. 123\u2013132 (2011)","DOI":"10.1109\/LICS.2011.41"},{"issue":"4","key":"20_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1555746.1555753","volume":"10","author":"J.-Y. Moyen","year":"2009","unstructured":"Moyen, J.-Y.: Resource control graphs. ACM Trans. Comput. Logic\u00a010(4), 29:1\u201329:44 (2009)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"5","key":"20_CR19","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S0097539704445597","volume":"35","author":"K.-H. Niggl","year":"2006","unstructured":"Niggl, K.-H., Wunderlich, H.: Certifying polynomial time and linear\/polynomial space for imperative programs. SIAM J. Comput.\u00a035(5), 1122\u20131147 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/JSAC.2002.806121","volume":"21","author":"A. Sabelfeld","year":"2003","unstructured":"Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE J. Selected Areas in Communications\u00a021(1), 5\u201319 (2003)","journal-title":"IEEE J. Selected Areas in Communications"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationship between nondeterministic and deterministic tape classes. JCSS\u00a04, 177\u2013192 (1970)","journal-title":"JCSS"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Secure information flow in a multi-threaded imperative language. In: POPL, pp. 355\u2013364. ACM (1998)","DOI":"10.1145\/268946.268975"},{"issue":"2\/3","key":"20_CR23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/JCS-1996-42-304","volume":"4","author":"D. Volpano","year":"1996","unstructured":"Volpano, D., Irvine, C., Smith, G.: A sound type system for secure flow analysis. Journal of Computer Security\u00a04(2\/3), 167\u2013188 (1996)","journal-title":"Journal of Computer Security"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37075-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T15:55:49Z","timestamp":1688054149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37075-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370748","9783642370755"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37075-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}