The Use of Proof Planning for Cooperative Theorem Proving

AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. For the foreseeable future, there will be theorems which cannot be proved completely automatically, so the ability to allow human intervention is desirable; for this intervention to be productive the problem of orienting the user in the proof attempt must be overcome. There are many semi-automatic theorem provers: we call our style of theorem provingco-operative, in that the skills of both human and automaton are used each to their best advantage, and used together may find a proof where other methods fail. The co-operative nature of thebarnacleinterface is made possible by the proof planning technique underpinningclam. Our claim is that proof planning makes new kinds of user interaction possible.Proof planning is a technique for guiding the search for a proof in automatic theorem proving. Common patterns of reasoning in proofs are identified and represented computationally as proof plans, which can then be used to guide the search for proofs of new conjectures. We have harnessed the explanatory power of proof planning to enable the user to understand where the automatic prover got to and why it is stuck. A user can analyse the failed proof in terms ofclam's specification language, and hence override the prover to force or prevent the application of a tactic, or discover a proof patch. This patch might be to apply further rules or tactics to bridge the gap between the effects of previous tactics and the preconditions needed by a currently inapplicable tactic

Weighted Modal Transition Systems

Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature, and therefore fragile in the sense that the inevitable approximation of systems by models, combined with the fundamental unpredictability of hardware platforms, makes it difficult to transfer conclusions about the behavior, based on models, to the actual system. Hence this approach is arguably unsuited for modern software systems. We propose here the first specification theory which allows to capture quantitative aspects during the refinement and implementation process, thus leveraging the problems of the qualitative setting. Our proposed quantitative specification framework uses weighted modal transition systems as a formal model of specifications. These are labeled transition systems with the additional feature that they can model optional behavior which may or may not be implemented by the system. Satisfaction and refinement is lifted from the well-known qualitative to our quantitative setting, by introducing a notion of distances between weighted modal transition systems. We show that quantitative versions of parallel composition as well as quotient (the dual to parallel composition) inherit the properties from the Boolean setting.Comment: Submitted to Formal Methods in System Desig

A necessary and sufficient condition for induced model structures

A common technique for producing a new model category structure is to lift the fibrations and weak equivalences of an existing model structure along a right adjoint. Formally dual but technically much harder is to lift the cofibrations and weak equivalences along a left adjoint. For either technique to define a valid model category, there is a well-known necessary "acyclicity" condition. We show that for a broad class of "accessible model structures" - a generalization introduced here of the well-known combinatorial model structures - this necessary condition is also sufficient in both the right-induced and left-induced contexts, and the resulting model category is again accessible. We develop new and old techniques for proving the acyclity condition and apply these observations to construct several new model structures, in particular on categories of differential graded bialgebras, of differential graded comodule algebras, and of comodules over corings in both the differential graded and the spectral setting. We observe moreover that (generalized) Reedy model category structures can also be understood as model categories of "bialgebras" in the sense considered here.Comment: 49 pages; final journal version to appear in the Journal of Topolog

Partition function zeros at first-order phase transitions: Pirogov-Sinai theory

This paper is a continuation of our previous analysis [BBCKK] of partition functions zeros in models with first-order phase transitions and periodic boundary conditions. Here it is shown that the assumptions under which the results of [BBCKK] were established are satisfied by a large class of lattice models. These models are characterized by two basic properties: The existence of only a finite number of ground states and the availability of an appropriate contour representation. This setting includes, for instance, the Ising, Potts and Blume-Capel models at low temperatures. The combined results of [BBCKK] and the present paper provide complete control of the zeros of the partition function with periodic boundary conditions for all models in the above class.Comment: 46 pages, 2 figs; continuation of math-ph/0304007 and math-ph/0004003, to appear in J. Statist. Phys. (special issue dedicated to Elliott Lieb