Sciweavers

32 search results - page 5 / 7
» Non-cycle-accurate sequential equivalence checking
Sort
View
PKC
1999
Springer
87views Cryptology» more  PKC 1999»
13 years 11 months ago
On the Security of RSA Screening
Since many applications require the verification of large sets of signatures, it is sometimes advantageous to perform a simultaneous verification instead of checking each signatu...
Jean-Sébastien Coron, David Naccache
FMCAD
2004
Springer
14 years 13 days ago
Proof Styles in Operational Semantics
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
Sandip Ray, J. Strother Moore
ENTCS
2007
124views more  ENTCS 2007»
13 years 7 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
SEFM
2006
IEEE
14 years 1 months ago
A PVS Based Framework for Validating Compiler Optimizations
An optimization can be specified as sequential compositions of predefined transformation primitives. For each primitive, we can define soundness conditions which guarantee that th...
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
IPPS
2000
IEEE
13 years 11 months ago
Monotonic Counters: A New Mechanism for Thread Synchronization
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
John Thornley, K. Mani Chandy