Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
Articles 1 - 6 of 6
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 …
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 …
The Public’S Perception Of Humanlike Robots: Online Social Commentary Reflects An Appearance-Based Uncanny Valley, A General Fear Of A “Technology Takeover”, And The Unabashed Sexualization Of Female-Gendered Robots, Megan K. Strait, Cynthia Aguillon, Virginia Contreras, Noemi Garcia
The Public’S Perception Of Humanlike Robots: Online Social Commentary Reflects An Appearance-Based Uncanny Valley, A General Fear Of A “Technology Takeover”, And The Unabashed Sexualization Of Female-Gendered Robots, Megan K. Strait, Cynthia Aguillon, Virginia Contreras, Noemi Garcia
Computer Science Faculty Publications and Presentations
Towards understanding the public’s perception of humanlike robots, we examined commentary on 24 YouTube videos depicting social robots ranging in human similarity – from Honda’s Asimo to Hiroshi Ishiguro’s Geminoids. In particular, we investigated how people have responded to the emergence of highly humanlike robots (e.g., Bina48) in contrast to those with more prototypically-“robotic” appearances (e.g., Asimo), coding the frequency at which the uncanny valley versus fears of replacement and/or a “technology takeover” arise in online discourse based on the robot’s appearance. Here we found that, consistent with Masahiro Mori’s theory of the uncanny valley, people’s commentary reflected an aversion …
Panel: Influencing Culture And Curriculum Via Revolution, Amit Jain
Panel: Influencing Culture And Curriculum Via Revolution, Amit Jain
Computer Science Faculty Publications and Presentations
The goal of this panel session is to introduce audience members to the challenges and successes of significant cultural and curricular change as enacted by awardees in the NSF program Revolutionizing Engineering and Computer Science Departments (RED). This panel will explore how organizations go about the process of cultural investigation and how they embark on culture change, using RED awardees of 2016 as the featured panelists (the second cohort). These teams are engaged in high-risk, high-trust-required activities focused on both the organizational and operational structure of their departments, and on re-envisioning engineering and computer science curricula to create professionals able …
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 …