The promotion and accumulation strategies in transformational programming
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Applications of a strategy for designing divide-and-conquer algorithms
Science of Computer Programming
Specification and transformation of programs: a formal approach to software development
Specification and transformation of programs: a formal approach to software development
Algorithm theories and design tactics
Science of Computer Programming
KIDS: A Semiautomatic Program Development System
IEEE Transactions on Software Engineering
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Steps towards mechanizing program transformations using PVS
Science of Computer Programming - Special issue on mathematics of program construction
Continuation-Based Program Transformation Strategies
Journal of the ACM (JACM)
Program Development by Specification and Transformation, The PROSPECTRA Methodology, Language Family, and System
Representing, Verifying and Applying Software Development Steps using the PVS System
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Correct and User-Friendly Implementations of Transformation Systems
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
On trojan horses of thompson-goerigk-type, their generation, intrusion, detection and prevention
Concurrency, Compositionality, and Correctness
| Hi-index | 0.00 |
This paper is concernedwith a mechanizedformal treatment of the transformational software development process in a unified framework. We utilize the PVS system to formally represent, verify and correctly apply generic software development steps and development methods from different existing transformational approaches. We illustrate our approach by representing the well-known divide-and-conquer paradigm, two optimization steps, and by formally deriving a mergesort program.