Sciweavers

619 search results - page 64 / 124
» Generic Extensions and Generic Polynomials
Sort
View
ICFP
2003
ACM
14 years 9 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
STACS
2010
Springer
14 years 4 months ago
Named Models in Coalgebraic Hybrid Logic
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
Lutz Schröder, Dirk Pattinson
AICT
2007
IEEE
113views Communications» more  AICT 2007»
14 years 3 months ago
Ontologies to Support Call Control Policies
—The topic of policy-based management is introduced. Its specific application by the ACCENT project to call control is then discussed. The APPEL policy language supports regular ...
Gemma A. Campbell, Kenneth J. Turner
ESWS
2007
Springer
14 years 3 months ago
Two-Phase Web Service Discovery Based on Rich Functional Descriptions
Discovery is a central reasoning task in service-oriented architectures, concerned with detecting Web services that are usable for solving a given request. This paper presents two ...
Michael Stollberg, Uwe Keller, Holger Lausen, Stij...
PAIRING
2007
Springer
14 years 3 months ago
Remarks on Cheon's Algorithms for Pairing-Related Problems
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
Shunji Kozaki, Taketeru Kutsuma, Kazuto Matsuo