A short survey of automated reasoning

Authors:
John Harrison
Affiliations:
Intel Corporation, Hillsboro, OR
Venue:
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Year:
2007

Citing 42
Cited 1

An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras

Proc. of the first international conference on Rewriting techniques and applications
Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
An introduction to Wu's method for mechanical theorem proving in geometry

Journal of Automated Reasoning
A methodology for hardware verification based on logic simulation

Journal of the ACM (JACM)
The SECD microprocessor: a verification case study

The SECD microprocessor: a verification case study
Well … it isn't quite that simple

ACM SIGSAM Bulletin
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Formal verification by symbolic evaluation of partially-ordered trajectories

Formal Methods in System Design - Special issue on symbolic model checking
Computers & thought

Computers & thought
Applying formal verification to the AAMP5 microprocessor: a case study in the industrial use of formal methods

Formal Methods in System Design
The unwinding number

ACM SIGSAM Bulletin
Term rewriting and all that

Term rewriting and all that
A Mechanically Checked Proof of the AMD5K86TM Floating-Point Division Program

IEEE Transactions on Computers
A Mechanical Proof Procedure and its Realization in an Electronic Computer

Journal of the ACM (JACM)
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination

Journal of the ACM (JACM)
Semi-Automated Mathematics

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
A fascinating country in the world of computing: your guide to automated reasoning

A fascinating country in the world of computing: your guide to automated reasoning
Model checking

Model checking
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Mechanizing proof: computing, risk, and trust

Mechanizing proof: computing, risk, and trust
Solution of the Robbins Problem

Journal of Automated Reasoning
A Skeptic’s Approach to Combining HOL and Maple

Journal of Automated Reasoning
A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic

FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Proof Style

TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Anatomy of the Pentium Bug

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Specification and verification of concurrent systems in CESAR

Proceedings of the 5th Colloquium on International Symposium on Programming
Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets

Selected Papers from the International Workshop on Automated Deduction in Geometry
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Computer Aider Reasoning

Proceedings of the Conference on Logic of Programs
Presburger''s Article on Integer Arithmetic: Remarks and Translation

Presburger''s Article on Integer Arithmetic: Remarks and Translation
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
The Seventeen Provers of the World: Foreword by Dana S. Scott (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)

The Seventeen Provers of the World: Foreword by Dana S. Scott (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Toward mechanical mathematics

IBM Journal of Research and Development
A proof method for quantification theory: its justification and realization

IBM Journal of Research and Development
Floating-Point verification using theorem proving

SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems

Some considerations on the usability of interactive provers

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper surveys the field of automated reasoning, giving some historical background and outlining a few of the main current research themes. We particularly emphasize the points of contact and the contrasts with computer algebra. We finish with a discussion of the main applications so far.