Sciweavers

2024 search results - page 283 / 405
» A Formal Model of Multi-agent Computations
Sort
View
CTRSA
2005
Springer
121views Cryptology» more  CTRSA 2005»
15 years 4 months ago
Time-Selective Convertible Undeniable Signatures
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
Fabien Laguillaumie, Damien Vergnaud
ISPA
2005
Springer
15 years 4 months ago
ID-Based Proxy Signature Using Bilinear Pairings
Identity-based (ID-based) public key cryptosystem can be a good alternative for certificate-based public key setting, especially when efficient key management and moderate securit...
Jing Xu, Zhenfeng Zhang, Dengguo Feng
TLCA
2005
Springer
15 years 4 months ago
Subtyping Recursive Types Modulo Associative Commutative Products
This work sets the formal bases for building tools that help retrieve classes in object-oriented libraries. In such systems, the user provides a query, formulated as a set of class...
Roberto Di Cosmo, François Pottier, Didier ...
SAC
2004
ACM
15 years 4 months ago
A core calculus of higher-order mixins and classes
This work presents an object-oriented calculus based on higher-order mixin construction via mixin composition, where some software engineering requirements are modeled in a formal ...
Lorenzo Bettini, Viviana Bono, Silvia Likavec
GI
2001
Springer
15 years 3 months ago
Specifying Component Invariants with OCL
The “Object Constraint Language” (OCL) offers a formal notation for constraining model elements in UML diagrams. OCL consists of a navigational expression language which, for ...
Rolf Hennicker, Hubert Baumeister, Alexander Knapp...