Sam Thomas
YOU?
Author Swipe
View article: Upper Extremity Transplant Rehabilitation Protocol
Upper Extremity Transplant Rehabilitation Protocol Open
Multilevel upper extremity transplant presents unique rehabilitation challenges due to the complexity of restoring function and integration across multiple joints and tissue types. This article outlines the development and implementation o…
View article: The Closer You Look, The More You Learn
The Closer You Look, The More You Learn Open
We propose a new approach to infer state machine models from protocol implementations. Our new tool, StateInspector, learns protocol states by using novel program analyses to combine observations of run-time memory and I/O. It requires no …
View article: MetaEmu: An Architecture Agnostic Rehosting Framework for Automotive Firmware
MetaEmu: An Architecture Agnostic Rehosting Framework for Automotive Firmware Open
In this paper we present MetaEmu, an architecture-agnostic emulator synthesizer geared towards rehosting and security analysis of automotive firmware. MetaEmu improves over existing rehosting environments in two ways: Firstly, it solves th…
View article: Cutting Through the Complexity of Reverse Engineering Embedded Devices
Cutting Through the Complexity of Reverse Engineering Embedded Devices Open
Performing security analysis of embedded devices is a challenging task. They present many difficulties not usually found when analyzing commodity systems: undocumented peripherals, esoteric instruction sets, and limited tool support. Thus,…
View article: The Closer You Look, The More You Learn: A Grey-box Approach to Protocol State Machine Learning
The Closer You Look, The More You Learn: A Grey-box Approach to Protocol State Machine Learning Open
In this paper, we propose a new approach to infer state machine models from protocol implementations. Our method, STATEINSPECTOR, learns protocol states by using novel program analyses to combine observations of run-time memory and I/O. It…
View article: Finding Software Bugs in Embedded Devices
Finding Software Bugs in Embedded Devices Open
The goal of this chapter is to introduce the reader to the domain of bug discovery in embedded systems which are at the core of the Internet of Things. Embedded software has a number of particularities which makes it slightly different to …
View article: Cutoff for random walk on dynamical Erdős–Rényi graph
Cutoff for random walk on dynamical Erdős–Rényi graph Open
We consider dynamical percolation on the complete graph $K_{n}$, where each edge refreshes its state at rate $\mu \ll 1/n$, and is then declared open with probability $p=\lambda /n$ where $\lambda >1$. We study a random walk on this dynami…
View article: Characterisation of Fast Mixing or Metastability for Loss Network with Dynamic Alternative Routing
Characterisation of Fast Mixing or Metastability for Loss Network with Dynamic Alternative Routing Open
Consider $N$ stations interconnected with links, each of capacity $K$, forming a complete graph. Calls arrive to each link at rate $\lambda$ and depart at rate $1$. If a call arrives to a link $\alpha \beta$ (connecting stations $\alpha$ a…
View article: Limit Profiles for Markov Chains
Limit Profiles for Markov Chains Open
In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random transpositions card shuffle. His technique…
View article: Chen–Stein method for the uncovered set of random walk on $\mathbb {Z}_{n}^{d}$ for $d \ge 3$
Chen–Stein method for the uncovered set of random walk on $\mathbb {Z}_{n}^{d}$ for $d \ge 3$ Open
Let $X$ be a simple random walk on $\mathbb {Z}_{n}^{d}$ with $d\geq 3$ and let $t_{\mathrm {cov}}$ be the expected cover time. We consider the set $\mathcal {U}_{\alpha }$ of points of $\mathbb {Z}_{n}^{d}$ that have not been visited by t…
View article: Random Cayley Graphs I: Cutoff and Geometry for Heisenberg Groups
Random Cayley Graphs I: Cutoff and Geometry for Heisenberg Groups Open
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log \lvert G \rvert$. A conjecture of Aldous and Diaconis asserts, for $k \gg \log \lvert G \rvert$, …
View article: Random Cayley Graphs II: Cutoff and Geometry for Abelian Groups
Random Cayley Graphs II: Cutoff and Geometry for Abelian Groups Open
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log \lvert G \rvert$. A conjecture of Aldous and Diaconis asserts, for $k \gg \log \lvert G \rvert$, …
View article: Backdoor detection systems for embedded devices
Backdoor detection systems for embedded devices Open
A system is said to contain a backdoor when it intentionally includes a means to trigger the execution of functionality that serves to subvert its expected security. Unfortunately, such constructs are pervasive in software and systems toda…
View article: Cutoff for Mixing Times on Random Abelian Cayley Graphs
Cutoff for Mixing Times on Random Abelian Cayley Graphs Open
Consider the random Cayley graph of a finite, Abelian group $G = \oplus_{j=1}^d \mathbb{Z}_{m_j}$ with respect to $k$ generators chosen uniformly at random. We prove that the simple random walk on this graph exhibits abrupt convergence to …