<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" media="screen" href="/styles/xslt/rss.xslt"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:media="http://search.yahoo.com/mrss/" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:c9="http://channel9.msdn.com">
<channel>
	<title>Comment Feed for Channel 9 - Juan Chen and Nikhil Swamy: FINE, Functional Programming for End-to-End Security Verification</title>
	<atom:link rel="self" type="application/rss+xml" href="http://channel9.msdn.com/Blogs/Peli/FINE-a-Compiler-for-End-to-End-Security-Verification/RSS"></atom:link>
	<image>
		<url>http://ecn.channel9.msdn.com/o9/ch9/5/1/1/0/1/5/fine_512_ch9.png</url>
		<title>Channel 9 - Juan Chen and Nikhil Swamy: FINE, Functional Programming for End-to-End Security Verification</title>
		<link></link>
	</image>
	<description> Juan Chen&amp;nbsp;and Nikhil Swamy, two researchers at the Research in Software Engineering group, present FINE,&amp;nbsp;a new&amp;nbsp;programming language for .NET.Software systems are governed by increasingly complex security policies. Ensuring that a system properly enforces its policy is hard. FINE is a new programming language (similar to F#) whose type system can be used to check that rich, stateful authorization and information flow policies are properly enforced. FINE is compiled to DCIL, a new minimal extension of .NET CIL. Our compiler carries type information throughout and allows DCIL programs to be verified independently for security.In&amp;nbsp;this video, Juan an Nikhil give the big picture and a shiny demo of FINE. Try Fine in your web browser at http://rise4fun.com/fine!FINE home page Read the article about FINE &amp;nbsp;The&amp;nbsp;Research in Software Engineering team (RiSE) coordinates Microsoft&#39;s research in Software Engineering in Redmond, USA. </description>
	<link></link>
	<language>en</language>
	<pubDate>Wed, 22 May 2013 17:51:01 GMT</pubDate>
	<lastBuildDate>Wed, 22 May 2013 17:51:01 GMT</lastBuildDate>
	<generator>Rev9</generator>
	<item>
		<title>Re: Juan Chen and Nikhil Swamy: FINE, Functional Programming for End-to-End Security Verification</title>
		<description>
			<![CDATA[
<p>Sounds interesting -- will watch later ...</p>
<p>posted by contextfree</p>]]>
		</description>
		<link>http://channel9.msdn.com/Blogs/Peli/FINE-a-Compiler-for-End-to-End-Security-Verification#c633960740630000000</link>
		<pubDate>Thu, 10 Dec 2009 20:34:23 GMT</pubDate>
		<guid isPermaLink="true">http://channel9.msdn.com/Blogs/Peli/FINE-a-Compiler-for-End-to-End-Security-Verification#c633960740630000000</guid>
		<dc:creator>contextfree</dc:creator>
	</item>
	<item>
		<title>Re: Juan Chen and Nikhil Swamy: FINE, Functional Programming for End-to-End Security Verification</title>
		<description>
			<![CDATA[
<p>Interesting!</p>
<p>&nbsp;</p>
<p>The type of <code>fread</code> looks a bit like a dependent type. Since the third type depends on the
<em>value</em> of the first argument. Although, since <code>u</code> is only used in the predicate part of the &quot;type&quot;, that might not be true.</p>
<p>&nbsp;</p>
<p>Is FINE depedently typed?</p>
<p>posted by Tom Lokhorst</p>]]>
		</description>
		<link>http://channel9.msdn.com/Blogs/Peli/FINE-a-Compiler-for-End-to-End-Security-Verification#c633961280200000000</link>
		<pubDate>Fri, 11 Dec 2009 11:33:40 GMT</pubDate>
		<guid isPermaLink="true">http://channel9.msdn.com/Blogs/Peli/FINE-a-Compiler-for-End-to-End-Security-Verification#c633961280200000000</guid>
		<dc:creator>Tom Lokhorst</dc:creator>
	</item>
	<item>
		<title>Re: Juan Chen and Nikhil Swamy: FINE, Functional Programming for End-to-End Security Verification</title>
		<description>
			<![CDATA[
<p>Yes, Fine is dependently typed.&nbsp;In fact, we have dependent refinements: types like {x:t | phi}, where the formula phi is a type that can contain values from the term language. We also have value indexed types like cred &lt; u &gt; in the example of fread from
 the video, where u is a value.&nbsp;And, we also have affine types which allow us to model stateful programs. Incidentally, we chose the name &quot;Fine&quot; in part because of the afFINE and reFINEment typing constructs.&nbsp;</p>
<p>&nbsp;</p>
<p>Check out our papers at research.microsoft.com/fine&nbsp;for more details.&nbsp;</p>
<p>posted by nswamy</p>]]>
		</description>
		<link>http://channel9.msdn.com/Blogs/Peli/FINE-a-Compiler-for-End-to-End-Security-Verification#c633961704760000000</link>
		<pubDate>Fri, 11 Dec 2009 23:21:16 GMT</pubDate>
		<guid isPermaLink="true">http://channel9.msdn.com/Blogs/Peli/FINE-a-Compiler-for-End-to-End-Security-Verification#c633961704760000000</guid>
		<dc:creator>nswamy</dc:creator>
	</item>
</channel>
</rss>