We consider what natural language explanations are required to present a formalism. We desire to be as complete as possible, leaving nothing implicit, and yet to keep the natural language to a minimum, moving as quickly as possible away from informal explanations and into the formalism. We also try to keep the informal explanation as independent as possible of the formalism being presented. We ...

This paper reports on the formalization and proof of soundness, using the Coq proof assistant, of an alias analysis: a static analysis that approximates the flow of pointer values. The alias analysis considered is of the points-to kind and is intraprocedural, flow-sensitive, field-sensitive, and untyped. Its soundness proof follows the general style of abstract interpretation. The analysis is d...

Formally-specified computations are defined by logical statements (a.k.a. claims) interpreted in a computable model. Semantic Games (SGs) of claims provide novel answers to crowdsourcing challenges yet with several limitations. We provide a comprehensive analysis of the limitations of SGs when used for crowdsourcing and propose a new concept, called the Contradiction-Agreement Game (CAG), which...

A recon gurable fault tolerant system achieves the attributes of dependability of operations through fault detection fault isolation and recon guration typically referred to as the FDIR paradigm Fault diagnosis is a key component of this approach requiring an accurate deter mination of the health and state of the system An imprecise state assessment can lead to catastrophic failure due to an op...

This paper brietly describes our initial experiences tn applied research of formal approaches to the generation and maintenance of software systems supporting structural engineering tasks. We describe the business context giving cise to this activity, and give an example of the type of engineering problem we have focused on. WC hrielly describe our approach to software generation and maintenanc...

This paper argues that the Humean theory of chance is formally adequate in the sense that it satisfies the axioms of finitely additive probability. To this end, firstly, a functionalist account of chance is defended, according to which chance is a functional property and the function relevant to chance is to constrain an agent’s credence in the manner prescribed by David Lewis’s Principal Princ...

We consider the signatures Σm = (0, 1,−,+, ·, ) of meadows and (Σm, s) of signed meadows. We give two complete axiomatizations of the equational theories of the real numbers with respect to these signatures. In the first case, we extend the axiomatization of zero-totalized fields by a single axiom scheme expressing formal realness; the second axiomatization presupposes an ordering. We apply the...