There is a growing interest in the integration of mechanized reasoning systems such as automated theorem provers, computer algebra systems, and model checkers. State-of-the-art reasoning systems are the result of many man-years of careful development and engineering, and usually they provide a high degree of sophistication in their respective domain. Yet they often perform poorly when applied o...

From 1946 to 1953 ten conferences—the first nine held at the Beekman Hotel at 575 Park Avenue in New York, the last at the Nassau Inn in Princeton, New Jersey—brought together at regular intervals some of the greatest minds of the twentieth century. Sponsored by the Josiah Macy, Jr. Foundation, these meetings have since come to be known as the Macy Conferences. The mathematicians, logicians, en...

In my view, the “verification problem” is the theorem proving problem, restricted to a computational logic. My approach is: adopt a functional programming language, build a general purpose formal reasoning engine around it, integrate it into a program and proof development environment, and apply it to model and verify a wide variety of computing artifacts, usually modeled operationally within t...

A GOOD translation of a novel requires many qualities from the translator. He must be a native speaker or have at least native-like command of the language into which he translates, the target language; he must have a good knowledge of the language from which he translates, the source language, and preferably have lived among the people who habitually speak the source language; he must have som...

We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning about sharing and aliasing in pointer-based data structures. Both of these are difficulties for reasoning in separation logic because they rely, fundamentally, on non-separate heaps. We show how sharing can be achieve...

Consider two abstract machines abc and def (described using B notation below). Both models represent the addition of two natural numbers. The second, however, introduces the limitation that, when implemented on a computer, the set of natural numbers cannot be infinite. It is felt that both of these models are needed within a development. The first for use at the abstract level when describing s...

We can adapt existing techniques for the statistical modeling of music to the modeling of the quality of musical performance, resulting in a fine-grained statistical understanding of ’hardness’ in music performance. This drives AI-assisted applications for improving skill. We present modeling results using various probabilistic models to model performance in the simplified setting of rhythm games.

During the past three years we have been integrating mechanized theorem proving into a traditional introductory course on formal methods. We explain our goals for adding mechanized provers to the course, and illustrate how we have integrated the provers into our syllabus to meet those goals. We also document some of the teaching materials we have developed for the course to date, and what our e...