Sciweavers

1096 search results - page 13 / 220
» Computation Slicing: Techniques and Theory
Sort
View
SIGSOFT
2007
ACM
14 years 8 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
LICS
2009
IEEE
14 years 2 months ago
Clipping: A Semantics-Directed Syntactic Approximation
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
Dan R. Ghica, Adam Bakewell
HPDC
2002
IEEE
14 years 21 days ago
A Comparison of TCP Automatic Tuning Techniques for Distributed Computing
Rather than painful, manual, static, per-connection optimization of TCP buffer sizes simply to achieve acceptable performance for distributed applications [8, 10], many researcher...
Eric Weigle, Wu-chun Feng
DAGSTUHL
2007
13 years 9 months ago
Homotopy Methods to Compute Equilibria in Game Theory
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....
P. Jean-Jacques Herings, Ronald Peeters
COMPSAC
2000
IEEE
14 years 5 days ago
Dependence Analysis of Java Bytecode
Understanding program dependencies in a computer program is essential for many software engineering tasks such as program understanding, testing, debugging, reverse engineering, a...
Jianjun Zhao