Write a Blog >>
Wed 20 Jan 2016 17:20 - 17:45 at Grand Bay South - Track 2: Decidability and complexity Chair(s): C.-H. Luke Ong

In this paper, we analyze the complexity of functional programs written in the interaction net computation model, an asynchronous, parallel and confluent model that generalize linear logic proof nets. Relying on the use of sized and scheduled types, we establish concrete time, space and space-time complexity bounds for both sequential and parallel reductions of interaction-net systems by suitably assigning complexity potentials to typed nodes. The relevance of this approach is illustrated on archetypal programming examples. The provided analysis is precise, compositional and is, in theory, not restricted to particular complexity classes.

Wed 20 Jan
Times are displayed in time zone: Guadalajara, Mexico City, Monterrey change

16:30 - 17:45
Track 2: Decidability and complexityResearch Papers at Grand Bay South
Chair(s): C.-H. Luke OngUniversity of Oxford, UK
16:30
25m
Talk
Decidability of Inferring Inductive Invariants
Research Papers
Oded PadonTel Aviv University, Neil ImmermanUniversity of Massachusetts, Amherst, Sharon Shoham, Aleksandr KarbyshevTel Aviv University, Mooly SagivTel Aviv University
Media Attached
16:55
25m
Talk
The Hardness of Data Packing
Research Papers
Rahman Lavaee, Chen DingUniversity of Rochester
Media Attached
17:20
25m
Talk
The Complexity of Interaction
Research Papers
Stéphane GimenezUniversity of Innsbruck, Georg MoserUniversity of Innsbruck
Media Attached