Blogs (27) >>
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

tyde-2017-papers
16:50 - 17:40: TyDe 2017 - Extended abstracts 3 at L2
tyde-2017-papers150445020000016:50 - 17:15
Talk
tyde-2017-papers150445170000017:15 - 17:40
Talk