906 search results - page 33 / 182 » Linking Theories of Concurrency |
169
click to vote
POPL
2004
ACM
15 years 11 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
139
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
Many attempts to bridge the digital divide between lesser-developed countries (LDC) through Information & Communication Technology (ICT) projects have had little success. With...
153
click to vote
AMAST
2006
Springer
15 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...
192
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
159
click to vote
SEKE
2005
Springer
15 years 11 months ago
2005
Springer
Design combinatorial theory for test-case generation has been used successfully in the past. It is useful in optimizing test cases as it is practically impossible to exhaustively t...