15885 search results - page 2447 / 3177 » The Modest Software Engineer |
161
click to vote
FATES
2003
Springer
16 years 20 days ago
2003
Springer
We present work on a tool environment for model-based testing with the Abstract State Machine Language (AsmL). Our environment supports semiautomatic parameter generation, call seq...
191
click to vote
FOSSACS
2003
Springer
16 years 20 days ago
2003
Springer
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...
178
click to vote
FOSSACS
2003
Springer
16 years 20 days ago
2003
Springer
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...
186
click to vote
FSTTCS
2003
Springer
16 years 20 days ago
2003
Springer
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...
188
click to vote
FSTTCS
2003
Springer
16 years 20 days ago
2003
Springer
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...