Sciweavers

439 search results - page 60 / 88
» Type invariants for Haskell
Sort
View
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
14 years 2 months ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...
ICMCS
1999
IEEE
105views Multimedia» more  ICMCS 1999»
13 years 12 months ago
Key Independent Watermark Detection
Many types of pseudo-random signals have been used to embed signatures as watermarks, with spread spectrum signal techniques used to recover the signature from the encrypted data....
Ron G. van Schyndel, Andrew Z. Tirkel, Imants D. S...
COMBINATORICS
2007
69views more  COMBINATORICS 2007»
13 years 7 months ago
On the Number of Genus One Labeled Circle Trees
A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-...
Karola Mészáros
ICASSP
2011
IEEE
12 years 11 months ago
Exposing duplicated regions affected by reflection, rotation and scaling
A commonly considered image manipulation is to conceal undesirable objects or people in the scene with a region of pixels copied from the same image. Forensic mechanisms aimed at ...
Sergio Bravo-Solorio, Asoke K. Nandi
POPL
2005
ACM
14 years 8 months ago
Downgrading policies and relaxed noninterference
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
Peng Li, Steve Zdancewic