Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hoare-Like Triples and Kleene Algebras with Top and Tests: Towards a Holistic Perspective on Hoare Logic, Incorrectness Logic, and Beyond

Published 15 Dec 2023 in cs.LO and cs.PL | (2312.09662v1)

Abstract: We aim at a holistic perspective on program logics, including Hoare and incorrectness logics. To this end, we study different classes of properties arising from the generalization of the aforementioned logics. We compare our results with the properties expressible in the language of Kleene algebra with top and tests.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. Edsko De Vries and Vasileios Koutavas. 2011. Reverse hoare logic. In International Conference on Software Engineering and Formal Methods. Springer, 155–171.
  2. A discipline of programming. Vol. 613924118. prentice-hall Englewood Cliffs.
  3. Edsger W. Dijkstra and Carel S. Scholten. 1990. Predicate Calculus and Program Semantics. Springer.
  4. Charles Antony Richard Hoare. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10 (1969), 576–580.
  5. Benjamin Lucien Kaminski. 2019. Advanced weakest precondition calculi for probabilistic programs. Ph. D. Dissertation. RWTH Aachen University.
  6. Weakest precondition reasoning for expected runtimes of randomized algorithms. Journal of the ACM (JACM) 65, 5 (2018), 1–68.
  7. Dexter Kozen. 1997. Kleene algebra with tests. ACM Transactions on Programming Languages and Systems (TOPLAS) 19, 3 (1997), 427–443.
  8. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems (TOPLAS) 18, 3 (1996), 325–353.
  9. Peter W O’Hearn. 2019. Incorrectness logic. Proceedings of the ACM on Programming Languages 4, POPL (2019), 1–32.
  10. Joakim von Wright. 2002. From Kleene algebra to refinement algebra. In International Conference on Mathematics of Program Construction. Springer, 233–262.
  11. On incorrectness logic and Kleene algebra with top and tests. Proceedings of the ACM on Programming Languages 6, POPL (2022), 1–30.
  12. Linpeng Zhang and Benjamin Lucien Kaminski. 2022. Quantitative strongest post: a calculus for reasoning about the flow of quantitative information. Proceedings of the ACM on Programming Languages 6, OOPSLA1 (2022), 1–29.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free