Sciweavers

1390 search results - page 152 / 278
» On the Algebraic Structure of Convergence
Sort
View
ESORICS
2005
Springer
16 years 1 days ago
Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...
Michael Backes, Birgit Pfitzmann
PLILP
1997
Springer
15 years 10 months ago
DrScheme: A Pedagogic Programming Environment for Scheme
Abstract. Teaching introductory computing courses with Scheme elevates the intellectual level of the course and thus makes the subject more appealing to students with scienti c int...
Robert Bruce Findler, Cormac Flanagan, Matthew Fla...
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 6 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
DCG
1998
59views more  DCG 1998»
15 years 6 months ago
A Probabilistic Analysis of the Power of Arithmetic Filters
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
Olivier Devillers, Franco P. Preparata
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon