Sciweavers

2947 search results - page 223 / 590
» Analyzing Program Analyses
Sort
View
ESOP
2007
Springer
16 years 20 days ago
Small Witnesses for Abstract Interpretation-Based Proofs
tnesses for Abstract Interpretation-based Proofs Fr´ed´eric Besson, Thomas Jensen, and Tiphaine Turpin IRISA/{Inria, CNRS, Universit´e de Rennes 1} Campus de Beaulieu, F-35042 R...
Frédéric Besson, Thomas P. Jensen, T...
WOMPAT
2004
Springer
15 years 11 months ago
Dragon: A Static and Dynamic Tool for OpenMP
A program analysis tool can play an important role in helping users understand and improve OpenMP codes. Dragon is a robust interactive program analysis tool based on the Open64 co...
Oscar Hernandez, Chunhua Liao, Barbara M. Chapman
CSMR
2003
IEEE
15 years 11 months ago
Towards Automatical Migration of Transformation Rules after Grammar Extension
The paper addresses two problems in software maintenance. Firstly, some maintenance tasks require modifications of the grammar. A change in a grammar can make syntax and transfor...
Wolfgang Lohmann, Günter Riedewald
PLDI
2000
ACM
15 years 11 months ago
Field analysis: getting useful and low-cost interprocedural information
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...
Sanjay Ghemawat, Keith H. Randall, Daniel J. Scale...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 10 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil