User loginNavigation |
Abstract Data Type Usage AnalysisI am interested in implementing a program analysis, where the operations applied to an instance of an abstract data type (e.g. a list) determine the implementation's choice of data structure (e.g. array vs linked list). For example if "insert" or "delete" is used, then a linked list might be chosen, or if "nth" operation (accessing the nth item) is applied then an array might be used. I am unfamiliar with such analyses. Can anyone recommend any papers or related work? By cdiggins at 2007-03-20 16:58 | LtU Forum | previous forum topic | next forum topic | other blogs | 7711 reads
|
Browse archives
Active forum topics |
Recent comments
2 weeks 5 days ago
43 weeks 13 hours ago
43 weeks 17 hours ago
43 weeks 17 hours ago
1 year 13 weeks ago
1 year 17 weeks ago
1 year 19 weeks ago
1 year 19 weeks ago
1 year 21 weeks ago
1 year 26 weeks ago