Sciweavers

1452 search results - page 167 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
SIGSOFT
2007
ACM
16 years 1 months ago
Efficient checkpointing of java software using context-sensitive capture and replay
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...
Guoqing Xu, Atanas Rountev, Yan Tang, Feng Qin
104
Voted
SIGSOFT
1995
ACM
15 years 4 months ago
Precise Interprocedural Chopping
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
Thomas W. Reps, Genevieve Rosay
99
Voted
ACSC
2004
IEEE
15 years 4 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
ASE
2011
14 years 4 months ago
Alattin: mining alternative patterns for defect detection
Abstract To improve software quality, static or dynamic defect-detection tools accept programming rules as input and detect their violations in software as defects. As these progra...
Suresh Thummalapenta, Tao Xie
229
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 29 days ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup