N. Shankar

Publications185
h-index43
Citations8,309
Highly Influential Citations591
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • E. Clarke
  • 430 Publications • 55,308 Citations
  • M. Bonacina
  • 113 Publications • 1,369 Citations
  • S. Owre
  • 59 Publications • 5,245 Citations
  • L. D. Moura
  • 79 Publications • 11,977 Citations
  • Publications
  • Influence
PVS: A Prototype Verification System
  • 1,741
  • 158
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
TLDR
PVS is the most recent in a series of verification systems developed at SRI. Expand
  • 669
  • 39
  • PDF
PVS: Combining Specification, Proof Checking, and Model Checking
TLDR
PVS (Prototype Verification System) is an environment for constructing clear and precise specifications and for developing readable proofs that have been mechanically verified. Expand
  • 552
  • 39
Decision Problems for Propositional Linear Logic
TLDR
In this paper we show that unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Expand
  • 291
  • 32
  • PDF
The SAL Language Manual
SAL stands for Symbolic Analysis Laboratory. It is a framework for combining different tools for abstraction, program analysis, theorem proving, and model checking toward the calculation of… Expand
  • 127
  • 26
A Tutorial Introduction to PVS
TLDR
This document provides an introductory example, a tutorial, and a compact reference to the PVS veri cation system. Expand
  • 290
  • 24
  • PDF
ICS: Integrated Canonizer and Solver
TLDR
Decision procedures are at the core of many industrial-strength verification systems such as ACL2 [KM97], PVS [ORS92], or STeP [MtSg96]. Expand
  • 159
  • 19
Sal 2
TLDR
SAL 2 augments the specification language and explicit-state model checker of SAL 1 with high-performance symbolic and bounded model checkers, and with novel infinite bounded and witnessmodel checkers. Expand
  • 90
  • 18
  • PDF
Abstract and Model Check While You Prove
TLDR
We show how boolean abstractions can be constructed simply, efficiently, and precisely for infinite state systems while preserving properties in the full µ-calculus. Expand
  • 219
  • 17
  • PDF
An Overview of SAL
TLDR
We propose an intermediate language, developed in collaboration with Stanford, Berkeley, and Verimag for specifying concurrent systems in a compositional way. Expand
  • 212
  • 12
  • PDF
...
1
2
3
4
5
...