Abstract Datatypes in PVS
نویسندگان
چکیده
Datatypes in PVS Sam Owre and Natarajan Shankar SRI International, Menlo Park, California National Aeronautics and Space Administration Langley Research Center Hampton, Virginia 23681-2199 November 1997 Prepared for Langley Research Center under contract NAS1-18969 The development of the initial version of PVS was funded by internal research funding from SRI International. More recent versions of PVS have been developed with funding from ARPA, AFOSR, NASA, NSF, and NRL. Support for the preparation of this document came from the National Aeronautics and Space Administration, Langley Research Center, under contract NAS1-18969. This report is a revised and updated version of Technical Report SRI-CSL-93-09. _______________________________________________________________________________________________ Available from the following: NASA Center for AeroSpace Information (CASI) National Technical Information Service (NTIS) 800 Elkridge Landing Road 5285 Port Royal Road Linthicum Heights, MD 21090-2934 Springfield, VA 22161-2171 (301) 621-0390 (703) 487-4650
منابع مشابه
NASA / CR-97-206264 Abstract Datatypes in PVS
Datatypes in PVS Sam Owre and Natarajan Shankar SRI International, Menlo Park, California National Aeronautics and Space Administration Langley Research Center Hampton, Virginia 23681-2199 Prepared for Langley Research Center under contract NAS 1-18969
متن کاملCSL - 93 - 9 R • December 1993 , Substantially Revised June 1997
Datatypes in PVS Technical Report CSL-93-9R • December 1993, Substantially Revised June 1997
متن کاملA Brief Overview of PVS
PVS is now 15 years old, and has been extensively used in research, industry, and teaching. The system is very expressive, with unique features such as predicate subtypes, recursive and corecursive datatypes, inductive and coinductive definitions, judgements, conversions, tables, and theory interpretations. The prover supports a combination of decision procedures, automatic simplification, rewr...
متن کاملRelating Abstract Datatypes and Z-Schemata
In this paper we investigate formally the relationship between the notion of abstract datatypes in an arbitrary institution, found in algebraic specification languages like Clear, ASL, and CASL; and the notion of schemata from the model-oriented specification language Z. To this end the institution S of the logic underlying Z is defined, and a translation of Z-schemata to abstract datatypes ove...
متن کاملUnfolding Abstract Datatypes
One of the most fundamental tools in the programmer’s toolbox is the abstract datatype. However, abstract datatypes are not as widely used in functional programming as they might be, perhaps because they are not subject to familiar proof methods such as equational reasoning and induction — in essence, because they are a form of codata rather than a form of data. We show that proof methods for c...
متن کامل