PLCA is a framework for qualitative spatial reasoning that uses symbolic objects and the relationships between them. The second and third authors introduced inductive constructions to show construction of a PLCA expression. They also proved that expressions obtained by inductive constructions are planar (planarity) and that planar PLCA expressions can be obtained using inductive constructions (...

We present some experiments with CiME/COCCINELLE about standard first-order unification of deep-embedded terms in the Coq proof assistant. We have modelled parts of the usual inference rules for unification, namely Decompose, Merge and Coalesce as Coq functions and we proved their soundness and completeness. Regarding the Generalized Occur-Check, we use the CiME rewriting toolbox as an oracle e...

Effective support for custom proof automation is essential for largescale interactive proof development. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on advanced type-theoretic machinery that is not easily integrated into established theorem provers. We pr...

This article presents a survey of published literature about various quality costing approaches and reports of their success in order to provide a better understanding of cost of quality (CoQ) methods. Even though the literature review shows an interest by the academic community, a CoQ approach is not utilized in most quality management programs. Nevertheless, evidence is presented which shows ...

Mechanized proof assistants are powerful verification tools, but proof developments can still be difficult and timeconsuming. When verifying a family of related programs, the effort can be reduced by proof reuse. In this paper, we show how to engineer proofs for product lines built from feature modules. Each module contains proof fragments which are composed together to build a complete proof o...

The CH2O project at the RU Nijmegen works towards developing a Coq formalization of a significant fragment of the C programming language as described by the C11 standard. In this project, we have developed a (non-deterministic small step) operational and executable semantics of a typed C core language, a type correct translation of actual C programs into this core language, and extensions of se...

We propose a new tactic language for the system Coq, which is intended to enrich the current tactic combinators (tacticals). This language is based on a functional core with recursors and matching operators for Coq terms but also for proof contexts. It can be used directly in proof scripts or in toplevel de nitions (tactic de nitions). We show that the implementation of this language involves c...