855 search results - page 164 / 171 » Using First-Order Logic to Reason about Policies |
AAAI
1994
13 years 9 months ago
1994
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
OOPSLA
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...