Sciweavers

10 search results - page 2 / 2
» Partial Evaluation of Numerical Programs in Fortran
Sort
View
PADO
2001
Springer
13 years 12 months ago
Type Systems for Useless-Variable Elimination
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
Adam Fischbach, John Hannan
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
14 years 4 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
ACSAC
2010
IEEE
13 years 5 months ago
G-Free: defeating return-oriented programming through gadget-less binaries
Despite the numerous prevention and protection mechanisms that have been introduced into modern operating systems, the exploitation of memory corruption vulnerabilities still repr...
Kaan Onarlioglu, Leyla Bilge, Andrea Lanzi, Davide...
TOMS
2010
106views more  TOMS 2010»
13 years 5 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
WISEC
2010
ACM
14 years 2 months ago
Timing-based localization of in-band wormhole tunnels in MANETs
The problem of localizing in-band wormhole tunnels in MANETs is considered. In an in-band wormhole attack, colluding attackers use a covert tunnel to create the illusion that two ...
Jinsub Kim, Dan Sterne, Rommie Hardy, Roshan K. Th...