Sciweavers

394 search results - page 2 / 79
» Formal polytypic programs and proofs
Sort
View
LPAR
2005
Springer
14 years 1 months ago
Functional Correctness Proofs of Encryption Algorithms
Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an imple...
Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens, K...
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 5 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent
TLCA
1993
Springer
13 years 12 months ago
Program Extraction from Normalization Proofs
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
Ulrich Berger
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
14 years 8 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin