Sciweavers

12774 search results - page 269 / 2555
» A Framework for Proof Systems
Sort
View
CCS
2005
ACM
16 years 6 days ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov
IPPS
1998
IEEE
15 years 11 months ago
Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
Ruben Gamboa
DATE
2009
IEEE
64views Hardware» more  DATE 2009»
15 years 10 months ago
Speculative reduction-based scalable redundancy identification
The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inhere...
Hari Mony, Jason Baumgartner, Alan Mishchenko, Rob...
ICFEM
2000
Springer
15 years 10 months ago
Fragmented Retrenchment, Concurrency and Fairness
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
Richard Banach, Michael Poppleton
FMOODS
2007
15 years 8 months ago
A Mechanized Model of the Theory of Objects
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
Ludovic Henrio, Florian Kammüller