Sciweavers

957 search results - page 125 / 192
» Modular Static Program Analysis
Sort
View
WCET
2007
14 years 11 months ago
Data-Flow Based Detection of Loop Bounds
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...
Christoph Cullmann, Florian Martin
PADL
2007
Springer
15 years 3 months ago
Partial Evaluation of Pointcuts
Abstract. In aspect-oriented programming, pointcuts are usually compiled by identifying a set of shadows — that is, places in the code whose execution is potentially relevant for...
Karl Klose, Klaus Ostermann, Michael Leuschel
SIGADA
2004
Springer
15 years 3 months ago
A refactoring tool for Ada 95
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
Paul Anderson
TOOLS
1999
IEEE
15 years 2 months ago
Towards Integration of State Machines and Object-Oriented Languages
The goal of this paper is to obtain a one-to-one correspondence between state machines as e.g. used in UML and object-oriented programming languages. A proposal is made for a lang...
Ole Lehrmann Madsen
LCPC
2005
Springer
15 years 3 months ago
Scalable Array SSA and Array Data Flow Analysis
Static Single Assignment (SSA) has been widely accepted as the intermediate program representation of choice in most modern compilers. It allows for a much more efficient data flo...
Silvius Rus, Guobin He, Lawrence Rauchwerger