147 search results - page 6 / 30 » Reasoning about Deadlines in Concurrent Real-Time Programs |
POPL
2007
ACM
14 years 9 months ago
2007
ACM
The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a s...
ENTCS
2008
13 years 8 months ago
2008
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
LOGCOM
1998
13 years 8 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
We present an automatic verification procedure based on RGSep that is suitable for reasoning about fine-grained concurrent heapmanipulating programs. The procedure computes a set o...
FMOODS
2008
13 years 10 months ago
2008
Reasoning about object-oriented programs is hard, due to , dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is eve...