Sciweavers

43 search results - page 1 / 9
» The Complexity of Predicting Atomicity Violations
Sort
View
TACAS
2009
Springer
111views Algorithms» more  TACAS 2009»
13 years 11 months ago
The Complexity of Predicting Atomicity Violations
Azadeh Farzan, P. Madhusudan
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
13 years 11 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
CAV
2009
Springer
116views Hardware» more  CAV 2009»
14 years 5 months ago
Meta-analysis for Atomicity Violations under Nested Locking
Abstract. We study the problem of determining, given a run of a concurrent program, whether there is any alternate execution of it that violates atomicity, where atomicity is defin...
Azadeh Farzan, P. Madhusudan, Francesco Sorrentino
IPPS
2006
IEEE
13 years 10 months ago
Decentralized runtime analysis of multithreaded applications
Violations of a number of common safety properties of multithreaded programs–such as atomicity and absence of dataraces–cannot be observed by looking at the linear execution t...
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Rosu
ACL
2010
13 years 2 months ago
Complexity Assumptions in Ontology Verbalisation
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
Richard Power