Sciweavers

1763 search results - page 16 / 353
» A Formalization of Polytime Functions
Sort
View
SCP
2000
135views more  SCP 2000»
13 years 9 months ago
A calculus of functional BSP programs
An extension of the -calculus called BS is introduced as a formal basis for functional languages expressing bulk synchronous parallel algorithms. A con uence result is shown. The ...
Frédéric Loulergue, Gaétan Ha...
IPL
2011
130views more  IPL 2011»
13 years 5 months ago
On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers
Fugue is an intriguing hash function design with a novel shift-register based compression structure and has formal security proofs e.g. against collision attacks. In this paper, w...
Jean-Philippe Aumasson, Raphael C.-W. Phan
DLT
2004
13 years 11 months ago
On the Maximum Coefficients of Rational Formal Series in Commuting Variables
We study the maximum function of any R+-rational formal series S in two commuting variables, which assigns to every integer n N, the maximum coefficient of the monomials of degree...
Christian Choffrut, Massimiliano Goldwurm, Violett...
CADE
2007
Springer
14 years 10 months ago
Formalization of Continuous Probability Distributions
Continuous probability distributions are widely used to mathematically describe random phenomena in engineering and physical sciences. In this paper, we present a methodology that ...
Osman Hasan, Sofiène Tahar
IFL
2000
Springer
135views Formal Methods» more  IFL 2000»
14 years 1 months ago
Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
Olaf Chitil, Colin Runciman, Malcolm Wallace