Blogs (28) >>
ICFP 2017
Sun 3 - Sat 9 September 2017 Oxford, United Kingdom
Sun 3 Sep 2017 17:15 - 17:40 at L2 - Extended abstracts 3

Verifying non-functional properties of programs, such as time and/or energy consumption, is a difficult task. With applications such as the internet-of-things, it is becoming increasingly important that devices operate reliably \emph{within known time and energy bounds}. At the same time, processor architectures are becoming more complex. This means that traditional modelling techniques are not effective. Energy usage, for example, is \emph{non-compositional}. To solve this problem, we propose the introduction of type-directed, probabilistic bounds to allow us to reason formally about the approximate consumption of resources.

Sun 3 Sep
Times are displayed in time zone: Greenwich Mean Time : Belfast change

16:50 - 17:40: Extended abstracts 3TyDe at L2
16:50 - 17:15
Type oriented programming for task based parallelism
17:15 - 17:40
Type-directed reasoning for probabilistic, non-compositional resources
Edwin BradyUniversity of St. Andrews, UK, Kevin HammondUniversity of St. Andrews, UK, Christopher SchwaabUniversity of St Andrews