We describe an approach for combining theorem proving techniques with static analysis to analyze data structure consistency for programs that manipulate heterogeneous data structures. Our system uses interactive theorem proving and shape analysis to verify that data structure implementations conform to set interfaces. A simpler static analysis then uses the verified set interfaces to verify pro...

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-28 was twenty-sixth competition in CASC series. Twenty-two systems competed various divisions. This paper presents an outline design and a commentated summary results.

"DONALD MACKENZIE This article reviews the history of the use of computers to automate mathematical proofs. It identifies three broad strands of work: automatic theorem proving where the aim is to simulate human processes of deduction; automatic theorem proving where any resemblance to how humans deduce is considered to be irrelevant; and interactive theorem proving, where the proof is directly...

This paper presentS a special case of Explanation-Based Generalization (EBG), Goal Generalization. Goal generalization. which cries to find a proof for the most general solvable ve~ion of a specific goal while solving the specific goal, is an application of EBG methods in automatic theorem proving and is a general technique applicable to many goal-oriented theorem proving systems. We will descr...

Real-world applications of theorem proving require open and modern software environments that enable modularization, distribution, inter-operability, networking, and coordination. This paper describes the DMS architecture for automated theorem proving that connects a wide-range of mathematical services by a common, mathematical software bus. It also presents an implementation, Oz-DMS, of the ar...