Sciweavers

57 search results - page 3 / 12
» Automating Side Conditions in Formalized Partial Functions
Sort
View
FLOPS
2010
Springer
14 years 17 days ago
Automatically Generating Counterexamples to Naive Free Theorems
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
Daniel Seidel, Janis Voigtländer
ACSC
2004
IEEE
13 years 9 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 5 months ago
A constructive and unifying framework for zero-bit watermarking
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in a piece of content. The watermark detector checks ...
Teddy Furon
AISC
2004
Springer
13 years 9 months ago
Four Approaches to Automated Reasoning with Differential Algebraic Structures
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...
Jesús Aransay, Clemens Ballarin, Julio Rubi...
MMSEC
2006
ACM
167views Multimedia» more  MMSEC 2006»
13 years 11 months ago
Hermite polynomials as provably good functions to watermark white gaussian hosts
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
Teddy Furon