Sciweavers

2911 search results - page 539 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
POPL
2008
ACM
15 years 10 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen
POPL
2008
ACM
15 years 10 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
VLDB
2007
ACM
128views Database» more  VLDB 2007»
15 years 10 months ago
Automating the Detection of Snapshot Isolation Anomalies
Snapshot isolation (SI) provides significantly improved concurrency over 2PL, allowing reads to be non-blocking. Unfortunately, it can also lead to non-serializable executions in ...
Sudhir Jorwekar, Alan Fekete, Krithi Ramamritham, ...
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
15 years 10 months ago
Pay-as-you-go user feedback for dataspace systems
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
Shawn R. Jeffery, Michael J. Franklin, Alon Y. Hal...
ICFP
2007
ACM
15 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson