乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T23:28:21Z","timestamp":1699486101571},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2055,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1016\/j.tcs.2007.05.004","type":"journal-article","created":{"date-parts":[[2007,5,24]],"date-time":"2007-05-24T07:45:12Z","timestamp":1179992712000},"page":"53-82","source":"Crossref","is-referenced-by-count":2,"title":["Optimality and condensing of information flow through linear refinement"],"prefix":"10.1016","volume":"388","author":[{"given":"Fausto","family":"Spoto","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2007.05.004_b1","doi-asserted-by":"crossref","unstructured":"T. Amtoft, S. Bandhakavi, A. Banerjee, A logic for information flow in object-oriented programs, in: Proc. of 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201906, Charleston, South Carolina, USA, January 2006, pp. 91\u2013102","DOI":"10.1145\/1111037.1111046"},{"key":"10.1016\/j.tcs.2007.05.004_b2","series-title":"Proc. of Static Analysis Symposium","first-page":"100","article-title":"Information flow analysis in logical form","volume":"vol. 3148","author":"Amtoft","year":"2004"},{"issue":"1","key":"10.1016\/j.tcs.2007.05.004_b3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.scico.2006.03.002","article-title":"A logic for information flow analysis with an application to forward slicing of simple imperative programs","volume":"64","author":"Amtoft","year":"2007","journal-title":"Science of Computer Programming"},{"issue":"8","key":"10.1016\/j.tcs.2007.05.004_b4","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for Boolean function manipulation","volume":"35","author":"Bryant","year":"1986","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"10.1016\/j.tcs.2007.05.004_b5","first-page":"3","article-title":"Information flow for algol-like languages","volume":"28","author":"Clark","year":"2002","journal-title":"Computer Languages and Security"},{"key":"10.1016\/j.tcs.2007.05.004_b6","doi-asserted-by":"crossref","unstructured":"P. Cousot, R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proc. of the 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201977, 1977, pp. 238\u2013252","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/j.tcs.2007.05.004_b7","doi-asserted-by":"crossref","unstructured":"P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: Proc. of the 6th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201979, 1979, pp. 269\u2013282","DOI":"10.1145\/567752.567778"},{"issue":"7","key":"10.1016\/j.tcs.2007.05.004_b8","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1145\/359636.359712","article-title":"Certification of programs for secure information flow","volume":"20","author":"Denning","year":"1977","journal-title":"Communications of the ACM"},{"key":"10.1016\/j.tcs.2007.05.004_b9","unstructured":"S. Genaim, R. Giacobazzi, I. Mastroeni, Modeling secure information flow with Boolean functions, in: P. Ryan (Ed.), ACM SIGPLAN and GI FoMSESS Workshop on Issues in the Theory of Security, April 2004, pp. 55\u201366"},{"key":"10.1016\/j.tcs.2007.05.004_b10","doi-asserted-by":"crossref","unstructured":"S. Genaim, F. Spoto, Information flow analysis for Java Bytecode, in: R. Cousot (Ed.), Proc. of the Sixth International Conference on Verification, Model Checking and Abstract Interpretation, VMCAI\u201905, in: Lecture Notes in Computer Science, vol. 3385, Paris, France, January 2005, pp. 346\u2013362","DOI":"10.1007\/978-3-540-30579-8_23"},{"key":"10.1016\/j.tcs.2007.05.004_b11","doi-asserted-by":"crossref","unstructured":"R. Giacobazzi, I. Mastroeni, Abstract non-interference: Parameterizing non-interference by abstract interpretation, in: Proc. of the 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201904, Venice, Italy, January 2004, pp. 186\u2013197","DOI":"10.1145\/964001.964017"},{"issue":"1","key":"10.1016\/j.tcs.2007.05.004_b12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/1042038.1042040","article-title":"Making abstract domains condensing","volume":"6","author":"Giacobazzi","year":"2005","journal-title":"ACM Transactions on Computational Logic (ACM-TOCL)"},{"issue":"5","key":"10.1016\/j.tcs.2007.05.004_b13","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1145\/293677.293680","article-title":"A logical model for relational abstract domains","volume":"20","author":"Giacobazzi","year":"1998","journal-title":"ACM Transactions on Programming Languages and Systems (ACM TOPLAS)"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2007.05.004_b14","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0743-1066(92)90053-6","article-title":"Global flow analysis as a practical compilation tool","volume":"13","author":"Hermenegildo","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/j.tcs.2007.05.004_b15","doi-asserted-by":"crossref","unstructured":"S. Hunt, D. Sands, On flow-sensitive security types, in: Proc. of 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201906, Charleston, South Carolina, USA, January 2006, pp. 79\u201390","DOI":"10.1145\/1111037.1111045"},{"issue":"6","key":"10.1016\/j.tcs.2007.05.004_b16","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1017\/S0956796897002906","article-title":"Trust in the \u03bb-calculus","volume":"7","author":"\u00d8 rb\u00e6k","year":"1997","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"10.1016\/j.tcs.2007.05.004_b17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/JSAC.2002.806121","article-title":"Language-based information-flow security","volume":"21","author":"Sabelfeld","year":"2003","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1","key":"10.1016\/j.tcs.2007.05.004_b18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1011553200337","article-title":"A PER model of secure information flow in sequential programs","volume":"14","author":"Sabelfeld","year":"2001","journal-title":"Higher-Order and Symbolic Computation"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2007.05.004_b19","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0304-3975(00)00316-9","article-title":"Logical optimality of groundness analysis","volume":"277","author":"Scozzari","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.05.004_b20","doi-asserted-by":"crossref","unstructured":"M.C. Sekar, P. Mishra, I.V. Ramakrishnan, On the power and limitation of strictness analysis based on abstract interpretation, in: Proc. of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201991, Orlando, Florida, January 1991, pp. 37\u201348","DOI":"10.1145\/99583.99591"},{"key":"10.1016\/j.tcs.2007.05.004_b21","doi-asserted-by":"crossref","unstructured":"F. Spoto, Information flow is linear refinement of constancy, in: Proc. of the International Colloquium on Theoretical Aspects of Computing, ICTAC\u201905, October 2005, Hanoi, Vietnam, in: Lecture Notes in Computer Science, vol. 3722, pp. 351\u2013365","DOI":"10.1007\/11560647_23"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2007.05.004_b22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/JCS-1996-42-304","article-title":"A sound type system for secure flow analysis","volume":"4","author":"Volpano","year":"1996","journal-title":"Journal of Computer Security"},{"key":"10.1016\/j.tcs.2007.05.004_b23","series-title":"The Formal Semantics of Programming Languages","author":"Winskel","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507004100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507004100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:03:54Z","timestamp":1556438634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397507004100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["S0304397507004100"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2007.05.004","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}