{"id":122,"date":"2012-05-28T09:45:05","date_gmt":"2012-05-28T08:45:05","guid":{"rendered":"http:\/\/sites.google.com\/feeds\/content\/site\/tcsunica\/2147129464772086325"},"modified":"2013-11-22T15:37:24","modified_gmt":"2013-11-22T14:37:24","slug":"seminar-nominal-automata-for-resource-usage-control","status":"publish","type":"post","link":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/2012\/05\/28\/seminar-nominal-automata-for-resource-usage-control\/","title":{"rendered":"Seminar: Nominal Automata for Resource Usage Control"},"content":{"rendered":"<div><table cellspacing=\"0\" class=\"sites-layout-name-one-column sites-layout-hbox\"><tbody><tr><td class=\"sites-layout-tile sites-tile-name-content-1\"><div dir=\"ltr\"><div><div style=\"text-align:center\"><div style=\"text-align:center\"><font size=\"2\">Upcoming <span>Seminar<\/span><br><\/font><\/div><\/div><font size=\"2\"><span><br><\/span><\/font><div style=\"text-align:center\"><div style=\"text-align:center\"><b><font size=\"2\">Nominal Automata for Resource Usage Control<\/font><\/b><font size=\"2\"><br><\/font><\/div><\/div><font size=\"2\"><span><br><\/span><\/font><div style=\"text-align:center\"><font size=\"2\">May 29th, <\/font><font size=\"2\">12.00<\/font><font size=\"2\"><br>Aula F, Palazzo delle Scienze - Cagliari<br><\/font><\/div><\/div><div><font size=\"2\"><span><br><\/span><\/font><div style=\"text-align:center\"><font size=\"2\"><b><span>Pierpaolo Degano<br><\/span><\/b><\/font><\/div><\/div><div><font size=\"2\">Dipartimento di Informatica - Universit\u00e0 di Pisa<\/font><font size=\"2\"><br><\/font><\/div><div><font size=\"2\"><br><\/font><\/div><font size=\"2\"><br><b>Abstract.<\/b> <\/font><span>Two classes of nominal automata, namely Usage Automata (UAs) and Variable<\/span> <span>Finite Automata (VFAs) are considered to express resource control policies<\/span><br><span>over program execution traces expressed by a nominal calculus (Usages).<\/span><br><span><br>We first discuss some closure properties of UAs, and then show UAs less<\/span> <span>expressive than VFAs.<\/span><br><span><br>We finally carry over to VFAs the symbolic technique for model checking<\/span> <span>Usages against UAs, so making it possible to verify the compliance of a<\/span> <span>program with a larger class of security properties.<\/span><br style=\"font-family:verdana,sans-serif\"><br><\/div><\/td><\/tr><\/tbody><\/table><\/div>","protected":false},"excerpt":{"rendered":"<table cellspacing=\"0\">\n<tbody>\n<tr>\n<td>\n<div dir=\"ltr\">\n<div>\n<div>\n<div>Upcoming <span>Seminar<\/span><\/div>\n<\/div>\n<p><span><br \/><\/span><\/p>\n<div>\n<div><b>Nominal Automata for Resource Usage Control<\/b><\/div>\n<\/div>\n<p><span><br \/><\/span><\/p>\n<div>May 29th, 12.00<br \/>Aula F, Palazzo delle Scienze &#8211; Cagliari<\/div>\n<\/div>\n<div><span><br \/><\/span><\/p>\n<div><b><span>Pierpaolo Degano<br \/><\/span><\/b><\/div>\n<\/div>\n<div>Dipartimento di Informatica &#8211; Universit&agrave; di Pisa<\/div>\n<div><\/div>\n<p><b>Abstract.<\/b> <span>Two classes of nominal automata, namely Usage Automata (UAs) and Variable<\/span> <span>Finite Automata (VFAs) are considered to express resource control policies<\/span><br \/><span>over program execution traces expressed by a nominal calculus (Usages).<\/span><br \/><span><br \/>We first discuss some closure properties of UAs, and then show UAs less<\/span> <span>expressive than VFAs.<\/span><br \/><span><br \/>We finally carry over to VFAs the symbolic technique for model checking<\/span> <span>Usages against UAs, so making it possible to verify the compliance of a<\/span> <span>program with a larger class of security properties.<\/span><\/p>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"author":1325,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[10,13],"tags":[],"class_list":["post-122","post","type-post","status-publish","format-standard","hentry","category-events","category-httpschemas-google-comsites2008announcement","category-10-id","category-13-id","post-seq-1","post-parity-odd","meta-position-corners","fix"],"_links":{"self":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/122","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/users\/1325"}],"replies":[{"embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/comments?post=122"}],"version-history":[{"count":1,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/122\/revisions"}],"predecessor-version":[{"id":140,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/122\/revisions\/140"}],"wp:attachment":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/media?parent=122"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/categories?post=122"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/tags?post=122"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}