Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Abstract. Transactional memory systems trade ease of programming with runtime performance losses in handling transactions. This paper focuses on starvation effects that show up in ...
: Currently, user interfaces are defined by single applications but workflows may span multiple ones. In the result, users have to work with separated programs in parallel and de...
Current resource managers do not have adequate node allocation and distribution strategies to efficiently schedule jobs on multi-core multi-threaded systems. Clusters composed of ...