Topic
Program transformation
About: Program transformation is a research topic. Over the lifetime, 2468 publications have been published within this topic receiving 73415 citations.
Papers published on a yearly basis
Papers
More filters
07 Nov 2001
TL;DR: The FermaT Workbench is an industrial-strength assembler re- engineering workbench consisting of a number of integrated tools for program comprehension, migration and re-engineering.
Abstract: Research into the working practices of software engineers has shown the need for integrated browsing and searching tools which include graphical visualisations linked back to the source code under investigation. In addition, for assembler maintenance and re-engineering there is an even greater need for sophisticated control flow analysis, data flow analysis, slicing and migration technology. All these technologies are provided by the FermaT Workbench: an industrial-strength assembler re-engineering workbench consisting of a number of integrated tools for program comprehension, migration and re-engineering. The various program analysis and migrations tools are based on research carried out over the last sixteen years at Durham University, De Montfort University and Software Migrations Ltd., and make extensive use of program transformation theory.
22 citations
14 May 2016
TL;DR: This position paper presents the vision that, by 2025, the use of more rigorous analyses to check the reliability of program analysers will be commonplace, building upon techniques such as cross-checking, program transformation and program generation.
Abstract: The reliability of program analysis tools is clearly important if such tools are to play a serious role in improving the quality and integrity of software systems, and the confidence which users place in such systems. Yet our experience is that, currently, little attention is paid to analysing the correctness of program analysers themselves, beyond regression testing. In this position paper we present our vision that, by 2025, the use of more rigorous analyses to check the reliability of program analysers will be commonplace. Inspired by recent advances in compiler testing, we set out initial steps towards this vision, building upon techniques such as cross-checking, program transformation and program generation.
22 citations
22 Apr 2008
TL;DR: This paper takes a program transformation approach to automatically enhance DE models with incremental checkpointing and state recovery functionality and incorporates this mechanism into PTIDES for efficient execution of fault- tolerant real-time distributed DE systems.
Abstract: We build on PTIDES, a programming model for distributed embedded systems that uses discrete-event (DE) models as program specifications. PTIDES improves on distributed DE execution by allowing more concurrent event processing without backtracking. This paper discusses the general execution strategy for PTIDES, and provides two feasible implementations. This execution strategy is then extended with tolerance for hardware errors. We take a program transformation approach to automatically enhance DE models with incremental checkpointing and state recovery functionality. Our fault tolerance mechanism is lightweight and has low overhead. It requires very little human intervention. We incorporate this mechanism into PTIDES for efficient execution of fault- tolerant real-time distributed DE systems.
22 citations
TL;DR: This work describes a more natural style of programming that yields code that is impervious to injections by construction, and can be applied with relative ease to any combination of context-free host and guest languages.
22 citations
01 Jan 2007
TL;DR: In this paper, a programming model for distributed embedded systems that uses discrete-event (DE) models as program specifications is presented, and two feasible implementations of PTIDES are presented.
Abstract: We build on PTIDES, a programming model for distributed embedded systems that uses discrete-event (DE) models as program specifications. PTIDES improves on distributed DE execution by allowing more concurrent event processing without backtracking. This paper discusses the general execution strategy for PTIDES, and provides two feasible implementations. This execution strategy is then extended with tolerance for hardware errors. We take a program transformation approach to automatically enhance DE models with incremental checkpointing and state recovery functionality. Our fault tolerance mechanism is lightweight and has low overhead. It requires very little human intervention. We incorporate this mechanism into PTIDES for efficient execution of faulttolerant real-time distributed DE systems.
22 citations