Abstract. We develop compositional analysis algorithms for detecting nontermination in multithreaded programs. Our analysis explores fair and ultimatelyperiodic executions—i.e., ...
Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi...
Abstract. The technique of hyper-programming allows program representations held in a persistent store to contain embedded links to persistent code and data. In 1994, Connor et al ...
Evangelos Zirintsis, Graham N. C. Kirby, Ronald Mo...
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
Abstract. This paper argues that accrual should be modelled in terms of reasoning about the application of preferences to sets of arguments, and shows how such reasoning can be for...
Abstract. A strategy-tree provides a systematic approach to the evaluation of the effectiveness of deployed policy sets and a mechanism to dynamically alter policy sets (i.e., alt...