Sciweavers

1258 search results - page 98 / 252
» Table design in dynamic programming
Sort
View
CCS
2010
ACM
15 years 2 days ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
PRESENCE
1998
112views more  PRESENCE 1998»
14 years 11 months ago
The Sounds of Physical Shapes
We propose a general framework for the simulation of sounds produced by colliding physical objects in a virtual reality environment. The framework is based on the vibration dynami...
Kees van den Doel, Dinesh K. Pai
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 11 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
OOPSLA
2010
Springer
14 years 10 months ago
MetaFJig: a meta-circular composition language for Java-like classes
We propose a Java-like language where class denitions are rst class values, hence new classes can be derived from existing, rather than by a xed mechanism like inheritance, by e...
Marco Servetto, Elena Zucca
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
14 years 10 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv