Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrew Becker

dblp:144/4830 · also Andrew James Becker · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0001-5406-5545ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Virtual and augmented reality · 50% Computer animation and physical simulation · 50%
Artificial intelligence
1 paper
Reinforcement learning · 100%
Network and information security
1 paper
Hardware security and side channels · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
continuous control
0.412020
A Steering Algorithm for Redirected Walking Using Reinforcement Learning · IEEE Trans. Vis. Comput. Graph. 2020
Virtual and augmented reality › locomotion
redirected walking
0.412020
A Steering Algorithm for Redirected Walking Using Reinforcement Learning · IEEE Trans. Vis. Comput. Graph. 2020
Computer animation and physical simulation › motion planning
steering algorithm
0.412020
A Steering Algorithm for Redirected Walking Using Reinforcement Learning · IEEE Trans. Vis. Comput. Graph. 2020
Hardware security and side channels
hardware information flow tracking
0.312017
Arbitrary Precision and Complexity Tradeoffs for Gate-Level Information Flow Tracking · DAC 2017
Electronic design automation
hardware verification and test
0.112017
Arbitrary Precision and Complexity Tradeoffs for Gate-Level Information Flow Tracking · DAC 2017

Methods — techniques the papers use, named apart from their topics

user study · 0.9simulation · 0.9reinforcement learning · 0.9
YearPublicationVenuePosition
2020 A Steering Algorithm for Redirected Walking Using Reinforcement Learning
abstract
Redirected Walking (RDW) steering algorithms have traditionally relied on human-engineered logic. However, recent advances in reinforcement learning (RL) have produced systems that surpass human performance on a variety of control tasks. This paper investigates the potential of using RL to develop a novel reactive steering algorithm for RDW. Our approach uses RL to train a deep neural network that directly prescribes the rotation, translation, and curvature gains to transform a virtual environment given a user's position and orientation in the tracked space. We compare our learned algorithm to steer-to-center using simulated and real paths. We found that our algorithm outperforms steer-to-center on simulated paths, and found no significant difference on distance traveled on real paths. We demonstrate that when modeled as a continuous control problem, RDW is a suitable domain for RL, and moving forward, our general framework provides a promising path towards an optimal RDW steering algorithm.
Ryan R. Strauss, Raghuram Ramanujan, Andrew Becker, Tabitha C. Peck
IEEE Trans. Vis. Comput. Graph.3
2017 Arbitrary Precision and Complexity Tradeoffs for Gate-Level Information Flow Tracking
abstract
Hardware has become an increasingly attractive target for attackers, yet we still largely lack tools that enable us to analyze large designs for security flaws. Information flow tracking (IFT) models provide an approach to verifying a hardware design's adherence to security properties related to isolation and reachability.
Andrew Becker, Wei Hu 0008, Yu Tai, Philip Brisk, Ryan Kastner, Paolo Ienne
DAC1
2016 Imprecise security: quality and complexity tradeoffs for hardware information flow tracking
abstract
Secure hardware design is a challenging task that goes far beyond ensuring functional correctness. Important design properties such as non-interference cannot be verified on functional circuit models due to the lack of essential information (e.g., sensitivity level) for reasoning about security. Hardware information flow tracking (IFT) techniques associate data objects in the hardware design with sensitivity labels for modeling security-related behaviors. They allow the designer to test and verify security properties related to confidentiality, integrity, and logical side channels. However, precisely accounting for each bit of information flow at the hardware level can be expensive. In this work, we focus on the precision of the IFT logic. The key idea is to selectively introduce only one sided errors (false positives); these provide a conservative and safe information flow response while reducing the complexity of the security logic. We investigate the effect of logic synthesis on the quality and complexity of hardware IFT and reveal how different logic synthesis optimizations affect the amount of false positives and design overheads of IFT logic. We propose novel techniques to further simplify the IFT logic while adding no, or only a minimum number of, false positives. Additionally, we provide a solution to quantitatively introduce false positives in order to accelerate information flow security verification. Experimental results using IWLS benchmarks show that our method can reduce complexity of GLIFT by 14.47% while adding 0.20% of false positives on average. By quantitatively introducing false positives, we can achieve up to a 55.72% speedup in verification time.
Wei Hu 0008, Andrew Becker, Armita Ardeshiricham, Yu Tai, Paolo Ienne, Ryan Kastner
ICCAD2
2014 SKETCHILOG: Sketching combinational circuits
abstract
Despite the progress of higher-level languages and tools, Register Transfer Level (RTL) is still by far the dominant input format for high performance digital designs. Experienced designers can directly express their microarchitectural intuitions in RTL. Yet, RTL is terribly verbose, burdened with trivial details, and thus error prone. In this paper, we augment a modern RTL language (Chisel) with new semantic elements to express an imprecise specification: a sketch. We show how, in combination with a naïve, unoptimized, but functionally correct reference, a designer can utilize the language and supporting infrastructure to focus on the key design intuition and omit some of the necessary details. The resulting design is exactly or almost exactly as good as the one the designer could have achieved by spending the time to manually complete the sketch. We show that, even limiting ourselves to combinational circuits, realistic instances of meaningful design problems are solved quickly, saving considerable design and debugging effort.
Andrew Becker, David Novo, Paolo Ienne
DATE1