Abstract
Partiality is a fact of life, but at present explicitly partial algebraic specifications lack tools and have limited proof methods. We propose a sound and complete way to support execution and formal reasoning of explicitly partial algebraic specifications within the total framework of membership equational logic (MEL) which has a high-performance interpreter (Maude) and proving tools. This is accomplished by a sound and complete mapping PMEL → MEL of partial membership equational (PMEL) theories into total ones. Furthermore, we characterize and give proof methods for a practical class of theories for which this mapping has “almost-zero representational distance,” in that the partial theory and its total translation are identical up to minor syntactic sugar conventions. This then supports very direct execution of, and formal reasoning about, partial theories at the total level. In conjunction with tools like Maude and its proving tools, our methods can be used to execute and reason about partial specifications such as those in CASL.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Bidoit, H.-J. Kreowski, P. Lescanne, F. Orejas, and D. Sannella, editors. Algebraic System Specification and Development. A Survey and Annotated Bibliography, volume 501 of LNCS. Springer, 1991.
A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. Theoretical Computer Science, 236:35–132, 2000.
M. Broy and M. Wirsing. Partial abstract types. Acta Informatica, 18:47–64, 1982.
M. Cerioli and J. Meseguer. May I borrow your logic? (Transporting logical structures along maps). Theoretical Computer Science, 173(2):311–347, 1997.
M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Que-sada. Maude: specification and programming in rewriting logic. SRI International, January 1999, http://maude.csl.sri.com.
M. Clavel, F. Durán, S. Eker, and J. Meseguer. Building equational proving tools by reflection in rewriting logic. In CAFE: An Industrial-Strength Algebraic Formal Method. Elsevier, 2000. http://maude.csl.sri.com.
CoFI task group on semantics, CASL — The common algebraic specification language, Semantics. http://www.brics.dk/Projects/CoFI/Documents/CASL, July 1999.
R. Diaconescu and K. Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. World Scientific, 1998. AMAST Series in Computing, volume 6.
M. Gogolla and M. Cerioli. What is an Abstract Data Type after all? Technical report, DISI-University of Genova, 1994.
J. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105(2):217–273, 1992.
J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ. In Software Engineering with OBJ: algebraic specification in action, pages 3–167. Kluwer, 2000.
C. Hintermeier, C. Kirchner, and H. Kirchner. Dynamically-typed computations for order-sorted equational presentations. Journal of Symbolic Computation, 25(4):455–526, April 1998.
H. Kaphengst and H. Reichel. Initial algebraic semantics for non-context-free languages. In M. Karpinski, editor, Fundamentals of Computation Theory, volume 56 of LNCS, pages 120–126. Springer, 1977.
M. Lowry, T. Pressburger, and G. Roşu. Certifying domain-specific policies. In Proceedings, International Conference on Automated Software Engineering (ASE’01), pages 81–90. IEEE, 2001. San Diego, California.
J. Meseguer. Membership algebra as a logical framework for equational specification. In Proceedings, WADT’97, volume 1376 of LNCS, pages 18–61, 1998.
J. Meseguer and G. Roşu. A total approach to partial algebraic specification. Extended version at http://ase.arc.nasa.gov/grosu/tapase.html, 2002.
T. Mossakowski. Equivalences among various logical frameworks of partial algebras. In Computer Science Logic, volume 1092 of LNCS, pages 403–433, 1996.
T. Mossakowski. Introduction into HOL-CASL. http://www.tzi.de/cofi/, 2001.
T. Mossakowski. Relating CASL with other specification languages: the institution level. Theoretical Computer Science, To appear. http://www.tzi.de/~.
H. Reichel. Initial Computability, Algebraic Specifications, and Partial Algebras. Oxford University Press, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meseguer, J., Roşu, G. (2002). A Total Approach to Partial Algebraic Specification. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_49
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive