Sciweavers

5962 search results - page 1031 / 1193
» Working with Patterns and Code
Sort
View
POPL
2008
ACM
16 years 4 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
247
Voted
POPL
2006
ACM
16 years 4 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 4 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
165
Voted
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
16 years 3 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
ICFP
2002
ACM
16 years 3 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
« Prev « First page 1031 / 1193 Last » Next »