<--- Back to Details
First PageDocument Content
Theoretical computer science / Concurrency / Software bugs / Logic in computer science / Transaction processing / Deadlock / Lock / Parallel computing / Thread / Computing / Concurrency control / Computer programming
Date: 2006-06-05 17:22:17
Theoretical computer science
Concurrency
Software bugs
Logic in computer science
Transaction processing
Deadlock
Lock
Parallel computing
Thread
Computing
Concurrency control
Computer programming

Confirmation of Deadlock Potentials Detected by Runtime Analysis Saddek Bensalem

Add to Reading List

Source URL: www.havelund.com

Download Document from Source Website

File Size: 212,92 KB

Share Document on Facebook

Similar Documents

Auton Robot DOIs10514Reactive mission and motion planning with deadlock resolution avoiding dynamic obstacles Javier Alonso-Mora1,4 · Jonathan A. DeCastro2 · Vasumathi Raman3 ·

DocID: 1vhNQ - View Document

Lockout: Efficient Testing for Deadlock Bugs ∗ Ali Kheradmand School of Computer and

DocID: 1uLHk - View Document

Breaking through the Digital Deadlock Meredith Whalen SVP, IT Executive, Industry, Software and Services Research © IDC Many Organizations Are at a DX Deadlock

DocID: 1uKlI - View Document

deadlock atto unico di Luca Viganò (1996) PERSONAGGI

DocID: 1uBbf - View Document

Static Trace-Based Deadlock Analysis for Synchronous Mini-Go Kai Stadtm¨ uller1 , Martin Sulzmann1 , and Peter Thiemann2 1

DocID: 1tGzX - View Document