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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

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

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 Wednesday Seminars - Department of Computer Science and Technology series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Black Mathematics at Cambridge Engineering Department - Lecture Room 5 Mental Health Week 2013

Other talks

A Few Days in Patagonia - the Deep South TBC Title to be confirmed Evolution: Inevitable or Remarkable? Director's Briefing Coming soon
 

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