Sciweavers

1880 search results - page 351 / 376
» A Static Analysis for Beta-Binders
Sort
View
90
Voted
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
16 years 1 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
120
Voted
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 1 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...
114
Voted
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 1 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
CHI
2007
ACM
16 years 1 months ago
Effects of presenting geographic context on tracking activity between cameras
A common video surveillance task is to keep track of people moving around the space being monitored. It is often difficult to track activity between cameras because locations such...
Andreas Girgensohn, Frank M. Shipman III, Thea Tur...
225
Voted
POPL
2006
ACM
16 years 1 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam