Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal fle...
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
We present an automata theoretic framework for modular schedulability analysis of real time asynchronous objects modeled in the language Creol. In previous work we analyzed the sch...
Frank S. de Boer, Tom Chothia, Mohammad Mahdi Jagh...
Abstract. The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of its ...
Ondrej Vosta, Irena Mlynkova, Jaroslav Pokorn&yacu...