Provably correct derivation of algorithms using FermaT

DOI10.1007/S00165-013-0287-2zbMath1342.68213OpenAlexW2016919797MaRDI QIDQ736840

Hussein Zedan, Martin Ward

Publication date: 5 August 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2086/9173

zbMATH Keywords

formal methodstransformational programmingsoftware developmentalgorithm derivationFermaTWSL

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• RAISE
• Rodin
• FermaT
• mural

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariant based programming: Basic approach and teaching experiences
• The Munich project CIP. Volume I: The wide spectrum language CIP-L
• The Munich project CIP. Volume II: The program transformation system CIP- S
• A synthesis of several sorting algorithms
• Pigs from sausages? Reengineering from assembler to C via FermaT transformations
• Laws of programming
• Formal program construction by transformations-computer-aided, intuition-guided programming
• A Transformation System for Developing Recursive Programs
• Recursion Removal/Introduction by Formal Transformation: An Aid to Program Development and Program Comprehension
• A constructive approach to the problem of program correctness
• Program development by stepwise refinement

This page was built for publication: Provably correct derivation of algorithms using FermaT