Sciweavers

476 search results - page 7 / 96
» Representation dependence testing using program inversion
Sort
View
ECRTS
2002
IEEE
14 years 17 days ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
ECOOP
2005
Springer
14 years 1 months ago
Aspect-Oriented Programming Beyond Dependency Injection
Abstract. Dependency injection is a hot topic among industrial developers using component frameworks. This paper first mentions that dependency injection and aspect-oriented progr...
Shigeru Chiba, Rei Ishikawa
PLILP
1994
Springer
13 years 11 months ago
Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
John Field, Frank Tip
ISSTA
2010
ACM
13 years 9 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
13 years 12 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan