3,056 research outputs found

    Undergraduate Catalog of Studies, 2023-2024

    Get PDF

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    A foundation for synthesising programming language semantics

    Get PDF
    Programming or scripting languages used in real-world systems are seldom designed with a formal semantics in mind from the outset. Therefore, the first step for developing well-founded analysis tools for these systems is to reverse-engineer a formal semantics. This can take months or years of effort. Could we automate this process, at least partially? Though desirable, automatically reverse-engineering semantics rules from an implementation is very challenging, as found by Krishnamurthi, Lerner and Elberty. They propose automatically learning desugaring translation rules, mapping the language whose semantics we seek to a simplified, core version, whose semantics are much easier to write. The present thesis contains an analysis of their challenge, as well as the first steps towards a solution. Scaling methods with the size of the language is very difficult due to state space explosion, so this thesis proposes an incremental approach to learning the translation rules. I present a formalisation that both clarifies the informal description of the challenge by Krishnamurthi et al, and re-formulates the problem, shifting the focus to the conditions for incremental learning. The central definition of the new formalisation is the desugaring extension problem, i.e. extending a set of established translation rules by synthesising new ones. In a synthesis algorithm, the choice of search space is important and non-trivial, as it needs to strike a good balance between expressiveness and efficiency. The rest of the thesis focuses on defining search spaces for translation rules via typing rules. Two prerequisites are required for comparing search spaces. The first is a series of benchmarks, a set of source and target languages equipped with intended translation rules between them. The second is an enumerative synthesis algorithm for efficiently enumerating typed programs. I show how algebraic enumeration techniques can be applied to enumerating well-typed translation rules, and discuss the properties expected from a type system for ensuring that typed programs be efficiently enumerable. The thesis presents and empirically evaluates two search spaces. A baseline search space yields the first practical solution to the challenge. The second search space is based on a natural heuristic for translation rules, limiting the usage of variables so that they are used exactly once. I present a linear type system designed to efficiently enumerate translation rules, where this heuristic is enforced. Through informal analysis and empirical comparison to the baseline, I then show that using linear types can speed up the synthesis of translation rules by an order of magnitude

    Undergraduate Catalog of Studies, 2023-2024

    Get PDF

    Symmetries of Riemann surfaces and magnetic monopoles

    Get PDF
    This thesis studies, broadly, the role of symmetry in elucidating structure. In particular, I investigate the role that automorphisms of algebraic curves play in three specific contexts; determining the orbits of theta characteristics, influencing the geometry of the highly-symmetric Bring’s curve, and in constructing magnetic monopole solutions. On theta characteristics, I show how to turn questions on the existence of invariant characteristics into questions of group cohomology, compute comprehensive tables of orbit decompositions for curves of genus 9 or less, and prove results on the existence of infinite families of curves with invariant characteristics. On Bring’s curve, I identify key points with geometric significance on the curve, completely determine the structure of the quotients by subgroups of automorphisms, finding new elliptic curves in the process, and identify the unique invariant theta characteristic on the curve. With respect to monopoles, I elucidate the role that the Hitchin conditions play in determining monopole spectral curves, the relation between these conditions and the automorphism group of the curve, and I develop the theory of computing Nahm data of symmetric monopoles. As such I classify all 3-monopoles whose Nahm data may be solved for in terms of elliptic functions

    UMSL Bulletin 2023-2024

    Get PDF
    The 2023-2024 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1088/thumbnail.jp

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    UMSL Bulletin 2022-2023

    Get PDF
    The 2022-2023 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1087/thumbnail.jp

    Algebraic solutions of linear differential equations: an arithmetic approach

    Full text link
    Given a linear differential equation with coefficients in Q(x)\mathbb{Q}(x), an important question is to know whether its full space of solutions consists of algebraic functions, or at least if one of its specific solutions is algebraic. After presenting motivating examples coming from various branches of mathematics, we advertise in an elementary way a beautiful local-global arithmetic approach to these questions, initiated by Grothendieck in the late sixties. This approach has deep ramifications and leads to the still unsolved Grothendieck-Katz pp-curvature conjecture.Comment: 47 page
    • …
    corecore