{"id":2176,"date":"2012-09-11T01:57:21","date_gmt":"2012-09-11T01:57:21","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=2176"},"modified":"2013-03-08T05:48:12","modified_gmt":"2013-03-08T05:48:12","slug":"proving-concurrent-noninterference","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/proving-concurrent-noninterference\/","title":{"rendered":"Rese\u00f1a: Proving concurrent noninterference"},"content":{"rendered":"<p>En la <a href=\"http:\/\/cpp12.kuis.kyoto-u.ac.jp\/\">CPP 2012<\/a> (<i>The Second International Conference on Certified Programs and Proofs<\/i>), que comenzar\u00e1 el 13 de diciembre, se presentar\u00e1 un trabajo de verificaci\u00f3n formal en <a href=\"http:\/\/www.cl.cam.ac.uk\/research\/hvg\/isabelle\/\">Isabelle\/HOL<\/a> titulado <a href=\"http:\/\/www21.in.tum.de\/~nipkow\/pubs\/cpp12.pdf\">Proving concurrent noninterference<\/a>.<\/p>\n<p>Sus autores son <a href=\"http:\/\/www21.in.tum.de\/~popescua\">Andrei Popescu<\/a>, <a href=\"http:\/\/home.in.tum.de\/~hoelzl\">Johannes H\u00f6lzl<\/a> y <a href=\"http:\/\/www21.in.tum.de\/~nipkow\">Tobias Nipkow<\/a> (del grupo de demostraci\u00f3n autom\u00e1tica (<a href=\"http:\/\/www4.in.tum.de\/proj\/theoremprov\/group.html\">Theorem Proving Group<\/a>) de la Universidad de Munich).<\/p>\n<p>Su resumen es<\/p>\n<blockquote><p>\nWe perform a formal analysis of compositionality techniques for proving possibilistic noninterference for a while language with parallel composition. We develop a uniform framework where we express a wide range of noninterference variants from the literature and compare them w.r.t. their contracts: the strength of the security properties they ensure weighed against the harshness of the syntactic conditions they enforce. This results in a simple implementable algorithm for proving that a program has a specific noninterference property, using only compositionality, which captures uniformly several security type-system results from the literature and suggests a further improved type system. All formalism and theorems have been mechanically verified in Isabelle\/HOL.\n<\/p><\/blockquote>\n<p>Este trabajo forma parte del proyecto <a href=\"http:\/\/www4.in.tum.de\/~popescua\/secded.html\">Security Type Systems and Deduction<\/a><\/p>\n<p>El c\u00f3digo con las teor\u00edas correspondiente se encuentra <a href=\"http:\/\/afp.sourceforge.net\/entries\/Possibilistic_Noninterference.shtml\">aqu\u00ed<\/a>. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>En la CPP 2012 (The Second International Conference on Certified Programs and Proofs), que comenzar\u00e1 el 13 de diciembre, se presentar\u00e1 un trabajo de verificaci\u00f3n formal en Isabelle\/HOL titulado Proving concurrent noninterference. Sus autores son Andrei Popescu, Johannes H\u00f6lzl y Tobias Nipkow (del grupo de demostraci\u00f3n autom\u00e1tica (Theorem Proving Group) de la Universidad de Munich)&#8230;.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[100],"tags":[144,285,275],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_likes_enabled":false,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2176"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/comments?post=2176"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2176\/revisions"}],"predecessor-version":[{"id":2778,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2176\/revisions\/2778"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=2176"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=2176"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=2176"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}