Sciweavers

957 search results - page 89 / 192
» Modular Static Program Analysis
Sort
View
ICFP
2001
ACM
16 years 2 months ago
Recursive Structures for Standard ML
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
Claudio V. Russo
103
Voted
ICSE
2010
IEEE-ACM
15 years 7 months ago
Eliminating dead-code from XQuery programs
One of the challenges in web software development is to help achieving a good level of quality in terms of code size and runtime performance, for increasingly popular domain speci...
Pierre Genevès, Nabil Layaïda
ESOP
1990
Springer
15 years 6 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy
115
Voted
PLDI
2010
ACM
15 years 7 months ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn
PLDI
1997
ACM
15 years 6 months ago
Incremental Analysis of real Programming Languages
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
Tim A. Wagner, Susan L. Graham