A survey of mechanical support for formal reasoning

[1]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[2]  M. Gordon.  HOL : A machine oriented formulation of higher order logic , 1985 .

[3]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.

[4]  Donald I. Good,et al.  Mechanical proofs about computer programs , 1984, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[5]  Brian Quentin Monahan,et al.  Data type proofs using Edinburgh LCF , 1984 .

[6]  Peter Schroeder-Heister,et al.  A natural extension of natural deduction , 1984, Journal of Symbolic Logic.

[7]  Patrick Suppes.  The Next Generation of Interactive Theorem Provers , 1984, CADE.

[8]  Douglas J. Howe.  The Computational Behaviour of Girard's Paradox , 1987, LICS.

[9]  Richard W. Weyhrauch,et al.  Prolegomena to a Theory of Mechanized Formal Reasoning , 1980, Artif. Intell..

[10]  Rod M. Burstall,et al.  Structured Theories in LCF , 1983, CAAP.

[11]  M. Sintzoff,et al.  Expressing program developments in a design calculus , 1987 .

[12]  R. Smullyan.  Theory of formal systems , 1962 .

[13]  Robert S. Boyer,et al.  Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures. , 1979 .

[14]  Peter Dybjer,et al.  Program Verification in a Logical Theory of Constructions , 1985, FPCA.

[15]  Thierry Coquand,et al.  Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.

[16]  Christoph Kreitz.  Constructive Automata Theory Implemented with the Nuprl Proof Development System , 1986 .

[17]  Richard J. Lipton,et al.  Social processes and proofs of theorems and programs , 1977, POPL.

[18]  Charles Gregory Nelson,et al.  Techniques for program verification , 1979 .

[19]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[20]  Zohar Manna,et al.  A Deductive Approach to Program Synthesis , 1979, TOPL.

[21]  Ellis Horowitz,et al.  Abstract data types and software validation , 1978, CACM.

[22]  Raymond M. Smullyan,et al.  Theory of Formal Systems. (AM-47) , 1961 .

[23]  Thomas Reps,et al.  Programming Techniques and Data Structures , 1981 .

[24]  Michael Beeson,et al.  Proving Programs and Programming Proofs , 1986 .

[25]  Jonathan K. Millen,et al.  Verifying Security , 1981, CSUR.

[26]  Thomas W. Reps,et al.  Incremental Context-Dependent Analysis for Language-Based Editors , 1983, TOPL.

[27]  Lawrence C. Paulson,et al.  Natural Deduction as Higher-Order Resolution , 1986, J. Log. Program..

[28]  Lawrence C. Paulson,et al.  A Higher-Order Implementation of Rewriting , 1983, Sci. Comput. Program..

[29]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[30]  Ian J. Hayes,et al.  Specification case studies , 1987 .

[31]  J. Schwartz,et al.  Metamathematical extensibility for theorem verifiers and proof-checkers☆ , 1979 .

[32]  M. Beeson.  Foundations of Constructive Mathematics , 1985 .

[33]  James J. Horning,et al.  Report on the Larch Shared Language , 1986, Sci. Comput. Program..

[34]  Thomas Reps,et al.  A syntax-directed programming environment , 1981 .