Sciweavers

2947 search results - page 143 / 590
» Analyzing Program Analyses
Sort
View
PEPM
1993
ACM
15 years 9 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
129
Voted
ICLP
1997
Springer
15 years 8 months ago
A Practical Approach to Structure Reuse of Arrays in Single Assignment Languages
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
Andreas Kågedal, Saumya K. Debray
145
Voted
ECOOP
2008
Springer
15 years 6 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
132
Voted
ENTCS
2007
100views more  ENTCS 2007»
15 years 5 months ago
Using Template Haskell for Abstract Interpretation
mplate Haskell for Abstract Interpretation Clara Segura1 ,2 Departamento de Sistemas Inform´aticos y Programaci´on Universidad Complutense de Madrid Madrid, Spain Carmen Torrano3...
Clara Segura, Carmen Torrano
RV
2010
Springer
122views Hardware» more  RV 2010»
15 years 3 months ago
Clara: A Framework for Partially Evaluating Finite-State Runtime Monitors Ahead of Time
Researchers have developed a number of runtime verification tools that generate runtime monitors in the form of AspectJ aspects. In this work, we present Clara, a novel framework ...
Eric Bodden, Patrick Lam, Laurie J. Hendren