A general framework for sound and complete Floyd-Hoare logics

Authors:
Rob Arthan;Ursula Martin;Erik A. Mathiesen;Paulo Oliva
Affiliations:
Queen Mary University of London, London, UK;Queen Mary University of London, London, UK;Queen Mary University of London, London, UK;Queen Mary University of London, London, UK
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2009

Citing 16
Cited 0

Algebraic approaches to program semantics

Algebraic approaches to program semantics
Floyd-Hoare logic in iteration theories

Journal of the ACM (JACM)
Specification structures and propositions-as-types for concurrency

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
On Hoare logic and Kleene algebra with tests

ACM Transactions on Computational Logic (TOCL)
Ten Years of Hoare's Logic: A Survey—Part I

ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming

Communications of the ACM
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Calculus in Coinductive Form

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Complete Axioms for Categorical Fixed-Point Operators

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A coinductive calculus of streams

Mathematical Structures in Computer Science
Profunctors, open maps and bisimulation

Mathematical Structures in Computer Science
Relations in Concurrency

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A logical analysis of aliasing in imperative higher-order functions

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Semantical consideration on floyo-hoare logic

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
A Hoare logic for single-input single-output continuous-time control systems

HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Towards a typed geometry of interaction

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

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).