147 search results - page 3 / 30 » Reasoning about Deadlines in Concurrent Real-Time Programs |
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
ECRTS
2008
IEEE
14 years 6 days ago
2008
IEEE
There is a need for using virtual memory in real-time applications: using virtual addressing provides isolation between concurrent processes; in addition, paging allows the execut...
APLAS
2007
ACM
13 years 9 months ago
2007
ACM
We present a resource oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. T...
CAV
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
APLAS
2008
ACM
13 years 7 months ago
2008
ACM
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic....