Skip to main content

2018 | OriginalPaper | Buchkapitel

Boosting the Reuse of Formal Specifications

verfasst von : Mariano M. Moscato, Carlos G. Lopez Pombo, César A. Muñoz, Marco A. Feliú

Erschienen in: Interactive Theorem Proving

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Advances in theorem proving have enabled the emergence of a variety of formal developments that, over the years, have resulted in large corpuses of formalizations. For example, the NASA PVS Library is a collection of 55 formal developments written in the Prototype Verification System (PVS) over a period of almost 30 years and containing more than 28000 proofs. Unfortunately, the simple accumulation of formal developments does not guarantee their reusability. In fact, in formal systems with very expressive specification languages, it is often the case that a particular conceptual object is defined in different ways. This paper presents a technique to establish sound connections between formal definitions. Such connections support the possibility of (partial) borrowing of proved results from one formal description into another, improving the reusability of formal developments. The technique is described using concepts from the field of universal algebra and algebraic specification. The technique is illustrated with concrete examples taken from formalizations available in the NASA PVS Library.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
2
Keywords in PVS are not case sensitive. Uppercase is used here to differentiate them from the rest of the tokens.
 
Literatur
2.
Zurück zum Zitat Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Graduate Texts in Mathematics. Springer, Berlin (1981)CrossRef Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Graduate Texts in Mathematics. Springer, Berlin (1981)CrossRef
3.
Zurück zum Zitat Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, New York (1972)MATH Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, New York (1972)MATH
4.
Zurück zum Zitat van Benthem, J., Doets, K.: Higher-order logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 1, pp. 189–243. Kluwer Academic Publishers (2001) van Benthem, J., Doets, K.: Higher-order logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 1, pp. 189–243. Kluwer Academic Publishers (2001)
5.
Zurück zum Zitat Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1996) Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1996)
6.
Zurück zum Zitat Girard, J.Y., Lafont, Y., Taylor, P.: Proofs and Types. Number 7 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1989) Girard, J.Y., Lafont, Y., Taylor, P.: Proofs and Types. Number 7 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1989)
7.
Zurück zum Zitat Barendregt, H.P.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, Volume II. Oxford University Press (1999) Barendregt, H.P.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, Volume II. Oxford University Press (1999)
8.
Zurück zum Zitat Muñoz, C.: Rapid prototyping in PVS. Contractor report NASA/CR-2003-212418, NASA, Langley Research Center, Hampton VA 23681–2199, USA, May 2003 Muñoz, C.: Rapid prototyping in PVS. Contractor report NASA/CR-2003-212418, NASA, Langley Research Center, Hampton VA 23681–2199, USA, May 2003
9.
Zurück zum Zitat Ehrig, H., Mahr, B., Orejas, F.: Introduction to algebraic specification. Part 1: formal methods for software development. Comput. J. 35(5), 468–477 (1992)CrossRef Ehrig, H., Mahr, B., Orejas, F.: Introduction to algebraic specification. Part 1: formal methods for software development. Comput. J. 35(5), 468–477 (1992)CrossRef
10.
Zurück zum Zitat Ehrig, H., Mahr, B., Orejas, F.: Introduction to algebraic specification. Part 2: from classical view to foundations of system specifications. Comput. J. 35(5), 468–477 (1992)CrossRef Ehrig, H., Mahr, B., Orejas, F.: Introduction to algebraic specification. Part 2: from classical view to foundations of system specifications. Comput. J. 35(5), 468–477 (1992)CrossRef
11.
Zurück zum Zitat McLane, S.: Categories for Working Mathematician. Graduate Texts in Mathematics. Springer, Berlin (1971) McLane, S.: Categories for Working Mathematician. Graduate Texts in Mathematics. Springer, Berlin (1971)
12.
Zurück zum Zitat Pierce, B.C.: Basic Category Theory for Computer Scientists. MIT Press, Cambridge (1991)MATH Pierce, B.C.: Basic Category Theory for Computer Scientists. MIT Press, Cambridge (1991)MATH
13.
Zurück zum Zitat Meseguer, J.: General logics. In: Ebbinghaus, H.D., Fernandez-Prida, J., Garrido, M., Lascar, D., Artalejo, M.R. (eds.) Proceedings of the Logic Colloquium 1987, Granada, Spain, North Holland, vol. 129, pp. 275–329 (1989) Meseguer, J.: General logics. In: Ebbinghaus, H.D., Fernandez-Prida, J., Garrido, M., Lascar, D., Artalejo, M.R. (eds.) Proceedings of the Logic Colloquium 1987, Granada, Spain, North Holland, vol. 129, pp. 275–329 (1989)
14.
Zurück zum Zitat Goguen, J.A., Roşu, G.: Institution morphisms. Formal Aspects Comput. 13(3–5), 274–307 (2002)CrossRef Goguen, J.A., Roşu, G.: Institution morphisms. Formal Aspects Comput. 13(3–5), 274–307 (2002)CrossRef
15.
Zurück zum Zitat Turski, W.M., Maibaum, T.S.E.: The Specification of Computer Programs. International Computer Science Series. Addison-Wesley Publishing Co., Inc., Boston (1987) Turski, W.M., Maibaum, T.S.E.: The Specification of Computer Programs. International Computer Science Series. Addison-Wesley Publishing Co., Inc., Boston (1987)
16.
Zurück zum Zitat Bernstein, S.: Démonstration du théorème de weierstrass fondée sur le calcul des probabilités. Commun. Kharkov Math. Soc. 13(1), 1–2 (1912)MATH Bernstein, S.: Démonstration du théorème de weierstrass fondée sur le calcul des probabilités. Commun. Kharkov Math. Soc. 13(1), 1–2 (1912)MATH
17.
Zurück zum Zitat Muñoz, C., Narkawicz, A.: Formalization of a representation of Bernstein polynomials and applications to global optimization. J. Autom. Reasoning 51(2), 151–196 (2013)CrossRef Muñoz, C., Narkawicz, A.: Formalization of a representation of Bernstein polynomials and applications to global optimization. J. Autom. Reasoning 51(2), 151–196 (2013)CrossRef
21.
Zurück zum Zitat Zimmermann, T., Herbelin, H.: Automatic and transparent transfer of theorems along isomorphisms in the Coq proof assistant. arXiv preprint arXiv:1505.05028 (2015) Zimmermann, T., Herbelin, H.: Automatic and transparent transfer of theorems along isomorphisms in the Coq proof assistant. arXiv preprint arXiv:​1505.​05028 (2015)
22.
Zurück zum Zitat Sozeau, M.: A new look at generalized rewriting in type theory. J. Formalized Reasoning 2(1), 41–62 (2010)MathSciNetMATH Sozeau, M.: A new look at generalized rewriting in type theory. J. Formalized Reasoning 2(1), 41–62 (2010)MathSciNetMATH
24.
Zurück zum Zitat Owre, S., Shankar, N.: Theory interpretations in PVS. Technical report SRI-CSL-01-01, Computer Science Laboratory, SRI International, Menlo Park, CA (2001) Owre, S., Shankar, N.: Theory interpretations in PVS. Technical report SRI-CSL-01-01, Computer Science Laboratory, SRI International, Menlo Park, CA (2001)
25.
Zurück zum Zitat Lammich, P.: Refinement based verification of imperative data structures. In: Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2016, pp. 27–36. ACM, New York (2016) Lammich, P.: Refinement based verification of imperative data structures. In: Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2016, pp. 27–36. ACM, New York (2016)
27.
Zurück zum Zitat McBride, C.: Ornamental algebras, algebraic ornaments (2010). Unpublished McBride, C.: Ornamental algebras, algebraic ornaments (2010). Unpublished
28.
Zurück zum Zitat Dagand, P.É., Tabareau, N., Tanter, É.: Foundations of dependent interoperability. J. Funct. Program. 28 (2018) Dagand, P.É., Tabareau, N., Tanter, É.: Foundations of dependent interoperability. J. Funct. Program. 28 (2018)
Metadaten
Titel
Boosting the Reuse of Formal Specifications
verfasst von
Mariano M. Moscato
Carlos G. Lopez Pombo
César A. Muñoz
Marco A. Feliú
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-94821-8_28

Premium Partner