523 search results - page 58 / 105 » Decidability of string graphs |
158
click to vote
POPL
1993
ACM
15 years 7 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
124
click to vote
ECEASST
2006
15 years 3 months ago
2006
Abstract. The Eclipse Modeling Framework (EMF) provides a modeling and code generation framework for Eclipse applications based on structured data models. Within model driven softw...
105
click to vote
CONEXT
2009
ACM
15 years 4 months ago
2009
ACM
An accurate Internet topology graph is important in many areas of networking, from deciding ISP business relationships to diagnosing network anomalies. Most Internet mapping effor...
143
click to vote
CPC
2007
15 years 3 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
94
Voted
DAC
2009
ACM
16 years 4 months ago
2009
ACM
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...