<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Formally Understanding Concurrency</title><link>http://blogs.msdn.com/cdiggins/archive/2006/12/11/formally-understanding-concurrency.aspx</link><description>A colleague of mine is interested in the formal basis of concurrent programming, so I decided to gather several resources and post them here. I should start by saying much that much of the research in concurrent programming is based on the theory of pi-calculus</description><dc:language>en</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>Interesting Finds: December 11, 2006</title><link>http://blogs.msdn.com/cdiggins/archive/2006/12/11/formally-understanding-concurrency.aspx#1264344</link><pubDate>Tue, 12 Dec 2006 08:17:26 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:1264344</guid><dc:creator>Jason Haley</dc:creator><description /></item></channel></rss>