Sciweavers

837 search results - page 86 / 168
» Proof Development with OMEGA
Sort
View
96
Voted
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
15 years 7 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
95
Voted
ITICSE
2003
ACM
15 years 6 months ago
Studying program correctness by constructing contracts
Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory computer science (CS) students perceive it ...
Timothy S. Gegg-Harrison, Gary R. Bunce, Rebecca D...
126
Voted
PLDI
2003
ACM
15 years 6 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
FMCAD
2006
Springer
15 years 4 months ago
An Integration of HOL and ACL2
We describe a link between the ACL2 and HOL mechanical proof assistants that enables the strengths of each system to be deployed smoothly within a single formal development. Severa...
Michael J. C. Gordon, James Reynolds, Warren A. Hu...
181
Voted

Book
290views
16 years 10 months ago
Type Theory and Functional Programming
"Constructive Type theory has been a topic of research interest to computer scientists, mathematicians, logicians and philosophers for a number of years. For computer scient...
Simon Thompson