7 citations found. Retrieving documents...
Owre, S., J. Rushby, and N. Shankar, "Analyzing Tabular and State-Transition Specifications in PVS," SRI CSL Tech Report, June, 1995.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Formalizing Space Shuttle Software Requirements - Crow, Di Vito (1996)   (29 citations)  (Correct)

....All patiently answered questions and served up voluminous amounts of documentation. We would 6 Several formal methods systems integrate model checking and proof checking, some more intimately than others. See [15] for a general discussion of the PVS approach and a summary of related efforts, and [13] for a detailed discussion of tabular and statetransition specifications and their verification using the integrated facilities of PVS. also like to thank John Kelly (JPL) John Rushby (SRI) Natarajan Shankar (SRI) Rick Butler (LaRC) and three anonymous reviewers. This work was supported in ....

Sam Owre, John Rushby, and Natarajan Shankar. Analyzing Tabular and State-Transition Specifications in PVS. Technical Report SRI-CSL-95-12, Computer Science Laboratory, SRI International, Menlo Park, CA, December 1995.


Integration in PVS: Tables, Types, and Model Checking - Owre, al. (1997)   (1 citation)  Self-citation (Owre Rushby Shankar)   (Correct)

....can be used for a surprising variety of purposes. We demonstrate this with examples drawn from hardware division algorithms and requirements specifications. 1 Introduction Persuaded by the advocacy of David Parnas and others [15] we recently added a construct for tabular specification to PVS [12]. The construct generates proof obligations to ensure that the conditions labeling the rows and columns are disjoint and exclusive. This simple capability has been found useful by colleagues at NASA and Lockheed Martin, who applied it in requirements analysis for Space Shuttle flight software [2, ....

.... b(ACAlt 400) c(ACAlt,AccAlt) d(AltCaptHold) e(AltTarget,prevAltTarget) We can then use this construction to specify the third column of the decision table as the following row from a vertical one dimensional PVS table; the complete table is shown in Appendix C (taken from [12], where full details may be found) X(climb , GE , false , Climb The functions appearing in the argument list to X are ....

[Article contains additional citation context not shown here]

Sam Owre, John Rushby, and Natarajan Shankar. Analyzing tabular and statetransition specifications in PVS. Technical Report SRI-CSL-95-12, Computer Science Laboratory, SRI International, Menlo Park, CA, July 1995. Available, with specification files, at http://www.csl.sri.com/csl-95-12.html.


Automated Deduction and Formal Methods - Rushby (1996)   (8 citations)  Self-citation (Rushby)   (Correct)

....semantic attributes, independently of its linguistic representation. For example, a tabular specification construct was recently added to PVS; this was then used to formalize a requirements methodology known as SCR, and model checking was then immediately available for SCR specifications [11]. Interesting challenges for the future are to integrate other highly efficient but narrow procedures into a general purpose framework. Examples include model checking methods for hybrid systems and binary moment diagrams. 4 Interaction with the User I believe that formal methods can deliver ....

Sam Owre, John Rushby, and Natarajan Shankar. Analyzing tabular and statetransition specifications in PVS. Technical Report SRI-CSL-95-12, Computer Science Laboratory, SRI International, Menlo Park, CA, July 1995. Available, with specification files, from http://www.csl.sri.com/csl-95-12.html. 14


Modular Verification of SRT Division - Rueß, Shankar, Srivas (1996)   (6 citations)  Self-citation (Shankar)   (Correct)

....P:bvec[7] of the next partial remainder. Bits 6 down to 2 of P are used as a table index and the remaining bits are used in some cases to compute the resulting value. The formalization of the resulting table q(D, P) shown in Appendix A) uses the TABLE construct of the PVS specification language [ORS95]. This construct was added to the PVS specification language in order to provide visually appealing two dimensional tabular specifications in the manner advocated by Parnas and others [Par95] It proved adequate to express the look up table of this SRT circuit in a concise and perspicuous way. In ....

S. Owre, J. Rushby, and N. Shankar. Analyzing Tabular and StateTransition Specification in PVS. Technical Report CSL-95-12, Computer Science Laboratory, SRI International, Menlo Park CA 94025 USA, June 1995.


Modular Verification of SRT Division - Rueß, Shankar, Srivas (1996)   (6 citations)  Self-citation (Shankar)   (Correct)

....the estimation P:bvec[7] of the next partial remainder. Bits 6 down to 2 of P are used as a table index and the remaining bits are used in some cases to compute the resulting value. The formalization of the resulting table in Appendix B uses the TABLE construct of the PVS specification language [ORS95]. This construct was added to the PVS specification language in order to provide visually appealing twodimensional tabular specifications in the manner advocated by Parnas and others [Par95] It proved adequate to express the look up table of this SRT circuit in a concise and perspicuous way. In ....

S. Owre, J. Rushby, and N. Shankar. Analyzing Tabular and StateTransition Specification in PVS. Technical Report CSL-95-12, Computer Science Laboratory, SRI International, Menlo Park CA 94025 USA, June 1995.


Unifying Verification Paradigms (Extended Abstract) - Shankar (1996)   Self-citation (Shankar)   (Correct)

....all the language and deduction components from scratch. 5 Tabular Specifications We have already seen how special purpose program logics and their associated deductive procedures can be integrated into PVS. This section presents the enhancement of PVS with support for tabular specification [31]. This enhancement yields a visually attractive specification notation that is supported by the specification and deductive capabilities already in PVS. In particular, PVS typechecking is used to generate well formedness proof obligations. These proof obligations can be verified using the PVS ....

Sam Owre, John Rushby, and Natarajan Shankar. Analyzing tabular and statetransition specifications in PVS. Technical Report SRI-CSL-95-12, Computer Science Laboratory, SRI International, Menlo Park, CA, July 1995. Available, with specification files, from http://www.csl.sri.com/csl-95-12.html .


Applying the SCR* Requirements Toolset to DS-1 Fault Protection - Lutz, al. (1997)   (Correct)

No context found.

Owre, S., J. Rushby, and N. Shankar, "Analyzing Tabular and State-Transition Specifications in PVS," SRI CSL Tech Report, June, 1995.

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