{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:23:23Z","timestamp":1779074603076,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540255215","type":"print"},{"value":"9783540320043","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32004-3_20","type":"book-chapter","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T17:15:56Z","timestamp":1278868556000},"page":"193-209","source":"Crossref","is-referenced-by-count":95,"title":["A Theorem Proving Approach to Analysis of Secure Information Flow"],"prefix":"10.1007","author":[{"given":"\u00c1d\u00e1m","family":"Darvas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reiner","family":"H\u00e4hnle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Darvas, \u00c1., H\u00e4hnle, R., Sands, D.: A theorem proving approach to analysis of secure information flow. Technical Report 2004-01, Department of Computing Science, Chalmers University of Technology and G\u00f6teborg University (2004)"},{"key":"#cr-split#-20_CR2.1","doi-asserted-by":"crossref","unstructured":"Ahrendt, W., Baar, T., Beckert, B., Bubel, R., Giese, M., H??hnle, R., Menzel, W., Mostowski, W., Roth, A., Schlager, S., Schmitt, P.H.: The KeY tool. Software and System Modeling (2004);","DOI":"10.1007\/s10270-004-0058-x"},{"key":"#cr-split#-20_CR2.2","unstructured":"Online First issue, to appear in print"},{"key":"20_CR3","unstructured":"Barthe, G., D\u2019Argenio, P.R., Rezk, T.: Secure information flow by self-composition. In: Proc. 17th IEEE Comp. Sec. Founds. Workshop (2004)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Beckert, B.: A dynamic logic for the formal verification of Java Card programs. Java on Smart Cards: Programming and Security, 6\u201324 (2001)","DOI":"10.1007\/3-540-45165-X_2"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-36578-8_18","volume-title":"Fundamental Approaches to Software Engineering","author":"B. Beckert","year":"2003","unstructured":"Beckert, B., Mostowski, W.: A program logic for handling JAVA cARD\u2019s transaction mechanism. In: Pezz\u00e9, M. (ed.) FASE 2003. LNCS, vol.\u00a02621, pp. 246\u2013260. Springer, Heidelberg (2003)"},{"key":"20_CR6","first-page":"297","volume-title":"Foundations of Secure Computation","author":"E.S. Cohen","year":"1978","unstructured":"Cohen, E.S.: Information transmission in sequential programs. In: Foundations of Secure Computation, pp. 297\u2013335. Academic Press, London (1978)"},{"issue":"7","key":"20_CR7","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"D.E. Denning","year":"1977","unstructured":"Denning, D.E., Denning, P.J.: Certification of programs for secure information flow. Commun. ACM\u00a020(7), 504\u2013513 (1977)","journal-title":"Commun. ACM"},{"key":"20_CR8","unstructured":"Detlefs, D.L., Nelson, G., Saxe, J.B.: A theorem prover for program checking. Research report 178, Compaq SRC (2002)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Giacobazzi, R., Mastroeni, I.: Proving abstract non-interference. In: Conf. of the European Association for Computer Science Logic, pp. 280\u2013294 (2004)","DOI":"10.1007\/978-3-540-30124-0_23"},{"key":"20_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"issue":"1\u20133","key":"20_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0167-6423(99)00024-6","volume":"37","author":"R. Joshi","year":"2000","unstructured":"Joshi, R., Leino, K.R.M.: A semantic approach to secure information flow. Science of Computer Programming\u00a037(1\u20133), 113\u2013138 (2000)","journal-title":"Science of Computer Programming"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"J\u00fcrjens, J.: UMLsec: Extending UML for secure systems development. In: Proc.UML, pp. 412\u2013425 (2002)","DOI":"10.1007\/3-540-45800-X_32"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Myers, A.C.: JFlow: Practical mostly-static information flow control. In: Proc.POPL , pp. 228\u2013241(January 1999)","DOI":"10.1145\/292540.292561"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Pottier, F., Simonet, V.: Information flow inference for ML. In: Proc. POPL, pp. 319\u2013330 (January 2002)","DOI":"10.1145\/503272.503302"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/596980.596983","volume":"25","author":"F. Pottier","year":"2003","unstructured":"Pottier, F., Simonet, V.: Information flow inference for ML. ACM Trans. on Progr. Langs. and Systems\u00a025(1), 117\u2013158 (2003)","journal-title":"ACM Trans. on Progr. Langs. and Systems"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE J. Selected Areas in Communication\u00a021(1) (January 2003)","DOI":"10.1109\/JSAC.2002.806121"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1011553200337","volume":"14","author":"A. Sabelfeld","year":"2001","unstructured":"Sabelfeld, A., Sands, D.: A per model of secure information flow in sequential programs. Higher-Order and Symbolic Computation\u00a014(1), 59\u201391 (2001)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"20_CR18","unstructured":"Stenzel, K.: Verification of JavaCard programs. Technical report 2001-5, Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, Germany (2001)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Eliminating covert flows with minimum typings. In: Proc. IEEE Comp. Sec. Founds. Workshop, pp. 156\u2013168 (June 1997)","DOI":"10.1109\/CSFW.1997.596807"}],"container-title":["Lecture Notes in Computer Science","Security in Pervasive Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32004-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:33:53Z","timestamp":1605742433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32004-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255215","9783540320043"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32004-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}