Sciweavers

15779 search results - page 2506 / 3156
» Change-oriented software engineering
Sort
View
146
Voted
FOSSACS
2003
Springer
15 years 10 months ago
Type Assignment for Intersections and Unions in Call-by-Value Languages
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...
Joshua Dunfield, Frank Pfenning
FOSSACS
2003
Springer
15 years 10 months ago
Model Checking Lossy Channels Systems Is Probably Decidable
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...
Nathalie Bertrand, Ph. Schnoebelen
136
Voted
FSTTCS
2003
Springer
15 years 10 months ago
Pushdown Games with Unboundedness and Regular Conditions
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...
FSTTCS
2003
Springer
15 years 10 months ago
Word Equations over Graph Products
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...
Volker Diekert, Markus Lohrey
140
Voted
FSTTCS
2003
Springer
15 years 10 months ago
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
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...
Nikhil R. Devanur, Vijay V. Vazirani
« Prev « First page 2506 / 3156 Last » Next »