Search Constraints

Start Over
Filtering by: Creator Ostermann, Stacey D. Remove constraint Creator: Ostermann, Stacey D. Committee Member Erwig, Martin Remove constraint Committee Member: Erwig, Martin Degree Field Computer Science Remove constraint Degree Field: Computer Science Language English [eng] Remove constraint Language: English [eng]

Search Results

  • A Formal Foundation for Variational Programming Using the Choice Calculus

    Creator:
    Hubbard, Spencer
    Abstract:
    In this thesis, we present semantic equivalence rules for an extension of the choice calculus and sound operations for an implementation of variational lists. The choice calculus is a calculus for describing variation and the formula choice calculus is an extension with formulas. We prove semantic equivalence rules for the...
    Resource Type:
    Masters Thesis
    Full Text:
    instead of dimensions [Walkingshaw and Ostermann, 2014]. Semantic equivalence rules for the choice

  • Variational Satisfiability Solving

    Creator:
    Young, Jeffrey M.
    Abstract:
    Over the last two decades, satisfiability and satisfiability-modulo theory (SAT/SMT) solvers have grown powerful enough to be general purpose reasoning engines throughout software engineering and computer science. However, most practical use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of related SAT/SMT problems....
    Resource Type:
    Dissertation
    Full Text:
    . Variational cores are key to our approach, and enable the preservation of shared terms between variants. (d

  • Imperative Programming with Variational Effects

    Creator:
    Grasley, Alexander B.
    Abstract:
    Variation is a commonly encountered element of modern software systems. Recent research into variation has led to increasing interest in the development of variational programming languages and corresponding variational models of execution. Variational imperative languages pose a particular challenge due to the complex interactions between side effects and variation. The...
    Resource Type:
    Masters Thesis
    Full Text:
    , Applicative, and Monad typeclasses: 8 instance Functor V where fmap f (One a) = One (f a) fmap f (Chc d

  • Implementation Techniques for Variational Data Structures

    Creator:
    Meng, Meng
    Abstract:
    Many applications require not only representing variability in software and data, butalso computing with it. To do so efficiently requires variational data structures thatmake variability explicit in the underlying data and the operations used to manipulate it.Variational data structures have been developed ad hoc for many applications, but thereis little...
    Resource Type:
    Masters Thesis
    Full Text:
    number of different ways. The simplest way is Conditional<D> where D stands for a plain data structure

  • Formative Work Toward a Mixed-Initiative Programming Language

    Creator:
    Abbott, Keeley
    Abstract:
    Mixed-initiative programming entails collaboration between a computer system, and a human to achieve some desired goal or set of goals. Often these goals change or are amended in real time during the course of program execution. As such, the plans these programs are based on must adapt and evolve to...
    Resource Type:
    Masters Thesis

  • Theory and Implementation of a Variational Database Management System

    Creator:
    Ataei, Parisa S.
    Abstract:
    In this thesis, I present the variational database management system, a formal framework and its implementation for representing variation in relational databases and managing variational information needs. A variational database is intended to support any kind of variation in a database. Specific kinds of variation in databases have already been...
    Resource Type:
    Dissertation
    Full Text:
    database D stores information in a structured manner by forcing data to conform to a schema S that is a