Sciweavers

266 search results - page 20 / 54
» General Homomorphic Overloading
Sort
View
FROCOS
2005
Springer
14 years 1 months ago
Connecting Many-Sorted Structures and Theories Through Adjoint Functions
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
Franz Baader, Silvio Ghilardi
CSCW
2006
ACM
14 years 2 months ago
Improving network efficiency in real-time groupware with general message compression
Groupware communicates by sending messages across the network, and groupware programmers use a variety of formats for these messages, such as XML, plain text, or serialized object...
Carl Gutwin, Christopher Fedak, Mark Watson, Jeff ...
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 8 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CSFW
2005
IEEE
14 years 2 months ago
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
Martín Abadi, Véronique Cortier
ESOP
2009
Springer
14 years 9 days ago
Handlers of Algebraic Effects
We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include ...
Gordon D. Plotkin, Matija Pretnar