Sciweavers

3091 search results - page 260 / 619
» The Microsoft Relational Engine
Sort
View
ICSE
1997
IEEE-ACM
15 years 10 months ago
Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis
We apply mathematical concept analysis in order to modularize legacy code. By analysing the relation between procedures and global variables, a so-called concept lattice is constr...
Christian Lindig, Gregor Snelting
TAPSOFT
1997
Springer
15 years 10 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
ICSE
1993
IEEE-ACM
15 years 10 months ago
Formal Approaches to Software Architecture
Over the past 15 years there has been increasing recognition that careful attention to the design of a system’s software architecture is critical to satisfying its requirements ...
David Garlan
PEPM
1994
ACM
15 years 10 months ago
PERs from Projections for Binding-Time Analysis
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
Kei Davis
TAPSOFT
1993
Springer
15 years 10 months ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve