Sciweavers

90 search results - page 4 / 18
» Detecting interleaving
Sort
View
ASPLOS
2010
ACM
15 years 10 months ago
ConMem: detecting severe concurrency bugs through an effect-oriented approach
Multicore technology is making concurrent programs increasingly pervasive. Unfortunately, it is difficult to deliver reliable concurrent programs, because of the huge and non-det...
Wei Zhang, Chong Sun, Shan Lu
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 5 months ago
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
Vineet Kahlon, Chao Wang
148
Voted
ACSC
2009
IEEE
15 years 10 months ago
HOPPER: a hierarchical planning agent for unpredictable domains
Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited t...
Maciej Wojnar, Peter Andreae
SIGSOFT
2008
ACM
16 years 3 months ago
Inter-context control-flow and data-flow test adequacy criteria for nesC applications
NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known ...
Zhifeng Lai, Shing-Chi Cheung, Wing Kwong Chan
VMCAI
2004
Springer
15 years 8 months ago
History-Dependent Scheduling for Cryptographic Processes
Abstract. This paper presents history-dependent scheduling, a new technique for reducing the search space in the verification of cryptographic protocols. This technique allows the...
Vincent Vanackère