A Framework for Modelling, Verification and Transformation of Concurrent Imperative Programs

The paper gives a comprehensive presentation of a framework, embedded into the simply typed higher-order logic, and aimed at providing a sound assistance in formal reasoning about models of imperative programs with interleaved computations. As a case study, a model of the Peterson's mutual exclusion algorithm will be scrutinised in the course of the paper illustrating applicability of the framework.Comment: 49 pages, to be published in Logical Methods in Computer Science; several rephrasings, a reference adde

Matching concepts across HOL libraries

Many proof assistant libraries contain formalizations of the same mathematical concepts. The concepts are often introduced (defined) in different ways, but the properties that they have, and are in turn formalized, are the same. For the basic concepts, like natural numbers, matching them between libraries is often straightforward, because of mathematical naming conventions. However, for more advanced concepts, finding similar formalizations in different libraries is a non-trivial task even for an expert. In this paper we investigate automatic discovery of similar concepts across libraries of proof assistants. We propose an approach for normalizing properties of concepts in formal libraries and a number of similarity measures. We evaluate the approach on HOL based proof assistants HOL4, HOL Light and Isabelle/HOL, discovering 398 pairs of isomorphic constants and types

Sharing HOL4 and HOL Light proof knowledge

New proof assistant developments often involve concepts similar to already formalized ones. When proving their properties, a human can often take inspiration from the existing formalized proofs available in other provers or libraries. In this paper we propose and evaluate a number of methods, which strengthen proof automation by learning from proof libraries of different provers. Certain conjectures can be proved directly from the dependencies induced by similar proofs in the other library. Even if exact correspondences are not found, learning-reasoning systems can make use of the association between proved theorems and their characteristics to predict the relevant premises. Such external help can be further combined with internal advice. We evaluate the proposed knowledge-sharing methods by reproving the HOL Light and HOL4 standard libraries. The learning-reasoning system HOL(y)Hammer, whose single best strategy could automatically find proofs for 30% of the HOL Light problems, can prove 40% with the knowledge from HOL4

The immune system as a foundation for immunologic therapy and hematologic malignancies: a historical perspective.

In this review we aim to provide a historical overview of the immunotherapeutic approaches which have been developed for the treatment of hematological malignancies. After briefly summarizing the development of the theory of cancer immune surveillance, we describe how initial studies discovering the efficacy of the immune-mediated graft-versus-tumor effects after allogeneic hematopoietic cell transplantation led to new transplantation approaches (termed non-myeloablative transplantation) relying almost exclusively on graft-versus-tumor effects for tumor eradication. We then summarize important steps in the development of tumor vaccines and autologous adoptive immunotherapy in patients with hematological malignancies. Finally, we describe historical discoveries leading to the recent success with monoclonal antibodies as treatment for lymphomas, chronic lymphocytic leukemia, and acute myeloid leukemia