Sciweavers

1182 search results - page 60 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
IJCAI
2007
13 years 11 months ago
Symmetric Component Caching
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
Matthew Kitching, Fahiem Bacchus
ADHOC
2008
132views more  ADHOC 2008»
13 years 10 months ago
Defending against cache consistency attacks in wireless ad hoc networks
Caching techniques can be used to reduce bandwidth consumption and data access delay in wireless ad hoc networks. When cache is used, the issue of cache consistency must be addres...
Wensheng Zhang, Guohong Cao
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
12 years 5 months ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
LCPC
2007
Springer
14 years 4 months ago
Using ZBDDs in Points-to Analysis
Binary Decision Diagrams (BDDs) have recently become widely accepted as a space-efficient method of representing relations in points-to analyses. When BDDs are used to represent re...
Ondrej Lhoták, Stephen Curial, José ...
ACSAC
2002
IEEE
14 years 3 months ago
Voice over IPsec: Analysis and Solutions
In this paper we present the results of the experimental analysis of the transmission of voice over secure communication links implementing IPsec. Critical parameters characterizi...
Roberto Barbieri, Danilo Bruschi, Emilia Rosti