(Enter summary)
Abstract: . We present a formalization of the first 100 pages of Winskel's
The Formal Semantics of Programming Languages in the theorem prover
Isabelle/HOL: 2 operational, 2 denotational, 1 axiomatic semantics, a
verification condition generator, and the necessary soundness, completeness
and equivalence proofs, all for a simple imperative language.
Are theorem provers capable of formalizing significant portions of mathematics
or computer science? If we talk about leading edge research, the answer is ... (Update)
Context of citations to this paper: More
...extends the soundness proof to a setting with mutually recursive procedures. His encoding is based exclusively on deep embedding. Nipkow (1998) has been the first to conduct a machine checked completeness proof for Hoare Logic dealing with simple imperative programs in the...
Cited by: More
Metatheory of Verification Calculi in LEGO - To What Extent Does .. - Kleymann (1998)
(Correct)
Similar documents (at the sentence level):
59.4%: Winskel is (almost) Right - Towards a Mechanized Semantics Textbook - Nipkow (1998)
(Correct)
5.1%: More Church-Rosser Proofs (in Isabelle/HOL) - Nipkow (1996)
(Correct)
Active bibliography (related documents): More All
0.5: Generic Automatic Proof Tools - Paulson (1997)
(Correct)
0.1: Trustworthy Tools for Trustworthy Programs: Automatic.. - Homeier, al.
(Correct)
0.1: C formalised in HOL - Norrish (1998)
(Correct)
Similar documents based on text: More All
0.8: Winskel is (almost) Right - Towards Mechanized Semantics (1996)
(Correct)
0.2: A Compositional Proof System for the Modal µ-Calculus - Andersen, Stirling, Winskel (1994)
(Correct)
0.2: On the Semantics of Place/Transition Petri Nets - Meseguer, Montanari, Sassone (1996)
(Correct)
BibTeX entry: (Update)
Nipkow, T. (1998), `Winskel is (almost) right: Towards a mechanized semantics textbook', Formal Aspects of Computing . To appear. http://citeseer.ist.psu.edu/article/nipkow98winskel.html More
@article{ nipkow98winskel,
author = "Tobias Nipkow",
title = "Winskel is (almost) Right: Towards a Mechanized Semantics",
journal = "Formal Aspects of Computing",
volume = "10",
number = "2",
pages = "171-186",
year = "1998",
url = "citeseer.ist.psu.edu/article/nipkow98winskel.html" }
Citations (may not include all citations):
592
Introduction to HOL: a theorem-proving environment for highe.. (context) - Gordon, Melham - 1993
294
Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
194
The Formal Semantics of Programming Languages (context) - Winskel - 1993 ACM
70
Mechanizing programming logics in higher order logic
- Gordon - 1989 ACM
50
Programming Language Theory and its Implementation (context) - Gordon - 1988 ACM
43
Logic and Computation (context) - Paulson - 1987 ACM
26
HOLCF: Higher Order Logic of Computable Functions
- Regensburger DBLP
25
HOLCF: Eine konservative Erweiterung von HOL um LCF (context) - Regensburger - 1994
21
Generic automatic proof tools
- Paulson - 1996 ACM
12
Grundlagen (context) - Jutting, Landau's - 1977
11
Reasoning with executable specifications
- Bertot, Fraer - 1995 ACM DBLP
7
Trustworthy tools for trustworthy programs: A verified verif..
- Homeier, Martin - 1994 DBLP
2
Proof of the equivalence of the operational and denotational.. (context) - Lotzbeyer, Sandner - 1994
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC