Sciweavers

Share
IANDC
2008
84views more  IANDC 2008»
8 years 8 months ago
Authenticating ad hoc networks by comparison of short digests
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...
L. H. Nguyen, A. W. Roscoe
IANDC
2006
82views more  IANDC 2006»
8 years 9 months ago
Recognizability, hypergraph operations, and logical types
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 ...
Achim Blumensath, Bruno Courcelle
IANDC
2006
121views more  IANDC 2006»
8 years 9 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
IANDC
2006
102views more  IANDC 2006»
8 years 9 months ago
Modular proof systems for partial functions with Evans equality
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...
IANDC
2006
101views more  IANDC 2006»
8 years 9 months ago
Mind change efficient learning
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...
Wei Luo, Oliver Schulte
IANDC
2006
102views more  IANDC 2006»
8 years 9 months ago
Polynomial certificates for propositional classes
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 ...
IANDC
2006
93views more  IANDC 2006»
8 years 9 months ago
Aperiodic propagation criteria for Boolean functions
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...
IANDC
2006
126views more  IANDC 2006»
8 years 9 months ago
Coalgebraic semantics for timed processes
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...
Marco Kick, John Power, Alex Simpson
IANDC
2006
67views more  IANDC 2006»
8 years 9 months ago
Decision procedures for term algebras with integer constraints
Ting Zhang, Henny B. Sipma, Zohar Manna
IANDC
2006
99views more  IANDC 2006»
8 years 9 months ago
Recursive coalgebras from comonads
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...
Venanzio Capretta, Tarmo Uustalu, Varmo Vene
books