73 search results - page 12 / 15 » On the Automatizability of Polynomial Calculus |
79
Voted
JAR
2006
14 years 11 months ago
2006
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
85
Voted
JCT
2010
14 years 10 months ago
2010
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Sch¨utzenberger’s jeu de taquin....
127
click to vote
CORR
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
84
Voted
DLT
2008
15 years 1 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
101
Voted
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...