{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:41:10Z","timestamp":1725536470220},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032363"},{"type":"electronic","value":"9783642032370"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03237-0_5","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T01:24:37Z","timestamp":1249262677000},"page":"36-51","source":"Crossref","is-referenced-by-count":5,"title":["Polymorphic Fractional Capabilities"],"prefix":"10.1007","author":[{"given":"Hirotoshi","family":"Yasuoka","sequence":"first","affiliation":[]},{"given":"Tachio","family":"Terauchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"GNU Linear Programming Kit, http:\/\/www.gnu.org\/software\/glpk\/glpk.html"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bierhoff, K., Aldrich, J.: Modular typestate checking of aliased objects. In: Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA, pp. 301\u2013320 (2007)","DOI":"10.1145\/1297027.1297050"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bornat, R., Calcagno, C., O\u2019Hearn, P., Parkinson, M.: Permission accounting in separation logic. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, pp. 259\u2013270 (2005)","DOI":"10.1145\/1047659.1040327"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44898-5_4","volume-title":"Static Analysis","author":"J. Boyland","year":"2003","unstructured":"Boyland, J.: Checking interference with fractional permissions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 55\u201372. Springer, Heidelberg (2003)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Crary, K., Walker, D., Morrisett, G.: Typed memory management in a calculus of capabilities. In: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, pp. 262\u2013275 (1999)","DOI":"10.1145\/292540.292564"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Foster, J.S., Terauchi, T., Aiken, A.: Flow-sensitive type qualifiers. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp. 1\u201312 (2002)","DOI":"10.1145\/512529.512531"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-76637-7_13","volume-title":"Programming Languages and Systems","author":"D. Kikuchi","year":"2007","unstructured":"Kikuchi, D., Kobayashi, N.: Type-based verification of correspondence assertions for communication protocols. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol.\u00a04807, pp. 191\u2013205. Springer, Heidelberg (2007)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Pratikakis, P., Foster, J.S., Hicks, M.: Locksmith: context-sensitive correlation analysis for race detection. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp. 320\u2013331 (2006)","DOI":"10.1145\/1133981.1134019"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Rehof, J., F\u00e4hndrich, M.: Type-base flow analysis: from polymorphic subtyping to cfl-reachability. In: Proceedings of the 23th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, pp. 54\u201366 (2001)","DOI":"10.1145\/373243.360208"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Terauchi, T.: Checking race freedom via linear programming. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp. 1\u201310 (2008)","DOI":"10.1145\/1375581.1375583"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Terauchi, T.: A type system for observational determinism. In: Proceedings of the 21st IEEE Computer Security Foundations Symposium, CSF, pp. 287\u2013300 (2008)","DOI":"10.1109\/CSF.2008.9"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Terauchi, T., Aiken, A.: Witnessing side-effects. In: Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP, pp. 105\u2013115 (2005)","DOI":"10.1145\/1086365.1086379"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Terauchi, T., Aiken, A.: A capability calculus for concurrency and determinism. ACM Trans. Program. Lang. Syst. (2008)","DOI":"10.1145\/1387673.1387676"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-78739-6_22","volume-title":"Programming Languages and Systems","author":"T. Terauchi","year":"2008","unstructured":"Terauchi, T., Megacz, A.: Inferring channel buffer bounds via linear programming. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 284\u2013298. Springer, Heidelberg (2008)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Tofte, M., Talpin, J.P.: Implementation of the typed call-by-value \u03bb-calculus using a stack of regions. In: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, pp. 188\u2013201 (1994)","DOI":"10.1145\/174675.177855"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Yasuoka, H., Terauchi, T.: Polymorphic fractional capabilities(long version) (2008), http:\/\/www.kb.ecei.tohoku.ac.jp\/~yasuoka\/papers\/polyfrac.pdf","DOI":"10.1007\/978-3-642-03237-0_5"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03237-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:33:22Z","timestamp":1558456402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03237-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032363","9783642032370"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03237-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}