Name
Abstract | ||
|---|---|---|
The growing complexity and diversity of models used for engineering dependable systems implies that a variety of formal methods, across differing abstractions, paradigms, and presentations, must be integrated. Such an integration requires unified semantic foundations for the various notations, and co-ordination of a variety of automated verification tools. The contribution of this paper is Isabelle/UTP, an implementation of Hoare and He's Unifying Theories of Programming, a framework for unification of formal semantics. Isabelle/UTP permits the mechanisation of computational theories for diverse paradigms, and their use in constructing formalised semantics. These can be further applied in the development of verification tools, harnessing Isabelle's proof automation facilities. Several layers of mathematical foundations are developed, including lenses to model variables and state spaces as algebraic objects, alphabetised predicates and relations to model programs, algebraic and axiomatic semantics, proof tools for Hoare logic and refinement calculus, and UTP theories to encode computational paradigms. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.scico.2020.102510 | Science of Computer Programming |
Keywords | DocType | Volume |
Theorem proving,Lenses,Unifying theories of programming,Hoare logic,Isabelle/HOL | Journal | 197 |
ISSN | Citations | PageRank |
0167-6423 | 1 | 0.41 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon Foster | 1 | 63 | 13.44 |
| James Baxter | 2 | 3 | 1.79 |
| Ana Cavalcanti | 3 | 668 | 59.95 |
| Jim Woodcock | 4 | 21 | 2.62 |
| Frank Zeyda | 5 | 131 | 13.83 |