Fair Termination for Resource-Aware Active ObjectsIn Person Talk
This program is tentative and subject to change.
Active object systems are a model of distributed computation that has been adopted for modelling distributed systems and business process workflows. This field of modelling is, in essence, concurrent and resource-aware, motivating the development of resource-aware formalisations on the active object model. The contributions of this work are the development of a core calculus for resource-aware active objects together with a type system ensuring that well-typed programs are fairly terminating, i.e., they can always eventually terminate. To achieve this, we combine techniques from graded semantics and type systems, which are quite well understood for sequential programs, with those for fair termination, which have been developed for synchronous-sessions.
This program is tentative and subject to change.
Tue 28 OctDisplayed time zone: Chennai, Kolkata, Mumbai, New Delhi change
11:00 - 12:30 | Type Systems, Safety, and VerificationResearch Papers at R104 Chair(s): Alex Potanin Australian National University | ||
11:00 30mTalk | Memory Safety: Uniqueness as Separation.In Person Talk Research Papers Pilar Selene Linares Arévalo University of Melbourne, Arthur Azevedo de Amorim Rochester Institute of Technology, USA, Vincent Jackson University of Melbourne, Liam O'Connor Australian National University, Peter Schachte The University of Melbourne, Christine Rizkallah University of Melbourne | ||
11:30 30mTalk | Fair Termination for Resource-Aware Active ObjectsIn Person Talk Research Papers Francesco Dagnino University of Genoa, Paola Giannini University of Eastern Piedmont, Violet Ka I Pun Western Norway University of Applied Sciences, Ulises Torrella Høgskulen på Vestlandet | ||
12:00 30mTalk | A Formal Foundation for Equational Reasoning on Probabilistic Programs Research Papers Reynald Affeldt National Institute of Advanced Industrial Science and Technology (AIST), Japan, Yoshihiro Ishiguro Nagoya University, AIST, Zachary Stone The MathComp-Analysis development team | ||