Sciweavers

785 search results - page 104 / 157
» Static Analysis of Android Programs
Sort
View
LPAR
2010
Springer
14 years 12 months ago
ABC: Algebraic Bound Computation for Loops
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
Régis Blanc, Thomas A. Henzinger, Thibaud H...
POPL
2003
ACM
16 years 2 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
13 years 9 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
CORR
2002
Springer
114views Education» more  CORR 2002»
15 years 1 months ago
Offline Specialisation in Prolog Using a Hand-Written Compiler Generator
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalu...
Michael Leuschel, Jesper Jørgensen, Wim Van...
LCTRTS
2007
Springer
15 years 8 months ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...