Practical Proofs of Concurrent Programs
Marc Shapiro
Joint work with Viktor Vafeiadis, Maurice Herlihy, Tony Hoare,
INRIA and LIP6 –
Abstract:
Reasoning about fine-grain concurrent programs is extremely difficult because threads can interfere with one another in arbitrary ways. We propose to use the ‘rely-guarantee’ approach. In addition to the standard pre-condition and post-condition of sequential reasoning, a program is equipped with additional assertions: a rely condition that describes how much interference it it willing to suffer from the environment, and a guarantee condition that limits how much interference it will inflict to its environment. If one thread’s rely condition is implied by all other threads’ guarantee conditions (and if certain technical conditions are met), then standard sequential reasoning can be used to prove the post-condition. We describe our extensions to the basic rely-guarantee approach to make it practical, and show how we can prove a family of fine-grained concurrent list algorithms. Ultimately, we hope to incorporate the techniques into a compiler.
Bio: Marc Shapiro hasbeen doing research in distributed systems since his PhD in 1980. He invented the proxy concept, built an early object-oriented distributed system, and worked on distributed garbage collection and persistence. He recently spent 6 1/2 years at Microsoft Research in Cambridge before returning to INRIA. His current research is a theory of replication and consistency, the Action-Constraint Framework. He is also a founder and chair of the European chapter of ACM SIGOPS, EuroSys http://www.eurosys.org/. He like cats and ski mountaineering.
Date: 2005-Jul-13 Time: 16:00:00 Room: 336
For more information:
Upcoming Events
Mathematics, Physics & Machine Learning Seminar Series (Online)

The Mathematics, Physics & Machine Learning seminar series has started on October 2020 and runs until March 2021.
The seminars aim to bring together mathematicians and physicists interested in machine learning (ML) with ML and AI experts interested in mathematics and physics, with the goal of introducing innovative Mathematics and Physics-inspired techniques in Machine Learning and, reciprocally, applying Machine Learning to problems in Mathematics and Physics.
Attendance is free but registration is required.
More information is available here.
International European Conference on Parallel and Distributed Computing

The 27th International European Conference on Parallel and Distributed Computing (Euro-Par 2021) will take from August 30 to September 3 2021 in Lisbon.
Euro-Par is the prime European conference covering all aspects of parallel and distributed processing, ranging from theory to practice, from small to the largest parallel and distributed systems and infrastructures, from fundamental computational problems to full-fledged applications, from architecture, compiler, language and interface design and implementation, to tools, support infrastructures, and application performance aspects.
The 2021 edition of Euro-Par will be organized as a collaboration between INESC-ID and Instituto Superior Técnico (IST).
Important Dates:
– Abstract Submission: February 5, 2021
– Paper Submission Deadline: February 12, 2021
– Author Notification: April 30, 2021
– Camera-Ready Papers: June 6, 2021
More information is available here.