Events Calendar

PhD Defense - Yazeed Alabdulkarim

Title: Polygraph: A Plug-n-Play Framework to Quantify Application Anomalies
Date and Time: June 21, 9-11am in SAL 213
Phd Candidate: Yazeed Alabdulkarim

Committee:
Professor Shahram Ghandeharizadeh (chair)
Professor Chao Wang
Professor Christopher Gould (outside member)

Title: Polygraph: A Plug-n-Play Framework to Quantify Application Anomalies

Date and Time: June 21, 9-11am in SAL 213

Abstract:
Polygraph is a plug-n-play tool to quantify application anomalies. Example anomalies include erroneous results attributed to a software bug or an incorrect implementation, dirty reads when a database management system is configured with a weak consistency setting, and stale data produced by a cache. Polygraph is application agnostic and scales to detect anomalies and compute freshness confidence in real-time. It consists of an authoring, monitoring, and validation components. An experimentalist uses Polygraph authoring tool to generate code snippets to embed in the application software. These code snippets generate log records capturing conceptual application transactions at the granularity of entities and their relationships. Polygraph validates application transactions in a scalable manner by dividing the task into sub-tasks that process fragments of log records concurrently. Polygraph's monitoring tool visualizes transactions to help reason about anomalies. Polygraph is extensible, enabling a developer to tailor one or more of its components to be application specific. For example, we extend Polygraph's validation component to validate range predicates and simple analytics, such as max and min. We demonstrate the use of Polygraph with a variety of benchmarks representing diverse applications including TPC-C, BG, YCSB, SEATS and TATP.

Location: Henry Salvatori Computer Science Center (SAL) - 213

Audiences: Everyone Is Invited

Contact: Lizsl De Leon