IANDC
2008
13 years 11 months ago
2008
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...
IANDC
2006
14 years 19 days ago
2006
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 ...
IANDC
2006
14 years 19 days ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
IANDC
2006
14 years 19 days ago
2006
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...
IANDC
2006
14 years 19 days ago
2006
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...
IANDC
2006
14 years 19 days ago
2006
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...
IANDC
2006
14 years 19 days ago
2006
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...
IANDC
2006
14 years 19 days ago
2006
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...
IANDC
2006
14 years 19 days ago
2006
IANDC
2006
14 years 19 days ago
2006
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...