Sciweavers

2000 search results - page 61 / 400
» Program Transformation and Proof Transformation
Sort
View
ASIACRYPT
2010
Springer
14 years 8 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
COMCOM
2008
80views more  COMCOM 2008»
14 years 10 months ago
Transforming general networks into feed-forward by using turn-prohibition
The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding ...
Juan Echagüe, Jesús E. Villadangos, Vi...
CCS
2003
ACM
15 years 3 months ago
Secure protocol composition
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
Anupam Datta, Ante Derek, John C. Mitchell, Dusko ...
EUROPAR
2004
Springer
15 years 3 months ago
More Legal Transformations for Locality
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
Cédric Bastoul, Paul Feautrier
ESOP
2009
Springer
15 years 4 months ago
Modular Monad Transformers
Abstract. During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical n...
Mauro Jaskelioff