Theorem proving for verification

Authors:
John Rushby
Affiliations:
Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA
Venue:
Modeling and verification of parallel processes
Year:
2001

Citing 22
Cited 3

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

Introduction to HOL: a theorem proving environment for higher order logic
Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS

IEEE Transactions on Software Engineering
Automatic generation of invariants and intermediate assertions

Theoretical Computer Science - Special issue: principles and practice of constraint programming
Subtypes for Specifications: Predicate Subtyping in PVS

IEEE Transactions on Software Engineering
On the SUP-INF Method for Proving Presburger Formulas

Journal of the ACM (JACM)
Deciding Linear Inequalities by Computing Loop Residues

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Automatic Generation of Invariants

Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
An algorithm for reasoning about equality

Communications of the ACM
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
The Propositional Formula Checker HeerHugo

Journal of Automated Reasoning
Proceedings of the 10th International Conference on Computer Aided Verification

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Proceedings of the 11th International Conference on Computer Aided Verification

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Experiments in Theorem Proving and Model Checking for Protocol Verification

FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
InVeST: A Tool for the Verification of Invariants

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
An Integration of Model Checking with Automated Proof Checking

Proceedings of the 7th International Conference on Computer Aided Verification
On Shostak's Decision Procedure for Combinations of Theories

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction

Composite Propositions: Toward Support for Formal Specification of System Properties

SEW '02 Proceedings of the 27th Annual NASA Goddard Software Engineering Workshop (SEW-27'02)
Theorem prover approach to semistructured data design

Formal Methods in System Design
Proof process evaluation with mutation analysis

TAP'10 Proceedings of the 4th international conference on Tests and proofs

Quantified Score

Hi-index	0.00

Visualization

Abstract

The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges.