{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:40:57Z","timestamp":1725536457403},"publisher-location":"Berlin, Heidelberg","reference-count":30,"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_4","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T01:24:37Z","timestamp":1249262677000},"page":"19-35","source":"Crossref","is-referenced-by-count":5,"title":["Inferring Dataflow Properties of User Defined Table Processors"],"prefix":"10.1007","author":[{"given":"Songtao","family":"Xia","sequence":"first","affiliation":[]},{"given":"Manuel","family":"F\u00e4hndrich","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Logozzo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"147","volume-title":"Proc. 26th ACM Symp. on Principles of Programming Languages (POPL)","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Banerjee, A., Heintze, N., Riecke, J.G.: A core calculus of dependency. In: Proc. 26th ACM Symp. on Principles of Programming Languages (POPL), pp. 147\u2013160. ACM Press, New York (1999)"},{"key":"4_CR2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison Wesley, Reading (1986)"},{"key":"4_CR3","volume-title":"Compiler Optimization for Modern Architectures: a Dependence-based Approach","author":"R. Allen","year":"2001","unstructured":"Allen, R., Kennedy, K.: Compiler Optimization for Modern Architectures: a Dependence-based Approach. Morgan Kaufmann, San Francisco (2001)"},{"key":"4_CR4","first-page":"1","volume-title":"POPL 2002: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"T. Ball","year":"2002","unstructured":"Ball, T., Rajamani, S.K.: The slam project: debugging system software via static analysis. In: POPL 2002: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 1\u20133. ACM, New York (2002)"},{"key":"4_CR5","unstructured":"Barnett, M., F\u00e4ndrich, M., Garbervetsky, D., Logozzo, F.: Annotations for (more) precise points-to analysis. In: IWACO 2007: ECOOP International Workshop on Aliasing, Confinement and Ownership in object-oriented programming (July 2007)"},{"key":"4_CR6","first-page":"25","volume-title":"POPL 1998: Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"B. Blanchet","year":"1998","unstructured":"Blanchet, B.: Escape analysis: correctness proof, implementation and experimental results. In: POPL 1998: Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 25\u201337. ACM, New York (1998)"},{"issue":"2","key":"4_CR7","first-page":"1265","volume":"1","author":"R. Chaiken","year":"2008","unstructured":"Chaiken, R., Jenkins, B., Larson, P., Ramsey, B., Shakib, D., Weaver, S., Zhou, J.: Scope: easy and efficient parallel processing of massive data sets. PVLDB\u00a01(2), 1265\u20131276 (2008)","journal-title":"PVLDB"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/357980.358007","volume":"26","author":"E.F. Codd","year":"1983","unstructured":"Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM\u00a026(1), 64\u201369 (1983)","journal-title":"Commun. ACM"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proceedings of POPL 1979 (1979)","DOI":"10.1145\/567752.567778"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL 1978 (1978)","DOI":"10.1145\/512760.512770"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Ernst, M.D.: Dynamically Discovering Likely Program Invariants. Ph.D thesis, University of Washington (2000)","DOI":"10.1145\/302405.302467"},{"key":"4_CR12","first-page":"302","volume-title":"OOPSLA 2003","author":"M.A. F\u00e4hndrich","year":"2003","unstructured":"F\u00e4hndrich, M.A., Leino, K.R.M.: Declaring and checking non-null types in an Object-Oriented language. In: OOPSLA 2003, pp. 302\u2013312. ACM Press, New York (2003)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-45251-6_29","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity","author":"C. Flanagan","year":"2001","unstructured":"Flanagan, C., Leino, K.R.M.: Houdini, an annotation assistant for ESC\/Java. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol.\u00a02021, pp. 500\u2013517. Springer, Heidelberg (2001)"},{"key":"4_CR14","first-page":"193","volume-title":"Proceedings of POPL 2001","author":"C. Flanagan","year":"2001","unstructured":"Flanagan, C., Saxe, J.B.: Avoiding exponential explosion: generating compact verification conditions. In: Proceedings of POPL 2001, pp. 193\u2013205. ACM, New York (2001)"},{"key":"4_CR15","volume-title":"POPL 2008","author":"S. Gulwani","year":"2008","unstructured":"Gulwani, S., McCloskey, B., Tiwari, A.: Lifting abstract interpreters to quantified logical domains. In: POPL 2008. ACM Press, New York (2008)"},{"issue":"6","key":"4_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/1379022.1375623","volume":"43","author":"N. Halbwachs","year":"2008","unstructured":"Halbwachs, N., P\u00e9ron, M.: Discovering properties about arrays in simple programs. SIGPLAN Not.\u00a043(6), 339\u2013348 (2008)","journal-title":"SIGPLAN Not."},{"key":"4_CR17","unstructured":"ECMA Int. Standard ECMA-355, Common Language Infrastructure (June 2006)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Isard, M., Budiu, M., Yu, Y., Birrell, A., Fetterly, D.: Dryad: Distributed data-parallel programs from sequential building blocks. In: European Conference on Computer Systems (EuroSys), Lisbon, Portugal, March 21-23. Microsoft Research, Silicon Valley (2007)","DOI":"10.1145\/1272996.1273005"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"Karr, M.: On affine relationships among variables of a program. Acta Informatica\u00a06(2), 133\u2013151 (1976)","journal-title":"Acta Informatica"},{"issue":"6","key":"4_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ipl.2004.10.015","volume":"93","author":"K. Rustan","year":"2005","unstructured":"Rustan, K., Leino, M.: Efficient weakest preconditions. Inf. Process. Lett.\u00a093(6), 281\u2013288 (2005)","journal-title":"Inf. Process. Lett."},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-78791-4_14","volume-title":"Compiler Construction","author":"F. Logozzo","year":"2008","unstructured":"Logozzo, F., F\u00e4hndrich, M.A.: On the relative completeness of bytecode analysis versus source code analysis. In: Hendren, L. (ed.) CC 2008. LNCS, vol.\u00a04959, pp. 197\u2013212. Springer, Heidelberg (2008)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Logozzo, F., F\u00e4hndrich, M.A.: Pentagons: A weakly relational abstract domain for the efficient validation of array accesses. In: SAC 2008 (2008)","DOI":"10.1145\/1363686.1363736"},{"key":"4_CR23","unstructured":"Min\u00e9, A.: Weakly Relational Numerical Abstract Domains. Ph.D thesis, \u00c9cole Polythechnique (2004)"},{"key":"4_CR24","volume-title":"Advanced Compiler Design and Implementation","author":"S.S. Muchnick","year":"1997","unstructured":"Muchnick, S.S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco (1997)"},{"key":"4_CR25","first-page":"228","volume-title":"POPL 1999: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"A.C. Myers","year":"1999","unstructured":"Myers, A.C.: Jflow: practical mostly-static information flow control. In: POPL 1999: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 228\u2013241. ACM, New York (1999)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-45657-0_9","volume-title":"Computer Aided Verification","author":"A. Pnueli","year":"2002","unstructured":"Pnueli, A., Xu, J., Zuck, L.: Liveness with (0, 1, infty)-counter abstraction. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 107\u2013122. Springer, Heidelberg (2002)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-74061-2_23","volume-title":"Static Analysis","author":"S. Sankaranarayanan","year":"2007","unstructured":"Sankaranarayanan, S., Ivancic, F., Gupta, A.: Program analysis using symbolic ranges. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 366\u2013383. Springer, Heidelberg (2007)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Saraswat, V., Nystrom, N., Palsberg, J., Grothoff, C.: Constraint types for object oriented languages. In: Proceedings of of OOPSLA 2008, ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications (2008)","DOI":"10.1145\/1449764.1449800"},{"key":"4_CR29","first-page":"115","volume-title":"CSFW14","author":"G. Smith","year":"2001","unstructured":"Smith, G.: A new type system for secure information flow. In: CSFW14, pp. 115\u2013125. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"4_CR30","first-page":"32","volume-title":"POPL 1996: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"B. Steensgaard","year":"1996","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: POPL 1996: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 32\u201341. ACM, New York (1996)"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:33:16Z","timestamp":1558456396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03237-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032363","9783642032370"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03237-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}