Capturing performance assumptions using stochastic performance logic

  • Authors:
  • Lubomír Bulej;Tomáš Bureš;Jaroslav Keznikl;Alena Koubková;Andrej Podzimek;Petr Tůma

  • Affiliations:
  • Charles University & Academy of Sciences of the Czech Republic, Prague, Czech Rep;Charles University & Academy of Sciences of the Czech Republic, Prague, Czech Rep;Charles University & Academy of Sciences of the Czech Republic, Prague, Czech Rep;Charles University, Prague, Czech Rep;Charles University & Academy of Sciences of the Czech Republic, Prague, Czech Rep;Charles University, Prague, Czech Rep

  • Venue:
  • ICPE '12 Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Compared to functional unit testing, automated performance testing is difficult, partially because correctness criteria are more difficult to express for performance than for functionality. Where existing approaches rely on absolute bounds on the execution time, we aim to express assertions on code performance in relative, hardware-independent terms. To this end, we introduce Stochastic Performance Logic (SPL), which allows making statements about relative method performance. Since SPL interpretation is based on statistical tests applied to performance measurements, it allows (for a special class of formulas) calculating the minimum probability at which a particular SPL formula holds. We prove basic properties of the logic and present an algorithm for SAT-solver-guided evaluation of SPL formulas, which allows optimizing the number of performance measurements that need to be made. Finally, we propose integration of SPL formulas with Java code using higher-level performance annotations, for performance testing and documentation purposes.