Declarative languages and program transformation for programming parallel systems: A case study

1990 ◽  
Vol 2 (3) ◽  
pp. 149-169 ◽  
Author(s):  
John Darlington ◽  
Mike Reeve ◽  
Sue Wright
Keyword(s):  
Program Transformation ◽  
Parallel Systems ◽  
Declarative Languages

scholarly journals Cryptographic Protocol Verification via Supercompilation (A Case Study)

10.29007/gpsh ◽  
2018 ◽  
Author(s):  
Abdulbasit Ahmed ◽  
Alexei Lisitsa ◽  
Andrei Nemytykh
Keyword(s):  
Program Transformation ◽  
Cache Coherence ◽  
Protocol Verification ◽  
Cryptographic Protocol ◽  
Levels Of Abstraction ◽  
Transformation Techniques ◽  
Program Specialization ◽  
Coherence Protocols ◽  
Different Levels

It has been known for a while that program transformation techniques, in particular, program specialization, can be used to prove the properties of programs automatically. For example, if a program actually implements (in a given context of use) a constant function, sufficiently powerful and semantics preserving program transformation may reduce the program to a syntactically trivial ``constant'' program, pruning unreachable branches and proving thereby the property. Viability of such an approach to verification has been demonstrated in previous works where it was applied to the verification of parameterized cache coherence protocols and Petri Nets models.In this paper we further extend the method and present a case study on its appication to the verification of a cryptographic protocol. The protocol is modeled by functional programs at different levels of abstraction and verification via program specialization is done by using Turchin's supercompilation method.

Declarative Program Transformation: A Deforestation Case-Study

1999 ◽  
pp. 360-377 ◽  
Author(s):  
Loïc Correnson ◽  
Etienne Duris ◽  
Didier Parigot ◽  
Gilles Roussel
Keyword(s):  
Program Transformation

Case study: Re-engineering C++ component models via automatic program transformation

2007 ◽  
Vol 49 (3) ◽  
pp. 275-291 ◽  
Author(s):  
Robert L. Akers ◽  
Ira D. Baxter ◽  
Michael Mehlich ◽  
Brian J. Ellis ◽  
Kenn R. Luecke
Keyword(s):  
Program Transformation ◽  
Automatic Program ◽  
Component Models

Exploring the effectiveness of parallel systems in distributed design processes subjected to stochastic disruptions

2014 ◽  
Vol 28 (4) ◽  
pp. 399-412 ◽  
Author(s):  
Sourobh Ghosh ◽  
Erich Devendorf ◽  
Kemper Lewis
Keyword(s):  
Design Process ◽  
Transient Response ◽  
Parallel Systems ◽  
Design System ◽  
Distributed Design ◽  
Slow Convergence ◽  
Statistical Support ◽  
Design Case ◽  
Design Case Study

AbstractDuring the design of complex systems, a design process may be subjected to stochastic disruptions, interruptions, and changes, which can be described broadly as “design impulses.” These impulses can have a significant impact on the transient response and converged equilibrium for the design system. We distinguish this research by focusing on the interactions between local and architectural impulses in the form of designer mistakes and dissolution, division, and combination impulses, respectively, for a distributed design case study. We provide statistical support for the “parallel character hypothesis,” which asserts that parallel arrangements generally best mitigate dissolution and division impulses. We find that local impulses tend to slow convergence, but systems also subjected to dissolution or division impulses still favor parallel arrangements. We statistically uphold the conclusion that the strategy to mitigate combination impulses is unaffected by the presence of local impulses.

Declarative Languages for Advanced Information Technologies

1988 ◽  
Vol 3 (2) ◽  
pp. 110-118
Author(s):  
Anthony Kosky
Keyword(s):  
Programming Languages ◽  
Program Transformation ◽  
Information Technologies ◽  
Great Increase ◽  
Parallel Implementation ◽  
Declarative Programming ◽  
Declarative Languages ◽  
Programming Paradigm

In recent times there has been a great increase in interest in declarative programming languages, which are based on sound mathematical formalisms, independent of the machinery on which they are implemented. Such languages are easier to understand and debug, and have advantages with regard to program transformation and verification, and parallel implementation over conventional, imperative languages. In this essay I will discuss the various paradigms available for declarative programming, and also the object orientated programming paradigm, and put forward various ideas that I feel are of particular interest.

A case study in program transformation

1976 ◽  
Vol 16 (3) ◽  
pp. 322-331
Author(s):  
Arne Wang
Keyword(s):  
Program Transformation
Sign in / Sign up

Export Citation Format

Share Document