Search Constraints

Start Over
Filtering by: Creator Hellickson, Martin L. Remove constraint Creator: Hellickson, Martin L. Degree Field Computer Science Remove constraint Degree Field: Computer Science Resource Type Dissertation Remove constraint Resource Type: Dissertation

Search Results

  • Update programming -- a safe approach to software maintenance

    Creator:
    Ren, Deling
    Abstract:
    Software maintenance accounts for a large portion of the software development cost, particularly the process of updating programs either to adapt for requirement change or to enhance design or efficiency. Currently, program updates are generally performed manually by programmers using text editors. This is an unreliable method because syntax and...
    Resource Type:
    Dissertation
    Full Text:
    ;$:EN1=0k5mlKcZ3N$:9;$Ap4$/&D14F;L�$/*i5 ?/1ZE<5wWdF;cZ3<58(D?/M,&ucZ3<&xGe5N7;$:F;3N1@?'$/E

  • 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:
    presented on July 1, 2015. Title: Variational Typing and Its Applications Abstract approved: Martin

  • Automatic Explanations of Computation Results with Value Decompositions and Dominating Sets

    Creator:
    Kumar, Prashant
    Abstract:
    In an increasingly computation-driven world, algorithms and mathematical models significantly impact decision making across various fields. To foster trust and understanding, it is crucial to provide users with clear and concise explanations of the reasoning behind the results produced by computational tools, especially when recommendations appear counterintuitive. Legal frameworks in...
    Resource Type:
    Dissertation
    Full Text:
    approved: Martin Erwig In an increasingly computation-driven world, algorithms and mathematical models

  • Automatic program generation for scientific computing

    Creator:
    Fu, Zhe
    Abstract:
    The code reuse problem is a common software engineering problem in scientific computing. As a prevailing programming language in many scientific fields, Fortran does not provide support to address this problem. One particular reason is that Fortran lacks the support for generic programming. By applying program-generation techniques, we developed two...
    Resource Type:
    Dissertation
    Full Text:
    Computing Abstract approved: Martin Erwig The code reuse problem is a common software engineering problem

  • Design and Application of Variational Representations

    Creator:
    Smeltzer, Karl J.
    Abstract:
    Variability is an important and widely studied topic across domains such as version control, software product lines, and metaprogramming. This dissertation presents an investigation into the process of systematically adding variability to data structures and programs, leading to guidelines for variational data structures and implications for programs that create, manipulate,...
    Resource Type:
    Dissertation
    Full Text:
    Application of Variational Representations Abstract approved: Martin Erwig Variability is an important and

  • The choice calculus : a formal language of variation

    Creator:
    Walkingshaw, Eric
    Abstract:
    In this thesis I present the choice calculus, a formal language for representing variation in software and other structured artifacts. The choice calculus is intended to support variation research in a way similar to the lambda calculus in programming language research. Specifically, it provides a simple formal basis for presenting,...
    Resource Type:
    Dissertation
    Full Text:
    Calculus: A Formal Language of Variation Abstract approved: Martin Erwig In this thesis I present the

  • Adaptation-based programming

    Creator:
    Bauer, Tim
    Abstract:
    Partial programming is a field of study where users specify an outline or skeleton of a program, but leave various parts undefined. The undefined parts are then completed by an external mechanism to form a complete program. Adaptation-Based Programming (ABP) is a method of partial programming that utilizes techniques from...
    Resource Type:
    Dissertation
    Full Text:
    31, 2013. Title: Adaptation-Based Programming Abstract approved: Martin Erwig Partial

  • End-user software engineering in the spreadsheet paradigm

    Creator:
    Abraham, Robin
    Abstract:
    Spreadsheets are among the most widely used end-user programming systems. Unfortunately, there is a high incidence of errors in end-user spreadsheets, and some of these errors have high impact. In this dissertation, we describe techniques we have developed to help end users develop safer spreadsheets. As part of our research,...
    Resource Type:
    Dissertation
    Full Text:
    Engineering in the Spreadsheet Paradigm Abstract approved: Martin Erwig Spreadsheets are among the most

  • A modification of Veto logic for a committee of threshold logic units and the use of 2-class classifiers for function estimation

    Creator:
    Osborne, Martin
    Abstract:
    The well-known local adjustment algorithm for training a threshold logic unit, TLU, is extended to a local adjustment algorithm for training a network of TLUs Computer simulations show that the extension is unsatisfactory. A new logic for a committee of TLUs, called modified veto logic, and a local adjustment algorithm...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE THESIS OF MARTIN OSBORNE for the degree

  • 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:
    : Martin Erwig and Prasad Tade- palli. Thank you Martin for your insight, sharp wit, and clever