computer science

Prototype Verification System

Prototype Verification System is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Prototype Verification System rather than just read about it. In short: The Prototype Verification System (PVS) is a specification language integrated with support tools and an automated theorem prover, developed at the Computer Science Laboratory of SRI International in Menlo Park, California. PVS is based on a kernel consisting of an extension of Church's theory of types with dependent types, and is fundamentally a classical typed higher-order logic.

Key takeaways

Prototype Verification System belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Prototype Verification System to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Prototype Verification System from memory before moving on to harder problems.

Reference excerpt

The Prototype Verification System (PVS) is a specification language integrated with support tools and an automated theorem prover, developed at the Computer Science Laboratory of SRI International in Menlo Park, California. PVS is based on a kernel consisting of an extension of Church's theory of types with dependent types, and is fundamentally a classical typed higher-order logic. The base types include uninterpreted types that may be introduced by the user, and built-in types such as the booleans, integers, reals, and the ordinals. Type-constructors include functions, sets, tuples, records, enumerations, and abstract data types. Predicate subtypes and dependent types can be used to introduce constraints; these constrained types may incur proof obligations (called type-correctness conditions or TCCs) during typechecking. PVS specifications are organized into parameterized theories. The system is implemented in Common Lisp, and is released under the GNU General Public License (GPL).

See also Formal methods List of proof assistants Rosetta-lang

References Owre, Shankar, and Rushby, 1992. PVS: A Prototype Verification System. Published in the CADE 11 conference proceedings.

External links PVS website at SRI International's Computer Science Laboratory Summary of PVS by John Rushby at the Mechanized Reasoning database of Michael Kohlhase and Carolyn Talcott PVSgym is a Reinforcement Learning Environment for PVS

Illustrations

Worked examples

Example 1 — a first encounter with Prototype Verification System

Start with the simplest possible case. Write down what Prototype Verification System claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Prototype Verification System before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Prototype Verification System ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Prototype Verification System

In research: Prototype Verification System appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Prototype Verification System in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Prototype Verification System is common in secondary-school and first-year university syllabi. It links to neighbouring topics Common Lisp (programming language) software, Dependently typed languages, Formal specification languages, so understanding it makes those chapters shorter.
In everyday life: Look for Prototype Verification System outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Prototype Verification System in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Prototype Verification System means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Prototype Verification System out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Prototype Verification System in simple terms?

Why does Prototype Verification System matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Prototype Verification System?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Prototype Verification System.