E. J. Younger & M. Ward, "Inverse Engineering a simple Real Time program," J. Software Maintenance: Research and Practice 6 (1993), . 33 Appendices A Graph Marking Definition A.1 Given any set N and any function D : N ! (N), the transitive closure TC(D) : (N) ! (N) of D is defined as: TC(D) = DF  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Do Program Transformations Help Reverse Engineering? - Bennett (1998) (8 citations) (Correct)
....of the software engineer; and a translator for converting the final WSL program to the desired external representation. Information about the transformations themselves and the theory can be found in [3,4,17,18,19] Practical case studies of both forward and reverse engineering are described in [6,7,20,28]. The aim of this paper is to summarise the results of some twelve years research in designing and applying transformation systems for reverse engineering and for program understanding. The paper concentrates entirely on one off reverse engineering projects, in which major remedial work is ....
....that the overall test suite will need to be overhauled. 4.8. Non functional attributes Our goal has been to ensure that the reverse engineered system conforms to requirements on performance, real time behaviour etc. We have undertaken detailed experiments on real time and concurrent systems [18,28]. Concurrent programs are known to be very hard to understand, and we have found that reverse engineering them is extremely difficult. Potentially, transformations provide a good way forward, but there are many problems to solve. 4.9. Underlying theory Our aim (and indeed philosophy) has been to ....
Younger E.J. & Ward M.P. Inverse engineering a simple real-time program. Software Maintenance - Research and Practice 6 pp. 197-234 July 1994.
Derivation of Data Intensive Algorithms by Formal Transformation - .. - Ward (1996) (1 citation) Self-citation (Ward) (Correct)
No context found.
E. J. Younger & M. Ward, "Inverse Engineering a simple Real Time program," J. Software Maintenance: Research and Practice 6 (1993), . 33 Appendices A Graph Marking Definition A.1 Given any set N and any function D : N ! (N), the transitive closure TC(D) : (N) ! (N) of D is defined as: TC(D) = DF
Specifications from Source Code - Alchemists' Dream or Practical.. - Ward (1994) (1 citation) Self-citation (Ward) (Correct)
....discharge complex proof obligations before they can be applied. In particular, it should be possible to introduce, analyse and reason about imperative and recursive constructs without requiring loop invariants; 4. Techniques to bridge the abstraction gap between speci cations and programs. See [23,30] for examples; 5. Applicable to real programs not just those in a toy programming language with few constructs. This is achieved by the (programming) language independence and extendibility of the notation via de nitional transformations . See [15,17,24] for examples; 6. Scalable to large ....
.... to reengineering, based on inverse engineering followed by formal re nement, has proved very successful with a number of challenging smallscale case study programs [13,20,21,23,24] The theoretical work has been developed further to accommodate real time and parallel programs with some success [29,30]. More recently, the development of industrial strength tool support has allowed us to tackle large JOVIAL restructuring projects, IBM 370 Assembler restructuring projects for modules of up to 20,000 lines, and Assembler to COBOL migration projects [26,27] Durham Software Engineering Ltd and ....
E. J. Younger & M. Ward, \Inverse Engineering a simple Real Time program," J. Software Maintenance:
Derivation of Data Intensive Algorithms by Formal Transformation.. - Ward (1996) (1 citation) Self-citation (Ward) (Correct)
....about imperative and recursive constructs without requiring loop invariants. It should also be possible to derive algorithms from specifications without recourse to complicated induction proofs; 4. Techniques to bridge the abstraction gap between specifications and programs. See Section 4. 3 and [45,49] for examples; 5. Applicable to real programs not just those in a toy programming language with few constructs. This is achieved by the (programming) language independence and extendibility of the notation via definitional transformations . See [40,42] for examples; 6. Scalable to large ....
E. J. Younger & M. Ward, "Inverse Engineering a simple Real Time program," J. Software Maintenance: Research and Practice 6 (1993), . Appendices A Graph Marking Definition A.1 Given any set N and any function D : N !
Formal Methods to Aid the Evolution of Software - Ward, Bennett (1995) (5 citations) Self-citation (Ward) (Correct)
....for loops and for recursive procedures which can be applied without needing loop invariants. Details of the theoretical foundations of our work are given in [38] Examples of the use of the transformation based approach for forward engineering are given in [34,36] and for reverse engineering in [35,40,45]. A survey of work on transformation systems may be found in [42] and also in [27] The approach may be contrasted with the refinement calculus (e.g. see [19,20,21] in which the user selects the next refinement step, and in doing so will generate a set of proof obligations, i.e. theorems which ....
E. J. Younger & M. Ward, "Inverse Engineering a simple Real Time program," J. Software Maintenance: Research and Practice 6 (1993), 197--234.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC