We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted thir...
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
The paper presents a modular superposition calculus for the combination of firstorder theories involving both total and partial functions. The modularity of the calculus is a cons...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
We characterise the aperiodic autocorrelation for a Boolean function, f, and define the Aperiodic Propagation Criteria (APC) of degree l and order q. We establish the strong simil...
Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G...
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
We discuss Osius's [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiven...