I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...