SlowFuzz: Automated Domain-Independent Detection of Algorithmic Complexity Vulnerabilities

Algorithmic complexity vulnerabilities occur when the worst-case time/space complexity of an application is significantly higher than the respective average case for particular user-controlled inputs. When such conditions are met, an attacker can launch Denial-of-Service attacks against a vulnerable application by providing inputs that trigger the worst-case behavior. Such attacks have been known to have serious effects on production systems, take down entire websites, or lead to bypasses of Web Application Firewalls. Unfortunately, existing detection mechanisms for algorithmic complexity vulnerabilities are domain-specific and often require significant manual effort. In this paper, we design, implement, and evaluate SlowFuzz, a domain-independent framework for automatically finding algorithmic complexity vulnerabilities. SlowFuzz automatically finds inputs that trigger worst-case algorithmic behavior in the tested binary. SlowFuzz uses resource-usage-guided evolutionary search techniques to automatically find inputs that maximize computational resource utilization for a given application.Comment: ACM CCS '17, October 30-November 3, 2017, Dallas, TX, US

Trajectory generation for road vehicle obstacle avoidance using convex optimization

This paper presents a method for trajectory generation using convex optimization to find a feasible, obstacle-free path for a road vehicle. Consideration of vehicle rotation is shown to be necessary if the trajectory is to avoid obstacles specified in a fixed Earth axis system. The paper establishes that, despite the presence of significant non-linearities, it is possible to articulate the obstacle avoidance problem in a tractable convex form using multiple optimization passes. Finally, it is shown by simulation that an optimal trajectory that accounts for the vehicle’s changing velocity throughout the manoeuvre is superior to a previous analytical method that assumes constant speed

Early embryonic development, assisted reproductive technologies, and pluripotent stem cell biology in domestic mammals

Over many decades assisted reproductive technologies, including artificial insemination, embryo transfer, in vitro production (IVP) of embryos, cloning by somatic cell nuclear transfer (SCNT), and stem cell culture, have been developed with the aim of refining breeding strategies for improved production and health in animal husbandry. More recently, biomedical applications of these technologies, in particular, SCNT and stem cell culture, have been pursued in domestic mammals in order to create models for human disease and therapy. The following review focuses on presenting important aspects of pre-implantation development in cattle, pigs, horses, and dogs. Biological aspects and impact of assisted reproductive technologies including IVP, SCNT, and culture of pluripotent stem cells are also addressed. © 2013 Elsevier Ltd

Symmetry adapted finite-cluster solver for quantum Heisenberg model in two-dimensions: a real-space renormalization approach

We present a quantum cluster solver for spin-$S$ Heisenberg model on a two-dimensional lattice. The formalism is based on the real-space renormalization procedure and uses the lattice point group-theoretical analysis and nonabelian SU(2) spin symmetry technique. The exact diagonalization procedure is used twice at each renormalization group step. The method is applied to the spin-half antiferromagnet on a square lattice and a calculation of local observables is demonstrated. A symmetry based truncation procedure is suggested and verified numerically.Comment: willm appear in J. Phys.

GPUVerify: A Verifier for GPU Kernels

We present a technique for verifying race- and divergence-freedom of GPU kernels that are written in mainstream ker-nel programming languages such as OpenCL and CUDA. Our approach is founded on a novel formal operational se-mantics for GPU programming termed synchronous, delayed visibility (SDV) semantics. The SDV semantics provides a precise definition of barrier divergence in GPU kernels and allows kernel verification to be reduced to analysis of a sequential program, thereby completely avoiding the need to reason about thread interleavings, and allowing existing modular techniques for program verification to be leveraged. We describe an efficient encoding for data race detection and propose a method for automatically inferring loop invari-ants required for verification. We have implemented these techniques as a practical verification tool, GPUVerify, which can be applied directly to OpenCL and CUDA source code. We evaluate GPUVerify with respect to a set of 163 kernels drawn from public and commercial sources. Our evaluation demonstrates that GPUVerify is capable of efficient, auto-matic verification of a large number of real-world kernels

Metal-to-Insulator Crossover in the Low-Temperature Normal State of Bi_{2}Sr_{2-x}La_{x}CuO_{6+\delta}

We measure the normal-state in-plane resistivity of La-doped Bi-2201 single crystals at low temperatures by suppressing superconductivity with 60-T pulsed magnetic fields. With decreasing hole doping, we observe a crossover from a metallic to insulating behavior in the low-temperature normal state. This crossover is estimated to occur near 1/8 doping, well inside the underdoped regime, and not at optimum doping as reported for other cuprates. The insulating regime is marked by a logarithmic temperature dependence of the resistivity over two decades of temperature, suggesting that a peculiar charge localization is common to the cuprates.Comment: 4 pages, 5 figures, accepted for publication in PR

Pairwise tests of purchasing power parity

Given nominal exchange rates and price data on N + 1 countries indexed by i = 0,1,2,…, N, the standard procedure for testing purchasing power parity (PPP) is to apply unit root or stationarity tests to N real exchange rates all measured relative to a base country, 0, often taken to be the U.S. Such a procedure is sensitive to the choice of base country, ignores the information in all the other cross-rates and is subject to a high degree of cross-section dependence which has adverse effects on estimation and inference. In this article, we conduct a variety of unit root tests on all possible N(N + 1)/2 real rates between pairs of the N + 1 countries and estimate the proportion of the pairs that are stationary. This proportion can be consistently estimated even in the presence of cross-section dependence. We estimate this proportion using quarterly data on the real exchange rate for 50 countries over the period 1957-2001. The main substantive conclusion is that to reject the null of no adjustment to PPP requires sufficiently large disequilibria to move the real rate out of the band of inaction set by trade costs. In such cases, one can reject the null of no adjustment to PPP up to 90% of the time as compared to around 40% in the whole sample using a linear alternative and almost 60% using a nonlinear alternative