Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
Logical frameworks serve as meta-languages to represent deductive systems, sometimes requiring special purpose meta logics to reason about the representations. In this work, we de...
Forms are the most common way to interface users and Web-based applications. Traditional forms cannot provide the functionality needed to fulfil the requirements of complex appli...