Object-Oriented White Papers

A Statically Verifiable Programming Model for Concurrent Object-Oriented Programs

Overview Reasoning about multithreaded object-oriented programs is difficult, due to the non-local nature of object aliasing, data races, and deadlocks. This paper proposes a programming model that prevents data races and deadlocks, and supports local reasoning in the presence of object aliasing and concurrency. The programming model builds on the multithreading and synchronization primitives as they are present in current mainstream languages. Java or C# programs developed according to the model can be annotated by means of stylized comments to make the use of the model explicit. This paper shows that such annotated programs can be formally verified to comply with the programming model.

Further White Paper Details
PublisherMicrosoft File FormatPDF
Date PublishedMay 2006
FormatWhite Papers   
Topics

Quick Sitemap Links: