![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Friday 26 January 2024, 14:00-15:00
Towards Secure Distributed Choreographies
- đ¤ Speaker: Andrew K. Hirsch (Buffalo) đ Website
- đ Date & Time: Friday 26 January 2024, 14:00 - 15:00
- đ Venue: SS03, Computer Laboratory
Abstract
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.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- School of Technology
- SS03, Computer Laboratory
- tcw57âs list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.