Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, A...