https://web4.cs.ucl.ac.uk/staff/j.gow/papers/clase05.pdf

Constructing Induction Rules for Deductive Synthesis Proofs

This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool. The contribution of the paper is to provide reference examples and modeling patterns.

A Tutorial on UPPAAL

This article proposes a taxonomy of model transformation, based on the discussions of a working group on model transformation of the Dagstuhl seminar on Language Engineering for Model-Driven Software Development. This taxonomy can be used, among others, to help developers in deciding which model transformation language or tool is best suited to carry out a particular model transformation activity.

/pdf/a-taxonomy-of-model-transformation-3cyk0bxs24.pdf

A Taxonomy of Model Transformation

Minimal recursion semantics (MRS) is a framework for computational semantics that is suitable for parsing and generation and that can be implemented in typed feature structure formalisms. We discuss why, in general, a semantic representation with minimal structure is desirable and illustrate how a descriptively adequate representation with a nonrecursive structure may be achieved. MRS enables a simple formulation of the grammatical constraints on lexical and phrasal semantics, including the principles of semantic composition. We have integrated MRS with a broad-coverage HPSG grammar.

/pdf/minimal-recursion-semantics-an-introduction-4hdjxn0v8q.pdf

Minimal Recursion Semantics An Introduction

Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution, similar to path-bounded model-checking) to determine test inputs for Parameterized Unit Tests. Pex learns the program behavior by monitoring execution traces. Pex uses a constraint solver to produce new test inputs which exercise different program behavior. The result is an automatically generated small test suite which often achieves high code coverage. In one case study, we applied Pex to a core component of the .NET runtime which had already been extensively tested over several years. Pex found errors, including a serious issue.

/pdf/pex-white-box-test-generation-for-net-1kpnw99ssd.pdf

Pex: white box test generation for .NET

We present a rigorous framework for the composition of Web Services within a higher order logic theorem prover. Our approach is based on the proofs-as-processes paradigm that enables inference rules of Classical Linear Logic (CLL) to be translated into p-calculus processes. In this setting, composition is achieved by representing available web services as CLL sentences, proving the requested composite service as a conjecture, and then extracting the constructed p-calculus term from the proof. Our framework, implemented in HOL Light, not only uses an expressive logic that allows us to incorporate multiple Web Services properties in the composition process, but also provides guarantees of soundness and correctness for the composition.

A theorem proving framework for the formal verification of Web Services Composition

We define the concept of collaborative theorem proving and outline our plan to make it a reality We believe that a successful implementation of collaborative theorem proving is a necessary prerequisite for the formal verification of large systems

ProofPeer: Collaborative Theorem Proving

In this paper, we describe how we captured and investigated incidence reasoning in Hilbert's Foundations of Geometry by using a new discovery tool integrated into an interactive proof assistant. Our tool exploits concurrency, inferring facts independently of the user with the incomplete proof as a guide. It explores the proof space, contributes tedious lemmas and discovers alternative proofs. We show how this tool allowed us to write readable formalised proof-scripts that correspond very closely to Hilbert's prose arguments.

An investigation of hilbert's implicit reasoning through proof discovery in idle-time

Algorithms for solving geometric problems are widely used in many scientific disciplines. Applications range from computer vision and robotics to molecular biology and astrophysics. Proving the correctness of these algorithms is vital in order to boost confidence in them. By specifying the algorithms formally in a theorem prover such as Isabelle, it is hoped that rigorous proofs showing their correctness will be obtained. This paper outlines our current framework for reasoning about geometric algorithms in Isabelle. It focuses on our case study of the convex hull problem and shows how Hoare logic can be used to prove the correctness of such algorithms.

Mechanical theorem proving in computational geometry

/pdf/automated-deduction-cade-26-3znnjgt2y5.pdf

Jacques Fleuriot

Papers

A theorem proving framework for the formal verification of Web Services Composition

ProofPeer: Collaborative Theorem Proving

An investigation of hilbert's implicit reasoning through proof discovery in idle-time

Mechanical theorem proving in computational geometry

Automated Deduction – CADE 26