Sciweavers

439 search results - page 66 / 88
» Type invariants for Haskell
Sort
View
STACS
2001
Springer
14 years 1 days ago
Semantical Principles in the Modal Logic of Coalgebras
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
Dirk Pattinson
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 11 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
ESORICS
2000
Springer
13 years 11 months ago
Authentication and Confidentiality via IPSEC
The IP security protocols (IPsec) may be used via security gateways that apply cryptographic operations to provide security services to datagrams, and this mode of use is supported...
Joshua D. Guttman, Amy L. Herzog, F. Javier Thayer
ICALP
2000
Springer
13 years 11 months ago
Temporal Rewards for Performance Evaluation
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
Jeroen Voeten
APLAS
2008
ACM
13 years 9 months ago
Minimal Ownership for Active Objects
Active objects offer a structured approach to concurrency, encapsulating both unshared state and a thread of control. For efficient data transfer, data should be passed by referenc...
Dave Clarke, Tobias Wrigstad, Johan Östlund, ...