Sciweavers

74 search results - page 6 / 15
» An Evaluation of Slicing Algorithms for Concurrent Programs
Sort
View
ATAL
2006
Springer
13 years 11 months ago
The complexity of model checking concurrent programs against CTLK specifications
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
Alessio Lomuscio, Franco Raimondi
IPPS
2010
IEEE
13 years 5 months ago
Performance evaluation of concurrent collections on high-performance multicore computing systems
This paper is the first extensive performance study of a recently proposed parallel programming model, called Concurrent Collections (CnC). In CnC, the programmer expresses her co...
Aparna Chandramowlishwaran, Kathleen Knobe, Richar...
TACAS
2010
Springer
156views Algorithms» more  TACAS 2010»
13 years 5 months ago
Preemption Sealing for Efficient Concurrency Testing
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
SC
1995
ACM
13 years 11 months ago
Efficient Support of Location Transparency in Concurrent Object-Oriented Programming Languages
We describe the design of a runtime system for a fine-grained concurrent object-oriented (actor) language and its performance. The runtime system provides considerable flexibility...
WooYoung Kim, Gul Agha
AAAI
2008
13 years 8 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor