Sciweavers

6960 search results - page 560 / 1392
» Continuity Analysis of Programs
Sort
View
STOC
2009
ACM
98views Algorithms» more  STOC 2009»
16 years 7 months ago
Sherali-adams relaxations of the matching polytope
We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for...
Claire Mathieu, Alistair Sinclair
CAV
2009
Springer
164views Hardware» more  CAV 2009»
16 years 7 months ago
InvGen: An Efficient Invariant Generator
Abstract. In this paper we present InvGen, an automatic linear arithmetic invariant generator for imperative programs. InvGen's unique feature is in its use of dynamic analysi...
Ashutosh Gupta, Andrey Rybalchenko
DEXAW
2005
IEEE
159views Database» more  DEXAW 2005»
16 years 26 days ago
A Self-Healing Approach for Object-Oriented Applications
In this paper, we present our approach and architecture for fault diagnosis and self-healing of interpreted objectoriented applications. By combining aspect-oriented programming, ...
A. Reza Haydarlou, Benno J. Overeinder, Frances M....
APLAS
2008
ACM
15 years 9 months ago
Game Characterizations of Process Equivalences
In this paper we propose a hierarchy of games that allows us to make a systematic comparison of process equivalences by characterizing process equivalences as games. The well-known...
Xin Chen, Yuxin Deng
IPL
2007
71views more  IPL 2007»
15 years 7 months ago
A short proof of optimality for the MIN cache replacement algorithm
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
Benjamin Van Roy