(Enter summary)
Abstract: Formal program design methods are most useful when supported with suitable mechanization. This need for mechanization has long been apparent, but there have been doubts whether verification technology could cope with the problems of scale and complexity. Though there is very little compelling evidence either way at this point, several powerful mechanical verification systems are now available for experimentation. Using SRI's PVS as one representative example, we argue that the technology of... (Update)
Context of citations to this paper: More
.... of induction and model checking, where the latter is used to discharge the inductive and or base cases established by the former [31, 33]. Other recent work investigates a different way of using model checking and theorem proving in combination: using model checking to...
.... of program transformations has typically been carried out This paper is a sequel to a paper entitled Computer Aided Computing [19] that appeared in the proceedings of the 3rd International Conference on the Mathematics of Program Construction held at Kloster Irsee,...
Cited by: More
Mechanized Formal Methods: Progress and Prospects - Rushby (1996)
(Correct)
Automatic Analysis of Consistency between Requirements and.. - Chechik, Gannon (1996)
(Correct)
Theorem Proving: Not an Esoteric Diversion, but the Unifying.. - Cyrluk, Srivas (1995)
(Correct)
Similar documents (at the sentence level):
12.9%: PVS: Combining Specification, Proof Checking, and.. - Owre, Rajan, Rushby, .. (1996)
(Correct)
Active bibliography (related documents): More All
0.5: A Method for the Development of Correct Software - Pepper, Wirsing (1995)
(Correct)
0.2: Unifying Verification Paradigms (Extended Abstract) - Shankar (1996)
(Correct)
0.2: Verifying Invariants Using Theorem Proving - Graf, Saidi (1996)
(Correct)
Similar documents based on text: More All
0.3: Verification by Abstraction - Shankar
(Correct)
0.3: Steps Towards Mechanizing Program Transformations Using PVS - Shankar (1996)
(Correct)
0.2: A Tutorial on Using PVS for Hardware Verification - Owre, Rushby, Shankar, Srivas (1995)
(Correct)
Related documents from co-citation: More All
5: Formal verification for fault-tolerant architectures: Prolegomena to the design ..
- Owre, Rushby et al. - 1995
5: An integration of model checking with automated proof checking
- Rajan, Shankar et al.
4: Effective theorem proving for hardware verification
- Cyrluk, Rajan et al. - 1994
BibTeX entry: (Update)
N. Shankar. Computer-aided computing. In Bernhard Moller, editor, Mathematics of Program Construction '95, volume 947 of Lecture Notes in Computer Science, pages 50--66. Springer-Verlag, 1995. http://citeseer.ist.psu.edu/shankar95computeraided.html More
@inproceedings{ shankar95computeraided,
author = "Natarajan Shankar",
title = "Computer-Aided Computing",
booktitle = "Mathematics of Program Construction",
pages = "50-66",
year = "1995",
url = "citeseer.ist.psu.edu/shankar95computeraided.html" }
Citations (may not include all citations):
779
Symbolic model checking: 10 20 states and beyond
- Burch, Clarke et al. - 1992
779
Symbolic model checking: 10 20 states and beyond
- Burch, Clarke et al. - 1990
592
Introduction to HOL: A Theorem Proving Environment for Highe.. (context) - Gordon, Melham - 1993
505
Implementing Mathematics with the Nuprl Proof Development Sy..
- Constable, Allen et al. - 1986
334
A Computational Logic Handbook (context) - Boyer, Moore - 1988
206
Results on the propositional mu-calculus (context) - Kozen - 1983
155
ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
150
Edinburgh LCF: A Mechanized Logic of Computation (context) - Gordon, Milner et al. - 1979
130
Efficient model checking in fragments of the propositional m.. (context) - Emerson, Lei - 1985
128
Logic and Computation: Interactive Proof with Cambridge LCF (context) - Paulson - 1987
121
Deciding combinations of theories (context) - Shostak - 1984
99
IMPS: An interactive mathematical proof system
- Farmer, Guttman et al. - 1993
96
The generalized railroad crossing: A case study in formal ve..
- Heitmeyer, Lynch - 1994
91
An integration of model-checking with automated proof checki..
- Rajan, Shankar et al. - 1995
79
Myths about the mutual exclusion problem (context) - Peterson - 1981
71
User Guide for the PVS Specification and Verification System
- Owre, Shankar et al. - 1993
60
Constructions: A higher order proof system for mechanizing m.. (context) - Coquand, Huet - 1985
47
volume 828 of Lecture Notes in Computer Science (context) - Paulson, Theorem - 1994
43
Abstract interpretation of reactive systems: Abstractions pr.. (context) - Dams, Grumberg et al. - 1994
42
Formal verification of the AAMP5 microprocessor: A case stud..
- Miller, Srivas - 1995
38
An approach to systems verification
- Bevier, Hunt et al. - 1989
20
Social processes and proofs of theorems and programs (context) - De Millo, Lipton et al. - 1979
20
Defining the IEEE-854 floating-point standard in PVS
- Miner - 1995
18
A lazy approach to compositional verification (context) - Shankar - 1993
10
STP: A mechanized logic for specification and verification (context) - Shostak, Schwartz et al. - 1982
5
Seven papers on mechanized formal verification (context) - Cyrluk, Lincoln et al. - 1995
2
LP: The Larch prover (context) - Garland, Guttag - 1988
1
General Electric Corporate Research and Development (context) - Kapur, Zhang et al. - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csl.sri.com/reports/postscript/): More
Calculating with Requirements (Extended Abstract) - Rushby (1997)
(Correct)
Model Checking and Other Ways of Automating Formal Methods - Rushby (1995)
(Correct)
Integrated Formal Verification: Using Model Checking With.. - Rushby (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC