arXiv subjects

David Clark

Publications and source records attributed to David Clark.

28 records · Page 2Linked to original sources

arXiv2018

Indexing Operators to Extend the Reach of Symbolic Execution

Traditional program analysis analyses a program language, that is, all programs that can be written in the language. There is a difference, however, between all possible programs that can be written and the corpus of actual programs written in a language. We seek to exploit this difference: for a given program, we apply a bespoke program transformation Indexify to convert expressions that current SMT solvers do not, in general, handle, such as constraints on strings, into equisatisfiable expressions that they do handle. To this end, Indexify replaces operators in hard-to-handle expressions with homomorphic versions that behave the same on a finite subset of the domain of the original operator, and return bottom denoting unknown outside of that subset. By focusing on what literals and expressions are most useful for analysing a given program, Indexify constructs a small, finite theory that extends the power of a solver on the expressions a target program builds. Indexify's bespoke nature necessarily means that its evaluation must be experimental, resting on a demonstration of its effectiveness in practice. We have developed Indexif}, a tool for Indexify. We demonstrate its utility and effectiveness by applying it to two real world benchmarks --- string expressions in coreutils and floats in fdlibm53. Indexify reduces time-to-completion on coreutils from Klee's 49.5m on average to 6.0m. It increases branch coverage on coreutils from 30.10% for Klee and 14.79% for Zesti to 66.83%. When indexifying floats in fdlibm53, Indexifyl increases branch coverage from 34.45% to 71.56% over Klee. For a restricted class of inputs, Indexify permits the symbolic execution of program paths unreachable with previous techniques: it covers more than twice as many branches in coreutils as Klee.

cs.SE↗

arXiv2017

Prediscovery Observations and Orbit of Comet C/2017 K2 (PANSTARRS)

We present a study of comet C/2017 K2 (PANSTARRS) using prediscovery archival data taken from 2013 to 2017. Our measurements show that the comet has been marginally increasing in activity since at least 2013 May (heliocentric distance of $r_{\mathrm{H}} = 23.7$ AU pre-perihelion). We estimate the mass-loss rate during the period 2013--2017 as $\overline{\dot{M}} \approx \left(2.4 \pm 1.1 \right) \times 10^{2}$ kg s$^{-1}$, which requires a minimum active surface area of $\sim$10--10$^2$ km$^{2}$ for sublimation of supervolatiles such as CO and CO$_2$, by assuming a nominal cometary albedo $p_V = 0.04 \pm 0.02$. The corresponding lower limit to the nucleus radius is a few kilometers. Our Monte Carlo dust simulations show that dust grains in the coma are $\gtrsim0.5$ mm in radius, with ejection speeds from $\sim$1--3 m s$^{-1}$, and have been emitted in a protracted manner since 2013, confirming estimates by Jewitt et al. (2017). The current heliocentric orbit is hyperbolic. Our N-body backward dynamical integration of the orbit suggests that the comet is most likely (with a probability of $\sim$98\%) from the Oort spike. The calculated median reciprocal of the semimajor axis 1 Myr ago was $a_{\mathrm{med}}^{-1} = \left( 3.61 \pm 1.71 \right) \times 10^{-5}$ AU$^{-1}$ (in a reference system of the solar-system barycentre).

astro-ph.EP↗

arXiv2016

ITect: Scalable Information Theoretic Similarity for Malware Detection

Malware creators have been getting their way for too long now. String-based similarity measures can leverage ground truth in a scalable way and can operate at a level of abstraction that is difficult to combat from the code level. We introduce ITect, a scalable approach to malware similarity detection based on information theory. ITect targets file entropy patterns in different ways to achieve 100% precision with 90% accuracy but it could target 100% recall instead. It outperforms VirusTotal for precision and accuracy on combined Kaggle and VirusShare malware.

cs.CR↗

arXiv2015

Gone in a Blaze of Glory: the Demise of Comet C/2015 D1 (SOHO)

We present studies of C/2015 D1 (SOHO), the first sunskirting comet ever seen from ground stations over the past half century. The Solar and Heliospheric Observatory (SOHO) witnessed its peculiar light curve with a huge dip followed by a flareup around perihelion: the dip was likely caused by sublimation of olivines, directly evidenced by a coincident temporary disappearance of the tail. The flareup likely reflects a disintegration event, which we suggest was triggered by intense thermal stress established within the nucleus interior. Photometric data reveal an increasingly dusty coma, indicative of volatile depletion. A catastrophic mass loss rate of $\sim$10$^{5}$ kg s$^{-1}$ around perihelion was seen. Ground-based Xingming Observatory spotted the post-perihelion debris cloud. Our morphological simulations of post-perihelion images find newly released dust grains of size $a \gtrsim 10$ $μ$m in radius, however, a temporal increase in $a_{\min}$ was also witnessed, possibly due to swift dispersions of smaller grains swept away by radiation forces without replenishment. Together with the fading profile of the light curve, a power law dust size distribution with index $γ= 3.2 \pm 0.1$ is derived. We detected no active remaining cometary nuclei over $\sim$0.1 km in radius in post-perihelion images acquired at Lowell Observatory. Applying radial non-gravitational parameter, $\mathcal{A}_{1} = \left(1.209 \pm 0.118 \right) \times 10^{-6}$ AU day$^{-2}$, from an isothermal water-ice sublimation model to the SOHO astrometry significantly reduces residuals and sinusoidal trends in the orbit determination. The nucleus mass $\sim$10$^{8}$--10$^{9}$ kg, and the radius $\sim$50--150 m (bulk density $ρ_{\mathrm{d}} = 0.4$ g cm$^{-3}$ assumed) before the disintegration are deduced from the photometric data; consistent results were determined from the non-gravitational effects.

astro-ph.EP↗

arXiv2015

Test Set Diameter: Quantifying the Diversity of Sets of Test Cases

A common and natural intuition among software testers is that test cases need to differ if a software system is to be tested properly and its quality ensured. Consequently, much research has gone into formulating distance measures for how test cases, their inputs and/or their outputs differ. However, common to these proposals is that they are data type specific and/or calculate the diversity only between pairs of test inputs, traces or outputs. We propose a new metric to measure the diversity of sets of tests: the test set diameter (TSDm). It extends our earlier, pairwise test diversity metrics based on recent advances in information theory regarding the calculation of the normalized compression distance (NCD) for multisets. An advantage is that TSDm can be applied regardless of data type and on any test-related information, not only the test inputs. A downside is the increased computational time compared to competing approaches. Our experiments on four different systems show that the test set diameter can help select test sets with higher structural and fault coverage than random selection even when only applied to test inputs. This can enable early test design and selection, prior to even having a software system to test, and complement other types of test automation and analysis. We argue that this quantification of test set diversity creates a number of opportunities to better understand software quality and provides practical ways to increase it.

cs.SE↗

arXiv2015

Detecting Malware with Information Complexity

This work focuses on a specific front of the malware detection arms-race, namely the detection of persistent, disk-resident malware. We exploit normalised compression distance (NCD), an information theoretic measure, applied directly to binaries. Given a zoo of labelled malware and benign-ware, we ask whether a suspect program is more similar to our malware or to our benign-ware. Our approach classifies malware with 97.1% accuracy and a false positive rate of 3%. We achieve our results with off-the-shelf compressors and a standard machine learning classifier and without any specialised knowledge. An end-user need only collect a zoo of malware and benign-ware and then can immediately apply our techniques. We apply statistical rigour to our experiments and our selection of data. We demonstrate that accuracy can be optimised by combining NCD with the compressibility rates of the executables. We demonstrate that malware reported within a more narrow time frame of a few days is more homogenous than malware reported over a longer one of two years but that our method still classifies the latter with 95.2% accuracy and a 5% false positive rate. Due to the use of compression, the time and computation cost of our method is non-trivial. We show that simple approximation techniques can improve the time complexity of our approach by up to 63%. We compare our results to the results of applying the 59 anti-malware programs used on the VirusTotal web site to our malware. Our approach does better than any single one of them as well as the 59 used collectively.

cs.CR↗

arXiv2013

A modern solution to the Gion shrine problem

We give a new solution to the famous Gion shrine geometry problem from eighteenth-century Japan. Like the classical Japanese solution, ours is given in the form of a degree ten equation. However, our polynomial has the advantage of being much easier to write down. We also provide some additional analysis, including a discussion of existence and uniqueness.

math.MG↗

arXiv2010

Entanglement-assisted quantum low-density parity-check codes

This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes (EAQECCs) with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error correction performance, high rates, and low decoding complexity. The proposed method produces infinitely many new codes with a wide variety of parameters and entanglement requirements. Our framework encompasses various codes including the previously known entanglement-assisted quantum LDPC codes having the best error correction performance and many new codes with better block error rates in simulations over the depolarizing channel. We also determine important parameters of several well-known classes of quantum and classical LDPC codes for previously unsettled cases.

cs.IT↗

arXiv2008

Functoriality for the su(3) Khovanov homology

We prove that Morrison and Nieh's categorification of the su(3) quantum knot invariant is functorial with respect to tangle cobordisms. This is in contrast to the categorified su(2) theory, which was not functorial as originally defined. We use methods of Bar-Natan to construct explicit chain maps for each variation of the third Reidemeister move. Then, to show functoriality, we modify arguments used by Clark, Morrison, and Walker to show that induced chain maps are invariant under Carter and Saito's movie moves.

math.GT↗

arXiv2008

Fixing the functoriality of Khovanov homology

We describe a modification of Khovanov homology (math.QA/9908171), in the spirit of Bar-Natan (math.GT/0410495), which makes the theory properly functorial with respect to link cobordisms. This requires introducing `disorientations' in the category of smoothings and abstract cobordisms between them used in Bar-Natan's definition. Disorientations have `seams' separating oppositely oriented regions, coming with a preferred normal direction. The seams satisfy certain relations (just as the underlying cobordisms satisfy relations such as the neck cutting relation). We construct explicit chain maps for the various Reidemeister moves, then prove that the compositions of chain maps associated to each side of each of Carter and Saito's movie moves (MR1238875, MR1445361) always agree. These calculations are greatly simplified by following arguments due to Bar-Natan and Khovanov, which ensure that the two compositions must agree, up to a sign. We set up this argument in our context by proving a result about duality in Khovanov homology, generalising previous results about mirror images of knots to a `local' result about tangles. Along the way, we reproduce Jacobsson's sign table (math.GT/0206303) for the original `unoriented theory', with a few disagreements.

math.GT↗