63 search results - page 5 / 13 » Synthesis of Fault-Tolerant Concurrent Programs |
ADAEUROPE
2001
Springer
14 years 7 days ago
2001
Springer
This paper describes the transaction support framework OPTIMA and its implementation for Ada 95. First, a transaction model that fits concurrent programming languages is presented...
JPDC
2006
13 years 7 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a r...
ASPLOS
2006
ACM
14 years 1 months ago
2006
ACM
Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detect...
SIGADA
1999
Springer
13 years 12 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...