26 search results - page 5 / 6 » Reducing Context-Bounded Concurrent Reachability to Sequenti... |
TABLEAUX
1998
Springer
13 years 9 months ago
1998
Springer
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
CAV
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
AMAST
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
PLDI
2009
ACM
14 years 12 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...