Data provenance has evolved from a niche topic to a mainstream area of research in
databases and other research communities. This article gives a comprehensive introduction …

Recursive calls over recursive data are useful for generating probability distributions, and
probabilistic programming allows computations over these distributions to be expressed in a …

This article presents a novel generic technique for solving dataflow equations in
interprocedural dataflow analysis. The technique is obtained by generalizing Newton's …

Weighted pushdown automata (WPDAs) are at the core of many natural language
processing tasks, like syntax-based statistical machine translation and transition-based …

Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations
X1= f1 (X1,..., Xn),..., Xn= fn (X1,..., Xn) where each fi is a polynomial with positive real …

Abstract The Strahler number or Horton-Strahler number of a tree, originally introduced in
geophysics, has a surprisingly rich theory. We sketch some milestones in its history, and its …

We show a new and constructive proof of the following language-theoretic result: for every
context-free language L, there is a bounded context-free language L′⊆ L which has the …

We introduce FPSOLVE, an implementation of generic algorithms for solving fixpoint
equations over semirings. We first illustrate the interest of generic solvers by means of a …

Fixed point equations x= F (x) over ω-continuous semirings are a natural mathematical
foundation of interprocedural program analysis. Equations over the semiring of the real …

In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also
called a non-linear Horn clause program) can be achieved using a solver for linear Horn …