Sciweavers

406 search results - page 34 / 82
» PASSing the provenance challenge
Sort
View
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
15 years 10 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
15 years 10 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
ISSTA
2004
ACM
15 years 3 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick
SIGGRAPH
1997
ACM
15 years 1 months ago
Interactive update of global illumination using a line-space hierarchy
Interactively manipulating the geometry of complex, globally illuminated scenes has to date proven an elusive goal. Previous attempts have failed to provide interactive updates of...
George Drettakis, François X. Sillion
SIGGRAPH
1996
ACM
15 years 1 months ago
Blue Screen Matting
A classical problem of imaging--the matting problem--is separation of a non-rectangular foreground image from a (usually) rectangular background image--for example, in a film fram...
Alvy Ray Smith, James F. Blinn