Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 13 of 13
Full-Text Articles in Physical Sciences and Mathematics
Quantum Multi-Solution Bernoulli Search With Applications To Bitcoin’S Post-Quantum Security, Alexandru Cojocaru, Juan Garay, Fang Song, Petros Wallden
Quantum Multi-Solution Bernoulli Search With Applications To Bitcoin’S Post-Quantum Security, Alexandru Cojocaru, Juan Garay, Fang Song, Petros Wallden
Computer Science Faculty Publications and Presentations
A proof of work (PoW) is an important cryptographic construct which enables a party to convince other parties that they have invested some effort in solving a computational task. Arguably, its main impact has been in the setting of cryptocurrencies such as Bitcoin and its underlying blockchain protocol, which have received significant attention in recent years due to its potential for various applications as well as for solving fundamental distributed computing questions in novel threat models. PoWs enable the linking of blocks in the blockchain data structure, and thus the problem of interest is the feasibility of obtaining a sequence …
Automated Test Generation For Validating Systemc Designs, Bin Lin
Automated Test Generation For Validating Systemc Designs, Bin Lin
Dissertations and Theses
Modern system design involves integration of all components of a system on a single chip, namely System-on-a-Chip (SoC). The ever-increasing complexity of SoCs and rapidly decreasing time-to-market have pushed the design abstraction to the electronic system level (ESL), in order to increase design productivity. SystemC is a widely used ESL modeling language that plays a central role in modern SoCs design process. ESL SystemC designs usually serve as executable specifications for the subsequent SoCs design flow. Therefore, undetected bugs in ESL SystemC designs may propagate to low-level implementations or even final silicon products. In addition, modern SoCs design often involves …
Towards Formally Verified Compilation Of Tag-Based Policy Enforcement, Chr Chhak, Andrew Tolmach, Sean Anderson
Towards Formally Verified Compilation Of Tag-Based Policy Enforcement, Chr Chhak, Andrew Tolmach, Sean Anderson
Computer Science Faculty Publications and Presentations
Hardware-assisted reference monitoring is receiving increasing attention as a way to improve the security of existing software. One example is the PIPE architecture extension, which attaches metadata tags to register and memory values and executes tag-based rules at each machine instruction to enforce a software-defined security policy. To use PIPE effectively, engineers should be able to write security policies in terms of source-level concepts like functions, local variables, and structured control operators, which are not visible at machine level. It is the job of the compiler to generate PIPE-aware machine code that enforces these source-level policies. The compiler thus becomes …
A Computer Science Academic Vocabulary List, David Roesler
A Computer Science Academic Vocabulary List, David Roesler
Dissertations and Theses
This thesis documents the development of the Computer Science Academic Vocabulary List (CSAVL), a pedagogical tool intended for use by English-for-specific-purpose educators and material developers. A 3.5-million-word corpus of academic computer science textbooks and journal articles was developed in order to produce the CSAVL. This study draws on the improved methodologies used in the creation of recent lemma-based word lists such as the Academic Vocabulary List (AVL) and the Medical Academic Vocabulary List (MAVL), which take into account the discipline-specific meanings of academic vocabulary. The CSAVL provides specific information for each entry, including part of speech and CS-specific meanings in …
Local Radiance, Scott Peter Britell
Local Radiance, Scott Peter Britell
Dissertations and Theses
Recent years have seen a proliferation of web applications based on content management systems (CMS). Using a CMS, non-technical content authors are able to define custom content types to support their needs. These content type names and the attribute names in each content type are typically domain-specific and meaningful to the content authors. The ability of a CMS to support a multitude of content types allows for endless creation and customization but also leads to a large amount of heterogeneity within a single application. While this meaningful heterogeneity is beneficial, it introduces the problem of how to write reusable functionality …
Versatile Binary-Level Concolic Testing, Bo Chen
Versatile Binary-Level Concolic Testing, Bo Chen
Dissertations and Theses
Computing systems are experiencing an explosive growth, both in complexities and diversities, ushered in by the proliferation of cloud computing, mobile computing, and Internet of Things. This growth has also exposed the consequences of unsafe, insecure, and unreliable computing systems. These all point to the great needs of sophisticated system validation techniques. Recent advances in research on symbolic execution has shown great promises for automated software analysis, e.g., generating test cases, finding bugs, and detecting security vulnerabilities. However, symbolic execution is mostly adopted to analyze user applications, while modern computing systems in practice consist of many components shipped by various …
Design And Experimental Evaluation Of Deepmarket: An Edge Computing Marketplace With Distributed Tensorflow Execution Capability, Soyoung Kim
Dissertations and Theses
There is a rise in demand among machine learning researchers for powerful computational resources to train complex machine learning models, e.g., deep learning models. In order to train these models in a reasonable amount of time, the training is often distributed among multiple machines; yet paying for such machines (either through renting them on cloud data centers or building a local infrastructure) is costly. DeepMarket attempts to reduce these costs by creating a marketplace that integrates multiple computational resources over a distributed TensorFlow framework. Instead of requiring users to rent expensive GPU/CPUs from a third-party cloud provider, DeepMarket allows users …
Crumpled And Abraded Encryption: Implementation And Provably Secure Construction, Scott Sherlock Griffy
Crumpled And Abraded Encryption: Implementation And Provably Secure Construction, Scott Sherlock Griffy
Dissertations and Theses
Abraded and crumpled encryption allows communication software such as messaging platforms to ensure privacy for their users while still allowing for some investigation by law enforcement. Crumpled encryption ensures that each decryption is costly and prevents law enforcement from performing mass decryption of messages. Abrasion ensures that only large organizations like law enforcement are able to access any messages. The current abrasion construction uses public key parameters such as prime numbers which makes the abrasion scheme difficult to analyze and allows possible backdoors. In this thesis, we introduce a new abrasion construction which uses hash functions to avoid the problems …
Knowing Without Knowing: Real-Time Usage Identification Of Computer Systems, Leila Mohammed Hawana
Knowing Without Knowing: Real-Time Usage Identification Of Computer Systems, Leila Mohammed Hawana
Dissertations and Theses
Contemporary computers attempt to understand a user's actions and preferences in order to make decisions that better serve the user. In pursuit of this goal, computers can make observations that range from simple pattern recognition to listening in on conversations without the device being intentionally active. While these developments are incredibly useful for customization, the inherent security risks involving personal data are not always worth it. This thesis attempts to tackle one issue in this domain, computer usage identification, and presents a solution that identifies high-level usage of a system at any given moment without looking into any personal data. …
Annotation-Enabled Interpretation And Analysis Of Time-Series Data, Niveditha Venugopal
Annotation-Enabled Interpretation And Analysis Of Time-Series Data, Niveditha Venugopal
Dissertations and Theses
As we continue to produce large amounts of time-series data, the need for data analysis is growing rapidly to help gain insights from this data. These insights form the foundation of data-driven decisions in various aspects of life. Data annotations are information about the data such as comments, errors and provenance, which provide context to the underlying data and aid in meaningful data analysis in domains such as scientific research, genomics and ECG analysis. Storing such annotations in the database along with the data makes them available to help with analysis of the data. In this thesis, I propose a …
A Constraint Language For Static Semantic Analysis Based On Scope Graphs, Hendrik Van Antwerpen, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
A Constraint Language For Static Semantic Analysis Based On Scope Graphs, Hendrik Van Antwerpen, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
Computer Science Faculty Publications and Presentations
In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We treat name and type resolution as separate building blocks, but our approach can handle language constructs—such as record field access—for which binding and typing are mutually dependent.We also refine and extend our previous scope graph theory to address practical concerns including ambiguity checking and support for …
A Theory Of Name Resolution, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
A Theory Of Name Resolution, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
Computer Science Faculty Publications and Presentations
We describe a language-independent theory for name binding and resolution, suitable for programming languages with complex scoping rules including both lexical scoping and modules. We formulate name resolution as a two-stage problem. First a language-independent scope graph is constructed using language-specific rules from an abstract syntax tree. Then references in the scope graph are resolved to corresponding declarations using a language-independent resolution process. We introduce a resolution calculus as a concise, declarative, and language- independent specification of name resolution. We develop a resolution algorithm that is sound and complete with respect to the calculus. Based on the resolution calculus we …
Conditional Tests On Basins Of Attraction With Finite Fields, Ian H. Dinwoodie
Conditional Tests On Basins Of Attraction With Finite Fields, Ian H. Dinwoodie
Mathematics and Statistics Faculty Publications and Presentations
An iterative method is given for computing the polynomials that vanish on the basin of attraction of a steady state in discrete polynomial dynamics with finite field coefficients. The algorithm is applied to dynamics of a T cell survival network where it is used to compare transition maps conditional on a basin of attraction.