We proposed a new algorithm for computing the ideal of all polynomial invariants for the class of extended P-solvable multi-path loops. The new approach computes the invariant ideal for a non-deterministic program (L1;…;Lr)∗ where the Li are single-…

Our result gives rise to a number of interesting directions for future work. First, whether our precise complexity analysis or the complete method can be extended to other models in program analysis (such as affine programs with loops) is an interes…

At the beginning of this paper we asked whether one can characterize logics over finite structures which satisfy the Feferman-Vaught Theorem for the disjoint union, or more generally, for sum-like and product-like operations on τ-structures. The pur…

We have discussed how the distinction between stochastic- and state-action fairness is so-far missing from the planning/AI literature. On the other hand, as we now discuss, this distinction is present in the verification literature.

While we illustrate synthesis and planning under assumptions expressed in linear-time specifications, our definitions immediately apply to assumptions expressed in branching-time specifications, e.g., CTL∗, μ-calculus, and tree automata. As future w…

While we illustrate synthesis and planning under assumptions expressed in linear-time specifications, our definitions immediately apply to assumptions expressed in branching-time specifications, e.g., CTL∗, μ-calculus, and tree automata. As future w…