Sciweavers

309 search results - page 62 / 62
» Termination proofs for systems code
Sort
View
POPL
1992
ACM
14 years 2 months ago
A Compilation Method for ML-Style Polymorphic Record Calculi
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
Atsushi Ohori
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 11 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ICFP
2002
ACM
14 years 10 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski
ICS
2009
Tsinghua U.
14 years 5 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...