Sciweavers

4716 search results - page 116 / 944
» Iterative-free program analysis
Sort
View
PLDI
2009
ACM
15 years 10 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...
ICPP
1998
IEEE
15 years 2 months ago
Concurrent SSA Form in the Presence of Mutual Exclusion
Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper ...
Diego Novillo, Ronald C. Unrau, Jonathan Schaeffer
ICDCIT
2005
Springer
15 years 3 months ago
Analyzing Loop Paths for Execution Time Estimation
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
Abhik Roychoudhury, Tulika Mitra, Hemendra Singh N...
IWPC
2000
IEEE
15 years 2 months ago
Types and Concept Analysis for Legacy Systems
We combine type inference and concept analysis in order to gain insight into legacy software systems. Type inference for COBOL yields the types for variables and program parameter...
Tobias Kuipers, Leon Moonen
CGO
2008
IEEE
15 years 4 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...