This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
This paper presents an algorithm for a non-standard logicminimization problem that arises in £ -valued propositional logic. The problem is motivated by the potential for obtainin...
Abstract. We present an approach to a coherent program synthesis system which integrates a variety of interactively controlled and automated techniques from theorem proving and alg...
Wolfgang Bibel, Daniel S. Korn, Christoph Kreitz, ...
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...