Sciweavers

2436 search results - page 188 / 488
» Comonadic Notions of Computation
Sort
View
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Unifying Two Graph Decompositions with Modular Decomposition
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,...
KIVS
2007
Springer
16 years 1 months ago
A Proof of Concept Implementation of SSL/TLS Session-Aware User Authentication (TLS-SA)
Abstract Most SSL/TLS-based e-commerce applications employ conventional mechanisms for user authentication. These mechanisms—if decoupled from SSL/TLS session establishment—are...
Rolf Oppliger, Ralf Hauser, David A. Basin, Aldo R...
MFCS
2007
Springer
16 years 1 months ago
Height-Deterministic Pushdown Automata
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...
Dirk Nowotka, Jirí Srba
TGC
2007
Springer
16 years 1 months ago
Multipoint Session Types for a Distributed Calculus
Session types are a means of statically encoding patterns of interaction between two communicating parties. This paper explores a distributed calculus with session types in which a...
Eduardo Bonelli, Adriana B. Compagnoni
PODC
2006
ACM
16 years 1 months ago
Common2 extended to stacks and unbounded concurrency
Common2, the family of objects that implement and are wait-free implementable from 2 consensus objects, is extended inhere in two ways: First, the stack object is added to the fam...
Yehuda Afek, Eli Gafni, Adam Morrison