We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functiona...
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
Alexis-Julien Bouquet, Olivier Serre, Igor Walukie...
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...