Sciweavers

4722 search results - page 370 / 945
» Representation-independent program analysis
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
ECCV
2000
Springer
16 years 8 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
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 9 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....