Thesis defence

Subscribe to Thesis defence
Friday, January 25, 2019 12:30 pm - 12:30 pm EST (GMT -05:00)

PhD Defence • Institute for Quantum Computing — Formal Methods in Quantum Circuit Design

Matthew Amy, PhD candidate
David R. Cheriton School of Computer Science

The design and compilation of correct, efficient quantum circuits is integral to the future operation of quantum computers. This thesis makes contributions to the problems of optimizing and verifying quantum circuits, with an emphasis on the development of formal models for such purposes. We also present software implementations of these methods, which together form a full stack of tools for the design of optimized, formally verified quantum oracles.

Wednesday, December 19, 2018 12:30 pm - 12:30 pm EST (GMT -05:00)

Master’s Thesis Presentation • Software Engineering — Astra: Evaluating Translations from Alloy to SMT-LIB

Ali Abbassi, Master’s candidate
David R. Cheriton School of Computer Science

We present a variety of translation options for converting Alloy to SMT-LIB via Alloy’s Kodkod interface. Our translations, which are implemented in a library that we call Astra, are based on converting the set and relational operations of Alloy into their equivalent in typed first order logic (TFOL). 

Thursday, December 13, 2018 10:00 am - 10:00 am EST (GMT -05:00)

Master’s Thesis Presentation • Systems and Networking — Aggregation of Heterogeneous Anomaly Detectors for Cyber-Physical Systems

Murray Dunne, Master’s candidate
David R. Cheriton School of Computer Science

Distributed, life-critical systems that bridge the gap between software and hardware are becoming an integral part of our everyday lives. From autonomous cars to smart electrical grids, such cyber-physical systems will soon be omnipresent. With this comes a corresponding increase in our vulnerability to cyber-attacks. Monitoring such systems to detect malicious actions is of critical importance. 

Wednesday, December 12, 2018 1:30 pm - 1:30 pm EST (GMT -05:00)

Master’s Thesis Presentation • Algorithms and Complexity — Counting, Adding, and Regular Languages

Thomas Lidbetter, Master candidate
David R. Cheriton School of Computer Science

In this talk we consider two mostly disjoint topics in formal language theory that both involve the study and use of regular languages. The first topic lies in the intersection of automata theory and additive number theory.