Sciweavers

651 search results - page 87 / 131
» Precise Analysis of Java Programs Using JOANA
Sort
View
160
Voted
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 6 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
ICSE
1999
IEEE-ACM
15 years 6 months ago
Lightweight Extraction of Object Models from Bytecode
A program’s object model captures the essence of its design. For some programs, no object model was developed during design; for others, an object model exists but may be out-of...
Daniel Jackson, Allison Waingold
LCPC
1999
Springer
15 years 6 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu
OOPSLA
2000
Springer
15 years 5 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
CASES
2003
ACM
15 years 7 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...