Sciweavers

1882 search results - page 32 / 377
» Transformational Programming and Forests
Sort
View
LOPSTR
2001
Springer
14 years 28 days ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle
AAECC
1999
Springer
109views Algorithms» more  AAECC 1999»
14 years 24 days ago
A Fast Program Generator of Fast Fourier Transforms
Michael Clausen, Meinard Müller