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

IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjecture and prove theorems automatically. This paper introduces our approach to proof planning, gives and overview of IsaPlanner, and presents one simple yet effective reasoning technique.

IsaPlanner: A Prototype Proof Planner in Isabelle

This paper describes a diagrammatic approach to the formal verification of web-services composition. We present a set of graphical composition rules that map to proof steps in Classical Linear Logic (CLL) and can be used to drive the proof assistant HOL Light purely through interactive, diagrammatic reasoning. The end result is a verified, workflow-like diagram that provides a visual account of the composition process and of the information flow between the services making up the composite service. Our approach thus removes the need to interact directly with HOL Light and provides a mean of visualising and carrying out the whole verification process at an intuitive, yet fully rigorous, level.

Diagrammatically-Driven formal verification of web-services composition

This paper describes part of the formalization of Hilbert's Grundlagen der Geometrie in the higher order logic of Isabelle/Isar, an extension of the interactive theorem prover Isabelle. Many mechanized proofs and formalization issues are discussed and the work is compared against Hilbert's prose and also other research in the field.

Formalizing Hilbert's Grundlagen in isabelle/isar

This paper describes part of the formalization of Hilbert’s Grundlagen der Geometrie in the higher order logic of Isabelle/Isar, an extension of the interactive theorem prover Isabelle. Many mechanized proofs and formalization issues are discussed and the work is compared against Hilbert’s prose and also other research in the field.

Jacques Fleuriot

Papers

Constructing Induction Rules for Deductive Synthesis Proofs

IsaPlanner: A Prototype Proof Planner in Isabelle

Diagrammatically-Driven formal verification of web-services composition

Formalizing Hilbert's Grundlagen in isabelle/isar

Formalizing Hilbert’s Grundlagen in Isabelle/Isar