Syntactic source to source transforms and program manipulation

Arsac, Jacques

doi:10.1145/359046.359057

Cited by 50 publications

(23 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, the principal problem of these search engines lies in the bad synchronization between the results of the search and the keywords used to configure this search. We can also find today a lot of tools that can help to get information via channels RSS 4 allowing to display a permanent updated Web-page or to use automatic alarms on an electronic mailer. These automatic alarms use a technology based on "numerical agents" [11].…”

Section: "Technological" Relationsmentioning

confidence: 99%

“…Tim Berners [12] stresses that "…the Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation …". As the technological means previously discussed, this concept uses autonomous and adaptive search agents which are the continuity of the relational agents defined by Alan Newell and 4 Really Simple Syndication Herbert Simon [13]. The semantic complement brought to the representation of information is based on a specification and a formalization of the Knowledge Objects (and their relations) characteristic of a given skill (UoD) and defining an Ontology.…”

Section: "Techno-human" Relationsmentioning

confidence: 99%

“…This evolution stresses the fact that information is not knowledge and that knowledge is not information. Information is considered as a support to communicate knowledge, and "to inform" is the activity to transform knowledge into communicable and usable information [4]. It can be noticed that, in spite of advanced ICTs solutions embedding knowledge into communicable information, the relation between a knowledge needed by a user and the knowledge (or "information"?)…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

From Information Technologies to Knowledge Technologies?

Auzelle

Mayer

Lhoste

2006

IFAC Proceedings Volumes

View full text Add to dashboard Cite

Abstract. In spite of the large variety of technological means available today to obtain and share knowledge needed by the progress of our Society, the relation between the knowledge produced and the knowledge required is not sufficiently facilitated. This paper aims to provide a partial answer to this issue. It proposes a NIAM/ORM formalization of exchanges between producers and users of knowledge. The resulting model is used to analyse and to discuss the deficiencies of the current technologies as well as to outline some ways of evolutions for better collaborative knowledge exchanges. Copyright©2006 IFAC

show abstract

Section: "Technological" Relationsmentioning

confidence: 99%

Section: "Techno-human" Relationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

From Information Technologies to Knowledge Technologies?

Auzelle

Mayer

Lhoste

2006

IFAC Proceedings Volumes

View full text Add to dashboard Cite

show abstract

“…An action system is a set of parameterless mutually recursive procedures [37][38][39]. If the end of the body of an action is reached, then control is returned to the calling action, or to the statement following the action system if there was no calling action, rather than "falling through" to the next action.…”

Section: Action Systemsmentioning

confidence: 99%

Recursion Removal/Introduction by Formal Transformation: An Aid to Program Development and Program Comprehension

Ward¹,

Bennett²

1999

The Computer Journal

View full text Add to dashboard Cite

The transformation of a recursive program to an iterative equivalent is a fundamental operation in Computer Science. In the reverse direction, the task of reverse engineering (analysing a given program in order to determine its specification) can be greatly ameliorated if the program can be re-expressed in a suitable recursive form. But the existing recursion removal transformations, such as the techniques discussed by Knuth [1] and Bird [2], can only be applied in the reverse direction if the source program happens to match the structure produced by a particular recursion removal operation. In this paper we describe a much more powerful recursion removal and introduction operation which describes its source and target in the form of an action system (a collection of labels and calls to labels). A simple, mechanical, restructuring operation can be applied to a great many iterative programs which will put them in a suitable form for recursion introduction. Our transformation generates strictly more iterative versions than the standard methods, including those of Knuth and Bird [1,2]. With the aid of this theorem we prove a (somewhat counterintuitive) result for programs that contain sequences of two or more recursive calls: under a reasonable commutativity condition, "depth-first" execution is more general than "breadth-first" execution. In "depth-first" execution, the execution of each recursive call is completed, including all sub-calls, before execution of the next call is started. In "breadth-first" execution, each recursive call in the sequence is partially executed but any sub-calls are temporarily postponed. This result means that any breadth-first program can be reimplemented as a corresponding depth-first program, but the converse does not hold. We also treat the case of "random-first" execution, where the execution order is implementation dependent. For the more restricted domain of tree searching we show that breadth first search is the most general form. We also give two examples of recursion introduction as an aid to formal reverse engineering.

show abstract

“…This is applied, resulting in an intermediate representation S 1 . Subsequent transformations may be applied to transform the software into S 2 , S 3 , .…”

Section: Introductionmentioning

confidence: 99%

Formal Methods to Aid the Evolution of Software

Ward

Bennett

1995

Int. J. Soft. Eng. Knowl. Eng.

View full text Add to dashboard Cite

There is a vast collection of operational software systems which are vitally important to their users, yet are becoming increasingly difficult to maintain, enhance and keep up to date with rapidly changing requirements. For many of these so called legacy systems the option of throwing the system away an re-writing it from scratch is not economically viable. Methods are therefore urgently required which enable these systems to evolve in a controlled manner. The approach described in this paper uses formal proven program transformations, which preserve or refine the semantics of a program while changing its form. These transformations are applied to restructure ans simplify the legacy systems and to extract higher-level representations. By using an appropriate sequence of transformations, the extracted representation is guaranteed to be equivalent to the code. The method is based on a formal wide spectrum language, called WSL, with accompanying formal method. Over the last ten years we have developed a large catalogue of proven transformations, together with mechanically verifiable applicability conditions. These have been applied to many software development, reverse engineering and maintenance problems. In this paper, we focus on the results of using this approach in the reverse engineering of medium scale, industrial software, written mostly in languages such as assembler and JOVIAL. Results from both benchmark algorithms and heavily modified, geriatric software are summarised. We conclude that formal methods have an important practical role in software evolution.

show abstract

Syntactic source to source transforms and program manipulation

Cited by 50 publications

References 22 publications

From Information Technologies to Knowledge Technologies?

From Information Technologies to Knowledge Technologies?

Recursion Removal/Introduction by Formal Transformation: An Aid to Program Development and Program Comprehension

Formal Methods to Aid the Evolution of Software

Contact Info

Product

Resources

About