346 search results - page 54 / 70 » Determinizing Asynchronous Automata |
FASE
2006
Springer
15 years 3 months ago
2006
Springer
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication and Web services. Specifically, we assume that a prog...
96
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—The success of future P2P applications ultimately depends on whether users will contribute their bandwidth, CPU and storage resources to a larger community. In this paper, we pr...
107
click to vote
CADE
2002
Springer
16 years 2 days ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
107
click to vote
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
ACSD
2005
IEEE
15 years 5 months ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...