Winskel is (almost) Right: Towards a Mechanized Semantics Textbook-Reference-Cited by-同舟云学术

Winskel is (almost) Right: Towards a Mechanized Semantics Textbook

Published:1998-11 Issue:2 Volume:10 Page:171-186
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Nipkow Tobias¹

Affiliation:

1. Institut für Informatik, Technische Universität München, München, Germany, , , , , , DE

Abstract

Abstract. We present a formalization of the first 100 pages of Winskel's textbook The Formal Semantics of Programming Languages in the theorem prover Isabelle/HOL: 2 operational, 2 denotational, 2 axiomatic semantics, a verification condition generator, and the necessary soundness, completeness and equivalence proofs, all for a simple imperative programming language.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s001650050009.pdf

Reference24 articles.

1. Verification of Sequential and Concurrent Programs

2. Lect;Bertot Y.,1995

3. Lect;Devillers M.,1997

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formally Verified Interval Arithmetic and Its Application to Program Verification;Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE);2024-04-14

2. ‘do’ unchained: embracing local imperativity in a purely functional language (functional pearl);Proceedings of the ACM on Programming Languages;2022-08-29

3. Teaching algorithms and data structures with a proof assistant (invited talk);Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs;2021-01-17

4. Relation-Algebraic Verification of Borůvka’s Minimum Spanning Tree Algorithm;Relational and Algebraic Methods in Computer Science;2021

5. Second-Order Properties of Undirected Graphs;Relational and Algebraic Methods in Computer Science;2021