Search Constraints

Start Over
Filtering by: Contributor Walkingshaw, Eric Remove constraint Contributor: Walkingshaw, Eric Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • 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 Satisfiability Solving Abstract approved: Eric Walkingshaw Over the last two decades

  • The Ownership Monad

    Creator:
    McGirr, Michael G.
    Abstract:
    The Rust programming language is a systems programming language with a strong static type system. A central feature of Rust’s type system is its unique concept of “ownership”, which enables Rust to give a user safe, low-level control over resources without the overhead of garbage collection. In Haskell, most data...
    Resource Type:
    Capstone Project
    Full Text:
    Abstract approved: Eric Walkingshaw The Rust programming language is a systems programming language with

  • Using Change Representations to Analyze Properties of Variational Software

    Creator:
    Wang, Xiangyu
    Abstract:
    Appropriate representations of variational software simplify the analysis of their properties.This thesis proposes tailored representations of two kinds variational softwares: difference files of merge commits in Git and feature models. For the former, we use the Choice Edit Model, which is based on the choice calculus, to represent changes introduced...
    Resource Type:
    Masters Thesis

  • Improving the Effectiveness of Answering Keyword Queries Using Effective Subsets

    Creator:
    Khodadadi, Abtin
    Abstract:
    Most database users do not know formal query languages, such as SQL, and prefer to express their information needs using usable query languages, such as keyword queries. Keyword queries, however, are inherently ambiguous and challenging for the database systems to understand and answer effectively. We propose a novel approach to...
    Resource Type:
    Capstone Project
    Full Text:
    , Josiane Mothe, Michael Preminger, Eric SanJuan, Ralf Schenkel, Mette Skov, Xavier Tannier, and David Walsh

  • Variational Typing and Its Applications

    Creator:
    Chen, Sheng
    Abstract:
    The study of variational typing originated from the problem of type inference for variational programs, which encode numerous different but related plain programs. In this dissertation, I present a sound and complete type inference algorithm for inferring types of all plain programs encoded in variational programs. The proposed algorithm runs...
    Resource Type:
    Dissertation
    Full Text:
    Groce, Prasad Tadepalli, and Eric Walkingshaw, offered a lot of support during my study here. Thank