Juan Chen and Nikhil Swamy: FINE, Functional Programming for End-to-End Security Verification
- Posted: Dec 10, 2009 at 11:12 AM
- 40,115 Views
- 3 Comments
Juan Chen and Nikhil Swamy, two researchers at the Research in Software Engineering group, present FINE, a new 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 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
The Research in Software Engineering team (RiSE) coordinates Microsoft's research in Software Engineering in Redmond, USA.
Comments Closed
Comments have been closed since this content was published more than 30 days ago, but if you'd like to continue the conversation,
please create a new thread in our Forums,
or
Contact Us and let us know.
More posts in this blog
-
SpecExplorer: Model-Based Testing made practicable
-
Juan Chen and Nikhil Swamy: FINE, Functional…
-
Jeffrey Van Gogh: Testing Rx with Pex
Follow the Discussion
Oops, something didn't work.
What does this mean?
Following an item on Channel 9 allows you to watch for new content and comments that you are interested in. You need to be signed in to Channel 9 to use this feature.What does this mean?
Following an item on Channel 9 allows you to watch for new content and comments that you are interested in and view them all on your notifications page.sign up for email notifications?
Sounds interesting -- will watch later ...
Interesting!
The type of
freadlooks a bit like a dependent type. Since the third type depends on the value of the first argument. Although, sinceuis only used in the predicate part of the "type", that might not be true.Is FINE depedently typed?
Yes, Fine is dependently typed. 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 < u > in the example of fread from the video, where u is a value. And, we also have affine types which allow us to model stateful programs. Incidentally, we chose the name "Fine" in part because of the afFINE and reFINEment typing constructs.
Check out our papers at research.microsoft.com/fine for more details.
Remove this comment
Remove this thread
close