Sciweavers

5415 search results - page 270 / 1083
» The Implementation of Functional Programming Languages
Sort
View
ICFP
1999
ACM
15 years 5 months ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary
SIGSOFT
2009
ACM
16 years 2 months ago
Fitting the pieces together: a machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
Benjamin Delaware, William R. Cook, Don S. Batory
CC
2010
Springer
150views System Software» more  CC 2010»
15 years 8 months ago
Practical Extensions to the IFDS Algorithm
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
Nomair A. Naeem, Ondrej Lhoták, Jonathan Ro...
ECOOP
2005
Springer
15 years 7 months ago
Aspect-Oriented Programming Beyond Dependency Injection
Abstract. Dependency injection is a hot topic among industrial developers using component frameworks. This paper first mentions that dependency injection and aspect-oriented progr...
Shigeru Chiba, Rei Ishikawa
TAPSOFT
1997
Springer
15 years 5 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray