University of Cambridge > Talks.cam > Computer Laboratory Wednesday Seminars > Verification of fine-grain concurrency: Separation Logic for Floyd assertions in Petri nets.

Verification of fine-grain concurrency: Separation Logic for Floyd assertions in Petri nets.

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Timothy G. Griffin.

The continuation of Moore’s law will now depend on the skill of programmers writing highly concurrent shared memory algorithms for multi-core architectures. Correctness arguments are essential to avoid non-deterministic errors, including race conditions, deadlocks and livelocks. These cannot be debugged, but can readily be exploited by malware.

We use pictorial representations of concurrent programs as Petri nets; we represent correctness by annotating the arcs with Floyd assertions. Separation logic expresses the essential disjointness constraints for safe and structured forms of concurrency.

This talk is part of the Computer Laboratory Wednesday Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity