Introduction to Milestones in Interactive Theorem Proving

被引:0
作者
Jeremy Avigad
Jasmin Christian Blanchette
Gerwin Klein
Lawrence Paulson
Andrei Popescu
Gregor Snelting
机构
[1] Carnegie Mellon University,Department of Philosophy
[2] Vrije Universiteit Amsterdam,Theoretical Computer Science
[3] Trustworthy Systems Research Group,Computer Laboratory
[4] Data61,School of Science and Technology
[5] CSIRO,Department of Computer Science
[6] University of Cambridge,undefined
[7] Middlesex University London,undefined
[8] Karlsruhe Institute of Technology,undefined
来源
Journal of Automated Reasoning | 2018年 / 61卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:1 / 8
页数:7
相关论文
共 26 条
[1]  
Klein G(2010)seL4: formal verification of an operating-system kernel Commun. ACM 53 107-115
[2]  
Andronick J(2006)A machine-checked model for a Java-like language, virtual machine, and compiler ACM Trans. Program. Lang. Syst. 28 619-695
[3]  
Elphinstone K(1988)Unification in Boolean rings J. Autom. Reason. 4 381-396
[4]  
Heiser G(1989)Boolean unification–the story so far J. Symb. Comput. 7 275-293
[5]  
Cock D(1991)A logic programming language with lambda-abstraction, function variables, and simple unification J. Log. Comput. 1 497-536
[6]  
Derrin P(1989)Equational reasoning in Isabelle Sci. Comput. Program. 12 123-149
[7]  
Elkaduwe D(1989)Term rewriting and beyond–theorem proving in Isabelle Form. Asp. Comput. 1 320-338
[8]  
Engelhardt K(1990)Unification in primal algebras, their powers and their varieties J. ACM 37 742-776
[9]  
Kolanski R(1991)Constructive rewriting Comput. J. 34 34-41
[10]  
Norrish M(1998)Winskel is (almost) right: Towards a mechanized semantics textbook Form. Asp. Comput. 10 171-186