From LCF to Isabelle/HOL-Reference-Cited by-同舟云学术

From LCF to Isabelle/HOL

Published:2019-12 Issue:6 Volume:31 Page:675-698
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Paulson Lawrence C.¹^ORCID,Nipkow Tobias²,Wenzel Makarius³

Affiliation:

1. Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, CB3 0FD, Cambridge, England, UK

2. Fakultät für Informatik, Technische Universität München, Munich, Germany

3. Augsburg, Germany

Abstract

Abstract Interactive theorem provers have developed dramatically over the past four decades, from primitive beginnings to today’s powerful systems. Here, we focus on Isabelle/HOL and its distinctive strengths. They include automatic proof search, borrowing techniques from the world of first order theorem proving, but also the automatic search for counterexamples. They include a highly readable structured language of proofs and a unique interactive development environment for editing live proof documents. Everything rests on the foundation conceived by Robin Milner for Edinburgh LCF: a proof kernel, using abstract types to ensure soundness and eliminate the need to store proofs. Compared with the research prototypes of the 1970s, Isabelle is a practical and versatile tool. It is used by system designers, mathematicians and many others.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-019-00492-1.pdf

Reference140 articles.

1. Functional logic programming

2. On Definitions of Constants and Types in HOL

3. Aspinall D (2000) Proof general: a generic tool for proof development. In: Graf S Schwartzbach M (eds) European joint conferences on theory and practice of software (ETAPS) vol 1785 of LNCS. Springer

4. Ballarin C (2006) Interpretation of locales in Isabelle: theories and proof contexts. In: Borwein JM Farmer WM (eds) 5th international conference mathematical knowledge management MKM 2006 vol 4108 of Lecture notes in computer science. Springer pp 31–43

5. Locales: A Module System for Mathematical Theories

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

1. Verification Condition Generator for Process-Oriented Programs in Reflex Language Using Isabelle/HOL;2024 IEEE 25th International Conference of Young Professionals in Electron Devices and Materials (EDM);2024-06-28

2. Population-induced phase transitions and the verification of chemical reaction networks;NAT COMPUT;2024

3. On Verified Automated Reasoning in Propositional Logic: Teaching Sequent Calculus to Computer Science Students;Vietnam Journal of Computer Science;2024-05-02

4. Interactive Formal Specification for Mathematical Problems of Engineers;Electronic Proceedings in Theoretical Computer Science;2024-04-06

5. Requirement patterns in deductive verification of poST Programs;Modeling and Analysis of Information Systems;2024-03-28