Sciweavers

105 search results - page 13 / 21
» Proving optimizations correct using parameterized program eq...
Sort
View
93
Voted
FOCS
2010
IEEE
14 years 9 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
ICSE
2010
IEEE-ACM
15 years 1 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
ECOOP
2006
Springer
15 years 3 months ago
Automatic Prefetching by Traversal Profiling in Object Persistence Architectures
Object persistence architectures support transparent access to persistent objects. For efficiency, many of these architectures support queries that can prefetch associated objects ...
Ali Ibrahim, William R. Cook
PLDI
2010
ACM
15 years 2 months ago
DRFX: a simple and efficient memory model for concurrent programming languages
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 5 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto