Abstract
This article presents an abstraction of Hoare logic to traced symmetric monoidal categories, a very general framework for the theory of systems. Our abstraction is based on a traced monoidal functor from an arbitrary traced monoidal category into the category of preorders and monotone relations. We give several examples of how our theory generalizes usual Hoare logics (partial correctness of while programs, partial correctness of pointer programs), and provide some case studies on how it can be used to develop new Hoare logics (runtime analysis of while programs and stream circuits).
Original language | English |
---|---|
Article number | 7 |
Pages (from-to) | 7:1-7:31 |
Number of pages | 31 |
Journal | ACM Transactions on Computational Logic |
Volume | 11 |
Issue number | 1 |
DOIs | |
Publication status | Published - Oct 2009 |
Keywords / Materials (for Non-textual outputs)
- Hoare logic
- stream circuits
- traced monoidal categories