Analyzing Tabular and State-transition Requirements Speciications in Pvs 1

نویسندگان

  • Sam Owre
  • John Rushby
چکیده

We describe PVS's capabilities for representing tabular speci cations of the kind advocated by Parnas and others, and show how PVS's Type Correctness Conditions (TCCs) are used to ensure certain well-formedness properties. We then show how these and other capabilities of PVS can be used to represent the AND/OR tables of Leveson and the Decision Tables of Sherry, and we demonstrate how PVS's TCCs can expose and help isolate errors in the latter. We extend this approach to represent the mode transition tables of the Software Cost Reduction (SCR) method in an attractive manner. We show how PVS can check these tables for well-formedness, and how PVS's model checking capabilities can be used to verify invariants and reachability properties of SCR requirements speci cations, and inclusion relations between the behaviors of di erent speci cations. These examples demonstrate how several capabilities of the PVS language and veri cation system can be used in combination to provide customized support for speci c methodologies for documenting and analyzing requirements. Because they use only the standard capabilities of PVS, users can adapt and extend these customizations to suit their own needs. Those developing dedicated tools for individual methodologies may nd these constructions in PVS helpful for prototyping purposes, or as a useful adjunct to a dedicated tool when the capabilities of a full theorem prover are required. The examples also illustrate the power and utility of an integrated generalpurpose system such as PVS. For example, there was no need to adapt or extend the PVS model checker to make it work with SCR speci cations described using the PVS TABLE construct: the model checker is applicable to any transition relation, independently of the PVS language constructs used in its de nition. PVS speci cation les for several of the examples used here can be downloaded from http://www.csl.sri.com/pvs/examples/tables; PVS itself is available at http://www.csl.sri.com/pvs.html. Note: this revised edition of the report di ers signi cantly from the draft issued in June 1995.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyzing Tabular and State-Transition Requirements Specifications in PVS

\_' (lescribe PVS's capabilities for representing tabular specifications of the kind advocated t)y Parnas and others, and show how PVS's Type Correctness Conditions (TCCs) are used to ensure certain well-formedness properties. We then show how these and other capabilities of PVS can be used to represent the AND/OR tables of Leveson and the Decision Tables of Sherry, and we demonstrate how PVS_s...

متن کامل

Applying the SCR Requirements Method to a Simple Autopilot

Although formal methods for developing computer systems have been available for more than a decade, few have had signi cant impact in practice. A major barrier to their use is that developers nd formal methods di cult to understand and apply. One exception is a formal method called SCR for specifying computer system requirements which, due to its easy-to-use tabular notation and demonstrated sc...

متن کامل

Unifying Verification Paradigms (Extended Abstract)

The eld of formal methods is blessed with an overabun-time, and hybrid systems). No single veriication approach has proven convincingly superior to the others. I argue that it is both necessary and desirable to develop a uniied framework within which diierent approaches can coexist. The paper outlines some preliminary eeorts in this direction in the context of SRI's PVS system. These eeorts inc...

متن کامل

Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools

A formal language ccsl is introduced for describing specii-cations of classes in object-oriented languages. We show how class speci-cations in ccsl can be translated into higher order logic. This allows us to reason about these speciications. In particular, it allows us (1) to describe (various) implementations of a particular class speciication, (2) to develop the logical theory of a speciic c...

متن کامل

Applying infinite state model checking and other analysis techniques to tabular requirements specifications of safety-critical systems

Although it is most often applied to finite state models, in recent years, symbolic model checking has been extended to infinite state models using symbolic representations that encode infinite sets. This paper investigates the application of an infinite state symbolic model checker called Action Language Verifier (ALV) to formal requirements specifications of safety-critical systems represente...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996