10 search results - page 1 / 2 » Reusable Ada Libraries Supporting Infinite Data Structures |
SIGADA
1998
Springer
13 years 9 months ago
1998
Springer
ADAEUROPE
2003
Springer
13 years 10 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
ICSE
2008
IEEE-ACM
14 years 4 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...