959 search results - page 103 / 192 » Fundamental Concepts in Programming Languages |
129
click to vote
TAPSOFT
1997
Springer
15 years 8 months ago
1997
Springer
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...
125
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
144
click to vote
ENTCS
2007
15 years 3 months ago
2007
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper,Multiple Labelled Transit...
156
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
281
click to vote
CCGRID
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a Core Grid Ontology (CGO) that defines fundamental Grid-specific concepts, and the relationships between them. One of the key goals is to make this Co...