Sciweavers

2976 search results - page 273 / 596
» On the bounded integer programming
Sort
View
ACSAC
2004
IEEE
15 years 8 months ago
A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors)
Buffer overflow vulnerabilities are caused by programming errors that allow an attacker to cause the program to write beyond the bounds of an allocated memory block to corrupt oth...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
128
Voted
SSS
2005
Springer
115views Control Systems» more  SSS 2005»
15 years 10 months ago
Code Stabilization
Dijkstra’s concept of self-stabilization assumes that faults can only affect the variables of a program. We study the notion of selfstabilization if faults can also affect (i.e...
Felix C. Freiling, Sukumar Ghosh
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
16 years 2 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
CADE
2007
Springer
16 years 5 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
COMPGEOM
2009
ACM
15 years 11 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan