Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
PVS: A Prototype Verification System
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
The verifications performed, the lessons learned, and some of the design decisions taken in PVS are described to better support these large, difficult, iterative, and collaborative verifications.
PVS: Combining Specification, Proof Checking, and Model Checking
- N. Shankar
- Computer ScienceFMCAD
- 3 August 1996
We claim that no single technique such as rewriting, BDDs, or model checking is effective for all aspects of hardware verification. Many examples need the careful integration of these techniques. We…
Decision problems for propositional linear logic
- P. Lincoln, John C. Mitchell, A. Scedrov, N. Shankar
- MathematicsProceedings  31st Annual Symposium on…
- 29 April 1992
It is shown that, unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable and, provided that without the model storage operator, the decision problem becomes PSPACE-complete.
A Tutorial Introduction to PVS
This document provides an introductory example, a tutorial, and a compact reference to the PVS veri cation system to get you started using PVS and to help appreciate the capabilities of the system and the purposes for which it is suitable.
The SAL Language Manual
The SAL language was originally designed in collaboration with David Dill of Stanford University and Thomas Henzinger of the University of California at Berkeley and the version presented here is the one currently accepted by the tools developed at SRI.
ICS: Integrated Canonizer and Solver
Decision procedures are at the core of many industrial-strength verification systems such as ACL2, PVS, or STeP but many existing decision procedures lack an appropriate API for managing contexts and efficiently switching between contexts.
Its high-level specification language and wide range of model checkers make SAL convenient for those seeking a ready-to-use solution, while its scriptability and flexible choice of backend analyzers should make it attractive to those seeking an experimental platform.
Abstract and Model Check While You Prove
This work shows how boolean abstractions can be constructed simply, efficiently, and precisely for infinite state systems while preserving properties in the full µ-calculus, and proposes an automatic refinement algorithm which refines the abstraction until the property is verified or a counterexample is found.
An Overview of SAL
This work instantiation of the SAL framework augments PVS with tools for abstraction, invariant generation, program analysis, theorem proving, and model checking to separate concerns as well as calculate properties of concurrent systems.