Sciweavers

4722 search results - page 147 / 945
» Representation-independent program analysis
Sort
View
MEMOCODE
2003
IEEE
14 years 2 months ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Tobias Schüle, Klaus Schneider
SCAM
2005
IEEE
14 years 2 months ago
Pointer Analysis for Source-to-Source Transformations
We present a pointer analysis algorithm designed for source-to-source transformations. Existing techniques for pointer analysis apply a collection of inference rules to a dismantl...
Marcio Buss, Stephen A. Edwards, Bin Yao, Dan G. W...
CSUR
1999
114views more  CSUR 1999»
13 years 9 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
EUC
2005
Springer
14 years 2 months ago
Program Obfuscation Scheme Using Random Numbers to Complicate Control Flow
Abstract. For the security technology that has been achieved with software in the computer system and the protection of the intellectual property right of software, software protec...
Tatsuya Toyofuku, Toshihiro Tabata, Kouichi Sakura...
ESOP
2006
Springer
14 years 27 days ago
Type-Based Amortised Heap-Space Analysis
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
Martin Hofmann, Steffen Jost