Rigid E -unification is the problem of unifying two expressions modulo a set of equations, with the assumption that every variable denotes exactly one term (rigid semantics). This form of unificationâ€¦ (More)

Rigid E -unification is the problem of unifying two expressions modulo a set of equations, with the assumption that every variable denotes exactly one term (rigid semantics). This form of unificationâ€¦ (More)

Function synthesis is the problem of automatically constructing functions that fulfil a given specification. Using templates to limit the form of those functions is a popular way of reducing theâ€¦ (More)

The automation of reasoning has been an aim of research for a long time. Already in 17th century, the famous mathematician Leibniz invented a mechanical calculator capable of performing all fourâ€¦ (More)

We consider the problem of solving floating-point constraints obtained from software verification. We present UppSAT â€” an new implementation of a systematic approximation refinement framework [24] asâ€¦ (More)

The efficient integration of theory reasoning in first-order calculi with free variables (such as sequent calculi or tableaux) is a longstanding challenge. For the case of the theory of equality, anâ€¦ (More)