Towards Secure Distributed Choreographies

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

• Andrew K. Hirsch (Buffalo)
• Friday 26 January 2024, 14:00-15:00
• SS03, Computer Laboratory.

If you have a question about this talk, please contact nk480.

Choreographic programming is an emerging paradigm for message-passing concurrency. A choreographic program (or “choreography”) describes the computation of an entire system; this ensures deadlock-freedom without requiring the extraneous checks that other solutions like session types require. Choreographies seem perfect for designing distributed systems, since they allow deadlock freedom with arbitrary communication patterns for codesigned nodes. This talk looks at two challenges involved in using choreographies this way: information security and the closed-world assumption. In both cases, I will discuss what makes these problems challenging, and report on current work meant to address them.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computing and Mathematics
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• SS03, Computer Laboratory
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.