Concurrency is the source of many real-world software reliability
and security problems. Concurrency defects are difficult to detect
because they defy conventional software testing techniques due to
their non-local and non-deterministic nature. We focus on one
important aspect of this problem: static detection of the
possibility of deadlock--a situation in which two or more processes
are prevented from continuing while each waits for resources to be
freed by the continuation of the other. This thesis proposes a
flow-insensitive interprocedural static analysis that detects the
possibility that a program can deadlock at runtime. Our analysis
proceeds in two steps. The first extracts the "real" call graph
decorated with acquired locks from the target program.
|Country of origin:
Jose E. Fadul
||246 x 189 x 7mm (L x W x T)
||Paperback - Trade
Social sciences >
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!