Sciweavers

96 search results - page 11 / 20
» Reverse Queries in DATR
Sort
View
ICSM
1999
IEEE
13 years 12 months ago
Recovering High-Level Views of Object-Oriented Applications from Static and Dynamic Information
Recovering architectural documentation from code is crucial to maintaining and reengineering software systems. Reverse engineering and program understanding approaches are often l...
Tamar Richner, Stéphane Ducasse
SIGMOD
2012
ACM
224views Database» more  SIGMOD 2012»
11 years 10 months ago
Tiresias: the database oracle for how-to queries
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
Alexandra Meliou, Dan Suciu
WSR
2008
13 years 9 months ago
Graph Technology in Reverse Engineering: The TGraph Approach
: TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context o...
Jürgen Ebert, Volker Riediger, Andreas Winter
KBSE
1998
IEEE
13 years 11 months ago
An Automated Approach for Supporting Software Reuse via Reverse Engineering
Formal approaches to software reuse rely heavily upon specificationmatchingcriterion, where asearch query using formal specifications is used to search a library of components ind...
Gerald C. Gannod, Yonghao Chen, Betty H. C. Cheng
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 11 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams