Capturing Performance Assumptions using Stochastic Performance Logic

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10108148" target="_blank" >RIV/00216208:11320/12:10108148 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/67985807:_____/12:00369679

Výsledek na webu

<a href="http://dl.acm.org/citation.cfm?id=2188345" target="_blank" >http://dl.acm.org/citation.cfm?id=2188345</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2188286.2188345" target="_blank" >10.1145/2188286.2188345</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Capturing Performance Assumptions using Stochastic Performance Logic

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Capturing Performance Assumptions using Stochastic Performance Logic

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 3rd joint WOSP/SIPEW International Conference on Performance Engineering

ISBN

978-1-4503-1202-8

ISSN

—

e-ISSN

—

Počet stran výsledku

12

Strana od-do

311-322

Název nakladatele

ACM

Místo vydání

New York, NY, USA

Místo konání akce

Boston, USA

Datum konání akce

22. 4. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—