research-article

Subtypes for Specifications: Predicate Subtyping in PVS

Authors:

John Rushby,

Sam Owre,

Natarajan ShankarAuthors Info & Claims

IEEE Transactions on Software Engineering, Volume 24, Issue 9

Pages 709 - 720

https://doi.org/10.1109/32.713327

Published: 01 September 1998 Publication History

Publisher Site

Abstract

A specification language used in the context of an effective theorem prover can provide novel features that enhance precision and expressiveness. In particular, typechecking for the language can exploit the services of the theorem prover. We describe a feature called "predicate subtyping" that uses this capability and illustrate its utility as mechanized in PVS.

References

[1]

L. Cardelli, "Type Systems," Handbook of Computer Science and Eng., ch. 103, pp. 2,208-2,236. CRC Press, 1997. available at url http://www.research.digital.com/SRC

Google Scholar

[2]

B. Russell, "Mathematical Logic as Based on the Theory of Types," From Frege to Gödel, J. van Heijenoort, ed., pp. 150-182. Cambridge, Mass.: Harvard Univ. Press, 1967. first published in 1908

Google Scholar

[3]

F.P. Ramsey, "The Foundations of Mathematics," Philosophical Papers of F.P. Ramsey, D.H. Mellor, ed., ch. 8, pp. 164-224. Cambridge, U.K.: Cambridge Univ. Press, 1990. originally published in Proc. London Math. Soc. vol. 25, pp. 338-384, 1925

Google Scholar

[4]

A. Church, "A Formulation of the Simple Theory of Types," J. Symbolic Logic, vol. 5, pp. 56-68, 1940.

Crossref

Google Scholar

[5]

S. Owre J. Rushby and N. Shankar, "Integration in PVS: Tables, Types, and Model Checking," Tools and Algorithms for the Construction and Analysis of Systems, TACA'97, Ed Brinksma, ed., Enschede, The Netherlands, Lecture Notes in Computer Science 1217, pp. 366-383, Springer-Verlag, Apr. 1997.

Digital Library

Google Scholar

[6]

S. Owre J. Rushby N. Shankar and F. von Henke, "Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS," IEEE Trans. Software Eng., vol. 21, no. 2, pp. 107-125, Feb. 1995.

Digital Library

Google Scholar

[7]

P. Rudnicki, "An Overview of the MIZAR Project," Proc. 1992 Workshop on Types for Proofs and Programs, Båstad, Sweden, pp. 311-330, June 1992. available at url http://web.cs.ualberta.ca/piotr/Mizar/MizarOverview.ps

Google Scholar

[8]

C.B. Jones, "Systematic Software Development Using VDM," Prentice Hall Int'l Series in Computer Science, second edition. Hemel Hempstead, U.K.: Prentice Hall, 1990.

Digital Library

Google Scholar

[9]

R.L. Constable S.F. Allen H.M. Bromley W.R. Cleaveland J.F. Cremer R.W. Harper D.J. Howe T.B. Knoblock N.P. Mendler P. Panangaden J.T. Sasaki and S.F. Smith, Implementing Math. with the Nupr Proof Development System, Englewood Cliffs, N.J., Prentice Hall, 1986.

Digital Library

Google Scholar

[10]

O.-J. Dahl and O. Owe, "On the Use of Subtypes in ABEL (revised version)," Technical Report 206, Dept. of Informatics, Univ. of Oslo, Oct. 1995.

Google Scholar

[11]

The RAISE Language Group, The RAISE Specification Language, BCS Practioner Series. Hemel Hempstead, U.K.: Prentice Hall Int'l, 1992.

Digital Library

Google Scholar

[12]

F.K. Hanna N. Daeche and M. Longley, "Specification and Verification Using Dependent Types," IEEE Trans. Software Eng., vol. 16, no. 9, pp. 949-964, Sept. 1989.

Digital Library

Google Scholar

[13]

D.C. Luckham F.W. von Henke B. Krieg-Brückner and O. Owe, ANNA: A Language for Annotating Ada Programs, Lecture Notes in Computer Science 260. Springer-Verlag, 1987.

Digital Library

Google Scholar

[14]

S. Owre S. Rajan J.M. Rushby N. Shankar and M.K. Srivas, "PVS: Combining Specification, Proof Checking, and Model Checking," Alur and Henzinger {31}, pp. 411-414.

Digital Library

Google Scholar

[15]

J. Rushby, "Automated Deduction and Formal Methods," Alur and Henzinger {31}, pp. 169-183.

Digital Library

Google Scholar

[16]

D. Cyrluk P. Lincoln and N. Shankar, "On Shostak's Decision Procedure for Combinations of Theories," Automated Deduction—CADE-13, M.A. McRobbie and J.K. Slaney, eds., New Brunswick, N.J., Lecture Notes in Artificial Intelligence 1,104, pp. 463-477. Springer-Verlag, July/Aug. 1996.

Digital Library

Google Scholar

[17]

H. Barringer J.H. Cheng and C.B. Jones, "A Logic Covering Undefinedness in Program Proofs," Acta Informatica, vol. 21, pp. 251-269, 1984.

Digital Library

Google Scholar

[18]

M.J. Beeson, Foundations of Constructive Mathematics, Ergebnisse der Mathematik und ihrer Grenzgebiete; 3. Folge Band 6. Springer-Verlag, 1985.

Google Scholar

[19]

D.L. Parnas, "Predicate Logic for Software Engineering," IEEE Trans. Software Eng., vol. 19, no. 9, pp. 856-862, Sept. 1993.

Digital Library

Google Scholar

[20]

W.M. Farmer, "A Partial Functions Version of Church's Simple Theory of Types," J. Symbolic Logic, vol. 55, no. 3, pp. 1,269-1,291, Sept. 1990.

Crossref

Google Scholar

[21]

W.M. Farmer J.D. Guttman and F.J. Thayer, " IMPS: An interactive Mathematical Proof System," J. Automated Reasoning, vol. 11, no. 2, pp. 213-248, Oct. 1993.

Digital Library

Google Scholar

[22]

L. Lamport and L.C. Paulson, "Should Your Specification Language Be Typed?" SRC Research Report 147, Digital Systems Research Center, Palo Alto, Calif., May 1997. available at url http://www.research.digital.com/SRC.

Google Scholar

[23]

J.H. Cheng and C.B. Jones, "On the Usability of Logics which Handle Partial Functions," Proc. Third Refinement Workshop, C. Morgan and J.C.P. Woodcock, eds., pp. 51-69, Springer-Verlag Workshops in Computing, 1990.

Google Scholar

[24]

S. Maharaj and J. Bicarregui, "On the Verification of VDM Specification and Refinement with PVS," Proc. 12th IEEE Int'l Conf. Automated Software Eng.: ASE'97, pp. 280-289, Incline Village, Nev., IEEE Computer Society, Nov. 1997.

Digital Library

Google Scholar

[25]

M. Saaltink, "The Z/EVES system," ZUM'97: The Z Formal Specification Notation; Proc. 10th Int'l Conf. of Z Users, Reading, U.K., Lecture Notes in Computer Science 1212, pp. 72-85. Springer-Verlag, Apr. 1997.

Digital Library

Google Scholar

[26]

M. Saaltink, "Domain Checking Z Specifications," LFM' 97: Fourth NASA Langley Formal Methods Workshop, C.M. Holloway and K.J. Hayhurst, eds., Hampton, Va., Sept. 1997, NASA Langley Research Center, NASA Conference Publication 3356, pp. 185-192. available at url http://atb-www.larc.nasa.gov/Lfm97/proceedings/

Google Scholar

[27]

S.M. German, "Automating Proofs of the Absence of Common Runtime Errors," Proc., Fifth ACM Symp. Principles of Programming Languages, Tucson, Ariz., pp. 105-118, Jan. 1978.

Digital Library

Google Scholar

[28]

D.L. Detlefs, "An Overview of the Extended Static Checking System," Proc. First Workshop Formal Methods in Software Practice, FMSP'96, pp. 1-9, San Diego, Calif., ACM, Jan. 1996.

Google Scholar

[29]

V. Breazu-Tannen T. Coquand C.A. Gunter and A. Scedrov, "Inheritance as Implicit Coercion," Information and Computation, vol. 93, no. 1, pp. 172-221, July 1991.

Digital Library

Google Scholar

[30]

J. Rushby, "PVS Bibliography," Menlo Park, Calif., constantly updated. available at url http://www.csl.sri.com/pvs-bib.html.

Google Scholar

[31]

R. Alur and T.A. Henzinger, eds., Computer-Aided Verification, CAV '96, Lecture Notes in Computer Science 1102, New Brunswick, N.J.: Springer-Verlag, July/Aug. 1996.

Digital Library

Google Scholar

Cited By

View all

Bouhoula AHermann MLarson K(2024)Primal grammars driven automated inductionProceedings of the Thirty-Third International Joint Conference on Artificial Intelligence10.24963/ijcai.2024/361(3259-3269)Online publication date: 3-Aug-2024
https://dl.acm.org/doi/10.24963/ijcai.2024/361
Webbers Rvon Gleissenthall KJhala R(2024)Refinement Type RefutationsProceedings of the ACM on Programming Languages10.1145/36897458:OOPSLA2(962-987)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689745
Zakhour GWeisenburger PSalvaneschi G(2024)Automated Verification of Fundamental Algebraic LawsProceedings of the ACM on Programming Languages10.1145/36564088:PLDI(766-789)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656408
Show More Cited By

Index Terms

Subtypes for Specifications: Predicate Subtyping in PVS
1. Software and its engineering
  1. Software creation and management
    1. Designing software
      1. Requirements analysis
2. Theory of computation
  1. Logic
  2. Semantics and reasoning
    1. Program reasoning

Recommendations

A Formal Framework for ASTRAL Intralevel Proof Obligations

ASTRAL is a formal specification language for real-time systems. It is intended to support formal software development, and therefore has been formally defined. This paper focuses on how to formally prove the mathematical correctness of ASTRAL ...
Logical frameworks as a basis for verification tools: a case study
KBSE '95: Proceedings of The 10th Knowledge-Based Software Engineering Conference

Wide-spread acceptance and use of formal methods in software development hinges on the availability of powerful tools. Tools must be both reliable and offer real assistance to the user. Logical frameworks are a suitable medium to build such tools, since ...
Towards the Composition of Specifications in Event-B

The development of a system can start with the creation of a specification. Following this viewpoint, we claim that often a specification can be constructed from the combination of specifications which can be seen as composition. Event-B is a formal ...

Reviews

Reviewer: Nancy R. Mead

In this technical paper, the authors introduce the notion of subtypes in the PVS specification language. Types in specifications are interpreted as sets of values; subtypes take advantage of the subset concept. According to the authors, one type is a subset of another if the set interpreting the first type is a subset of the set interpreting the second. Predicate subtypes associate a predicate or property with the subtype. For example, the natural numbers are a subtype of the integers, characterized by the predicate “greater than or equal to zero.” Examples of subtypes are given in PVS, which can then be used in the context of theorem proving. In this way, errors can be discovered not only by inspection, but also by automating proofs with predicate subtypes. The authors also address enforcement of invariants, and avoidance of partial functions with predicate subtypes. Comparisons are made with subtypes in programming languages. The paper is well written and has an extensive reference list. It should interest researchers who are working i n theorem proving and formal specification languages.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering

IEEE Transactions on Software Engineering Volume 24, Issue 9

September 1998

95 pages

ISSN:0098-5589

Editor:
Richard A. Kemmerer
Univ. of California, Santa Barbara

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 September 1998

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

62
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bouhoula AHermann MLarson K(2024)Primal grammars driven automated inductionProceedings of the Thirty-Third International Joint Conference on Artificial Intelligence10.24963/ijcai.2024/361(3259-3269)Online publication date: 3-Aug-2024
https://dl.acm.org/doi/10.24963/ijcai.2024/361
Webbers Rvon Gleissenthall KJhala R(2024)Refinement Type RefutationsProceedings of the ACM on Programming Languages10.1145/36897458:OOPSLA2(962-987)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689745
Zakhour GWeisenburger PSalvaneschi G(2024)Automated Verification of Fundamental Algebraic LawsProceedings of the ACM on Programming Languages10.1145/36564088:PLDI(766-789)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656408
Hewer BHutton G(2024)Quotient Haskell: Lightweight Quotient Types for AllProceedings of the ACM on Programming Languages10.1145/36328698:POPL(785-815)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632869
Niederhauser JBrown CKaliszyk C(2024)Tableaux for Automated Reasoning in Dependently-Typed Higher-Order LogicAutomated Reasoning10.1007/978-3-031-63498-7_6(86-104)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-63498-7_6
Lehmann NGeller AVazou NJhala R(2023)Flux: Liquid Types for RustProceedings of the ACM on Programming Languages10.1145/35912837:PLDI(1533-1557)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591283
Zakhour GWeisenburger PSalvaneschi G(2023)Type-Checking CRDT ConvergenceProceedings of the ACM on Programming Languages10.1145/35912767:PLDI(1365-1388)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591276
Affeldt RCohen C(2023)Measure Construction by Extension in Dependent Type Theory with Application to IntegrationJournal of Automated Reasoning10.1007/s10817-023-09671-567:3Online publication date: 18-Aug-2023
https://dl.acm.org/doi/10.1007/s10817-023-09671-5
Redmond PShen GVazou NKuper L(2022)Verified Causal Broadcast with Liquid HaskellProceedings of the 34th Symposium on Implementation and Application of Functional Languages10.1145/3587216.3587222(1-13)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3587216.3587222
Vazou NGreenberg MPolikarpova N(2022)How to safely use extensionality in Liquid HaskellProceedings of the 15th ACM SIGPLAN International Haskell Symposium10.1145/3546189.3549919(13-26)Online publication date: 6-Sep-2022
https://dl.acm.org/doi/10.1145/3546189.3549919
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

A Formal Framework for ASTRAL Intralevel Proof Obligations

Logical frameworks as a basis for verification tools: a case study

Towards the Composition of Specifications in Event-B

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations