Premise Selection and External Provers for HOL4

Learning-assisted automated reasoning has recently gained popularity among the users of Isabelle/HOL, HOL Light, and Mizar. In this paper, we present an add-on to the HOL4 proof assistant and an adaptation of the HOLyHammer system that provides machine learning-based premise selection and automated reasoning also for HOL4. We efficiently record the HOL4 dependencies and extract features from the theorem statements, which form a basis for premise selection. HOLyHammer transforms the HOL4 statements in the various TPTP-ATP proof formats, which are then processed by the ATPs. We discuss the different evaluation settings: ATPs, accessible lemmas, and premise numbers. We measure the performance of HOLyHammer on the HOL4 standard library. The results are combined accordingly and compared with the HOL Light experiments, showing a comparably high quality of predictions. The system directly benefits HOL4 users by automatically finding proofs dependencies that can be reconstructed by Metis

Wind-tunnel investigation of the powered low-speed longitudinal aerodynamics of the Vectored-Engine-Over (VEO) wing fighter configuration

A wind-tunnel investigation incorporating both static and wind-on testing was conducted in the Langley 4- by 7-Meter Tunnel to determine the effects of vectored thrust along with spanwise blowing on the low-speed aerodynamics of an advanced fighter configuration. Data were obtained over a large range of thrust coefficients corresponding to takeoff and landing thrust settings for many nozzle configurations. The complete set of static thrust data and the complete set of longitudinal aerodynamic data obtained in the investigation are presented. These data are intended for reference purposes and, therefore, are presented without analysis or comment. The analysis of the thrust-induced effects found in the investigation are not discussed

Differential Radial Velocities and Stellar Parameters of Nearby Young Stars

Radial velocity searches for substellar mass companions have focused primarily on stars older than 1 Gyr. Increased levels of stellar activity in young stars hinders the detection of solar system analogs and therefore there has been a prejudice against inclusion of young stars in radial velocity surveys until recently. Adaptive optics surveys of young stars have given us insight into the multiplicity of young stars but only for massive, distant companions. Understanding the limit of the radial velocity technique, restricted to high-mass, close-orbiting planets and brown dwarfs, we began a survey of young stars of various ages. While the number of stars needed to carry out full analysis of the problems of planetary and brown dwarf population and evolution is large, the beginning of such a sample is included here. We report on 61 young stars ranging in age from beta Pic association (~12 Myr) to the Ursa Majoris association (~300 Myr). This initial search resulted in no stars showing evidence for companions greater than ~1-2 M_Jup in short period orbits at the 3 sigma-level. Additionally, we present derived stellar parameters, as most have unpublished values. The chemical homogeneity of a cluster, and presumably of an association, may help to constrain true membership. As such, we present [Fe/H] abundances for the stars in our sample.Comment: Accepted for publication in the PAS

Thermal Radiation Analysis System (TRASYS)

A user's manual is presented for TRASYS, which is a digital software system with a generalized capability for solving radiation problems. Subroutines, file, and variable definitions are presented along with subroutine and function descriptions for the preprocessor. Definitions and descriptions of components of the processor are also presented

Hammering towards QED

This paper surveys the emerging methods to automate reasoning over large libraries developed with formal proof assistants. We call these methods hammers. They give the authors of formal proofs a strong “one-stroke” tool for discharging difficult lemmas without the need for careful and detailed manual programming of proof search. The main ingredients underlying this approach are efficient automatic theorem provers that can cope with hundreds of axioms, suitable translations of the proof assistant’s logic to the logic of the automatic provers, heuristic and learning methods that select relevant facts from large libraries, and methods that reconstruct the automatically found proofs inside the proof assistants. We outline the history of these methods, explain the main issues and techniques, and show their strength on several large benchmarks. We also discuss the relation of this technology to the QED Manifesto and consider its implications for QED-like efforts.Blanchette’s Sledgehammer research was supported by the Deutsche Forschungs- gemeinschaft projects Quis Custodiet (grants NI 491/11-1 and NI 491/11-2) and Hardening the Hammer (grant NI 491/14-1). Kaliszyk is supported by the Austrian Science Fund (FWF) grant P26201. Sledgehammer was originally supported by the UK’s Engineering and Physical Sciences Research Council (grant GR/S57198/01). Urban’s work was supported by the Marie-Curie Outgoing International Fellowship project AUTOKNOMATH (grant MOIF-CT-2005-21875) and by the Netherlands Organisation for Scientific Research (NWO) project Knowledge-based Automated Reasoning (grant 612.001.208).This is the final published version. It first appeared at http://jfr.unibo.it/article/view/4593/5730?acceptCookies=1

Scheduling language and algorithm development study. Volume 3, phase 2: As-built specifications for the prototype language and module library

Detailed specifications of the prototype language and module library are presented. The user guide to the translator writing system is included

Formalising Mathematics in Simple Type Theory

Despite the considerable interest in new dependent type theories, simple type theory (which dates from 1940) is sufficient to formalise serious topics in mathematics. This point is seen by examining formal proofs of a theorem about stereographic projections. A formalisation using the HOL Light proof assistant is contrasted with one using Isabelle/HOL. Harrison's technique for formalising Euclidean spaces is contrasted with an approach using Isabelle/HOL's axiomatic type classes. However, every formal system can be outgrown, and mathematics should be formalised with a view that it will eventually migrate to a new formalism

Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols

We define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of principals and the current global state of the session. Hereby, we can describe the operational semantics of principals and of an intruder in a simple and modular way. Furthermore, using proof theoretic tools like the analysis of permutability of rules, we are able to find efficient proof strategies that we prove complete for special classes of security protocols including Needham-Schroeder. Based on the results of this preliminary analysis, we have implemented a Prolog meta-interpreter which allows for rapid prototyping and for checking safety properties of security protocols, and we have applied it for finding error traces and proving correctness of practical examples