Specification and Transformation of Programs

Partsch, Helmuth

doi:10.1007/978-3-642-61512-2

Cited by 141 publications

(33 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A good overview about program transformation in general is given in [34] and for transformation of functional and logical programs in [35]. One of the most well-known transformation systems is the computer-aided, intuition-guided programming (CIP) project [36].…”

Section: Related Workmentioning

confidence: 99%

System Modeling and Transformational Design Refinement in ForSyDe

Sander

Jantsch

2004

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

144

100

View full text Add to dashboard Cite

Abstract-The scope of the Formal System Design (ForSyDe) methodology is high-level modeling and refinement of systems-on-a-chip and embedded systems. Starting with a formal specification model, that captures the functionality of the system at a high abstraction level, it provides formal design-transformation methods for a transparent refinement process of the system model into an implementation model that is optimized for synthesis. The main contribution of this paper is the ForSyDe modeling technique and the formal treatment of transformational design refinement. We introduce process constructors, that cleanly separate the computation part of a process from the synchronization and communication part. We develop the characteristic function for each process type and use it to define semantic preserving and design decision transformations. These transformations are characterized by name, the format of the original process network, the transformed process network, and a design implication. The implication expresses the relation between original and transformed process network by means of the characteristic function. The objective of the refinement process is a model that can be implemented cost efficiently. To this end, process constructors and processes have a hardware and software interpretation which shall facilitate accurate performance and cost estimations. In a study of a digital equalizer example, we illustrate the modeling and refinement process and focus in particular on refinement of the clock domain, communication refinement, and resource sharing.Index Terms-Formal methods, hardware/software codesign, modeling, system-on-a-chip (SoC).

show abstract

Section: Related Workmentioning

confidence: 99%

System Modeling and Transformational Design Refinement in ForSyDe

Sander

Jantsch

2004

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

144

100

View full text Add to dashboard Cite

show abstract

“…Examples of the use of the transformation based approach for forward engineering are given in [34,40], and for reverse engineering in [35,39,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.…”

Section: Theoretical Foundationmentioning

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

“…Indeed, the transformation of a given program P into a new program Q can be performed by using various rules, each of which rewrites a fragment of the program P into a new fragment, provided that these two fragments are equivalent with respect to a given semantics (see, for instance, [19]). In this paper we consider definite logic programs and, in order to transform them, we introduce a general transformation rule, called clause replacement, which is a conditional rewriting of the following form: a set Γ 1 of clauses of a program P is rewritten into a new set Γ 2 of clauses, provided that a suitable equivalence between Γ 1 and Γ 2 holds in the least Herbrand model of the program P .…”

Section: Introductionmentioning

confidence: 99%

Totally correct logic program transformations via well-founded annotations

Pettorossi

Proietti

2008

Higher-Order Symb Comput

View full text Add to dashboard Cite

We address the problem of proving the total correctness of transformations of definite logic programs. We consider a general transformation rule, called clause replacement, which consists in transforming a program P into a new program Q by replacing a set Γ 1 of clauses occurring in P by a new set Γ 2 of clauses, provided that Γ 1 and Γ 2 are equivalent in the least Herbrand model M(P ) of the program P .We propose a general method for proving that transformations based on clause replacement are totally correct, that is, M(P ) = M(Q). Our method consists in showing that the transformation of P into Q can be performed by: (i) adding extra arguments to predicates, thereby deriving from the given program P an annotated program P , (ii) applying a variant of the clause replacement rule and transforming the annotated program P into a terminating annotated program Q, and (iii) erasing the annotations from Q, thereby getting Q.Our method does not require that either P or Q are terminating and it is parametric with respect to the annotations. By providing different annotations we can easily prove the total correctness of program transformations based on various versions of the popular unfolding, folding, and goal replacement rules, which can all be viewed as particular cases of our clause replacement rule.

show abstract

Specification and Transformation of Programs

Cited by 141 publications

References 0 publications

System Modeling and Transformational Design Refinement in ForSyDe

System Modeling and Transformational Design Refinement in ForSyDe

Formal Methods to Aid the Evolution of Software

Totally correct logic program transformations via well-founded annotations

Contact Info

Product

Resources

About