Logic and Foundations Commons^™

Toward Completeness Theorem For Guarded Kleene Algebra With Tests, Hung Pham

Honors Theses

Code refactoring is a fundamental practice in software engineering, in which a program is restructured without changing the actions it performs and the results it produces. To carry out refactoring with confidence, one requires a formal method for verifying that two programs are equivalent. Guarded Kleene Algebra with Tests (GKAT) provides such a framework, an algebraic system designed to reason about a natural class of programs, namely those in which every branch and loop is governed by a Boolean condition, such as if–else and while statements. Central to GKAT is a finite set of algebraic axioms for deriving program equivalences. …

Verifying Harder's Conjecture For Classical And Siegel Modular Forms, Davia Sulon

Honors Theses

A conjecture by Harder shows a surprising congruence between the coefficients of “classical” modular forms and the Hecke eigenvalues of corresponding Siegel modular forms, contigent upon “large primes” dividing the critical values of the given classical modular form.

Harder’s Conjecture has already been verified for one-dimensional spaces of classical and Siegel modular forms (along with some two-dimensional cases), and for primes p 37. We verify the conjecture for higher-dimensional spaces, and up to a comparable prime p.