Soft Contract Verification

Behavioral software contracts are a widely used mechanism for governing the flow of values between components. However, run-time monitoring and enforcement of contracts imposes significant overhead and delays discovery of faulty components to run-time. To overcome these issues, we present soft contract verification, which aims to statically prove either complete or partial contract correctness of components, written in an untyped, higher-order language with first-class contracts. Our approach uses higher-order symbolic execution, leveraging contracts as a source of symbolic values including unknown behavioral values, and employs an updatable heap of contract invariants to reason about flow-sensitive facts. We prove the symbolic execution soundly approximates the dynamic semantics and that verified programs can't be blamed. The approach is able to analyze first-class contracts, recursive data structures, unknown functions, and control-flow-sensitive refinements of values, which are all idiomatic in dynamic languages. It makes effective use of an off-the-shelf solver to decide problems without heavy encodings. The approach is competitive with a wide range of existing tools---including type systems, flow analyzers, and model checkers---on their own benchmarks.Comment: ICFP '14, September 1-6, 2014, Gothenburg, Swede

Space shuttle orbit maneuvering engine reusable thrust chamber program

Tests were conducted on the regenerative cooled thrust chamber of the space shuttle orbit maneuvering engine. The conditions for the tests and the durations obtained are presented. The tests demonstrated thrust chamber operation over the nominal ranges of chamber pressure mixture ratio. Variations in auxiliary film coolant flowrate were also demonstrated. High pressure tests were conducted to demonstrate the thrust chamber operation at conditions approaching the design chamber pressure for the derivative space tug application

Size-Change Termination as a Contract

Termination is an important but undecidable program property, which has led to a large body of work on static methods for conservatively predicting or enforcing termination. One such method is the size-change termination approach of Lee, Jones, and Ben-Amram, which operates in two phases: (1) abstract programs into "size-change graphs," and (2) check these graphs for the size-change property: the existence of paths that lead to infinite decreasing sequences. We transpose these two phases with an operational semantics that accounts for the run-time enforcement of the size-change property, postponing (or entirely avoiding) program abstraction. This choice has two key consequences: (1) size-change termination can be checked at run-time and (2) termination can be rephrased as a safety property analyzed using existing methods for systematic abstraction. We formulate run-time size-change checks as contracts in the style of Findler and Felleisen. The result compliments existing contracts that enforce partial correctness specifications to obtain contracts for total correctness. Our approach combines the robustness of the size-change principle for termination with the precise information available at run-time. It has tunable overhead and can check for nontermination without the conservativeness necessary in static checking. To obtain a sound and computable termination analysis, we apply existing abstract interpretation techniques directly to the operational semantics, avoiding the need for custom abstractions for termination. The resulting analyzer is competitive with with existing, purpose-built analyzers

Recursive Algorithms for Distributed Forests of Octrees

The forest-of-octrees approach to parallel adaptive mesh refinement and coarsening (AMR) has recently been demonstrated in the context of a number of large-scale PDE-based applications. Although linear octrees, which store only leaf octants, have an underlying tree structure by definition, it is not often exploited in previously published mesh-related algorithms. This is because the branches are not explicitly stored, and because the topological relationships in meshes, such as the adjacency between cells, introduce dependencies that do not respect the octree hierarchy. In this work we combine hierarchical and topological relationships between octree branches to design efficient recursive algorithms. We present three important algorithms with recursive implementations. The first is a parallel search for leaves matching any of a set of multiple search criteria. The second is a ghost layer construction algorithm that handles arbitrarily refined octrees that are not covered by previous algorithms, which require a 2:1 condition between neighboring leaves. The third is a universal mesh topology iterator. This iterator visits every cell in a domain partition, as well as every interface (face, edge and corner) between these cells. The iterator calculates the local topological information for every interface that it visits, taking into account the nonconforming interfaces that increase the complexity of describing the local topology. To demonstrate the utility of the topology iterator, we use it to compute the numbering and encoding of higher-order $C^0$ nodal basis functions. We analyze the complexity of the new recursive algorithms theoretically, and assess their performance, both in terms of single-processor efficiency and in terms of parallel scalability, demonstrating good weak and strong scaling up to 458k cores of the JUQUEEN supercomputer.Comment: 35 pages, 15 figures, 3 table

Photocatalytic antimicrobial activity of thin surface films of TiO2, CuO and TiO2 /CuO dual layers on Escherichia coli and bacteriophage T4

TiO2 coated surfaces are increasingly studied for their ability to inactivate microorganisms. The activity of glass coated with thin films of TiO2, CuO and hybrid CuO/TiO2 prepared by atmospheric Chemical Vapour Deposition (Ap-CVD) and TiO2 prepared by a sol-gel process was investigated using the inactivation of bacteriophage T4 as a model for inactivation of viruses. The chemical oxidising activity was also determined by measuring stearic acid oxidation. The results showed that the rate of inactivation of bacteriophage T4 increased with increasing chemical oxidising activity with the maximum rate obtained on highly active sol-gel preparations. However these were delicate and easily damaged unlike the Ap-CVD coatings. Inactivation rates were highest on CuO and CuO/TiO2 which had the lowest chemical oxidising activities. The inactivation of T4 was higher than that of Escherichia coli on low activity surfaces. The combination of photocatalysis and toxicity of copper acted synergistically to inactivate bacteriophage T4 and retained some selfcleaning activity. The presence of phosphate ions slowed inactivation but NaCl had no effect. The results show that TiO2/CuO coated surfaces are highly antiviral and may have applications in the food and healthcare industries

A Flattened Protostellar Envelope in Absorption around L1157

Deep Spitzer IRAC images of L1157 reveal many of the details of the outflow and the circumstellar environment of this Class 0 protostar. In IRAC band 4, 8 microns, there is a flattened structure seen in absorption against the background emission. The structure is perpendicular to the outflow and is extended to a diameter of 2 arcminutes. This structure is the first clear detection of a flattened circumstellar envelope or pseudo-disk around a Class 0 protostar. Such a flattened morphology is an expected outcome for many collapse theories that include magnetic fields or rotation. We construct an extinction model for a power-law density profile, but we do not constrain the density power-law index.Comment: ApJL accepte