Heterogeneous Notations for Pure Formal Method Integration

Research output: Contribution to journalArticlepeer-review


We outline an extendible approach for combining formal methods -- such as Z, Morgan's refinement calculus, and predicative programming -- based on composing specifications written in similar formal languages. We discuss how algorithm refinement can be extended to such a setting, and outline some examples of using integrated formal methods. We also provide justifications for why using combinations of similar methods might be helpful.
Original languageUndefined/Unknown
Pages (from-to)233-242
Number of pages10
JournalFormal Aspects of Computing
Issue number3
Publication statusPublished - 1998

Cite this