Sciweavers

192 search results - page 2 / 39
» Ordered groups: a case study in reverse mathematics
Sort
View
WCRE
1999
IEEE
13 years 11 months ago
A Formal Approach for Reverse Engineering: A Case Study
As a program evolves, it becomes increasingly difficult to understand and reason about changes in the source code. Eventually, if enough changes are made, reverse engineering and ...
Gerald C. Gannod, Betty H. C. Cheng
PPAM
2007
Springer
14 years 1 months ago
On Parallel Generation of Partial Derangements, Derangements and Permutations
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
Zbigniew Kokosinski
ICFCA
2005
Springer
14 years 11 days ago
Lessons Learned in Applying Formal Concept Analysis to Reverse Engineering
A key difficulty in the maintenance and evolution of complex software systems is to recognize and understand the implicit dependencies that define contracts that must be respecte...
Gabriela Arévalo, Stéphane Ducasse, ...
IJAC
2006
93views more  IJAC 2006»
13 years 6 months ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest
MFCS
2005
Springer
14 years 11 days ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman