Abstract
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. Often, different aspects of a software system have to be specified in different logics, since the construction of a huge logic covering all needed features would be too complex to be feasible. Therefore, we introduce heterogeneous development graphs as a means to cope with heterogeneous specifications.
We cover both the semantics and the proof theory of heterogeneous development graphs. A proof calculus can be obtained either by combining proof calculi for the individual logics, or by representing these in some “universal” logic like higher-order logic in a coherent way and then “borrowing” its calculus for the heterogeneous language.
Chapter PDF
References
D. Ancona, M. Cerioli, and E. Zucca. Extending Casl by late binding. In C. Choppy, D. Bert, and P. Mosses, editors, Recent Trends in Algebraic Development Techniques, 14th International Workshop, WADT’99, Bonas, France, volume 1827 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
E. Astesiano, H.-J. Kreowski, and B. Krieg-Brückner. Algebraic Foundations of Systems Specification. Springer, 1999.
S. Autexier, D. Hutter, H. Mantel, and A. Schairer. Towards an evolutionary formal software-development using Casl. In C. Choppy and D. Bert, editors, Recent Trends in Algebraic Development Techniques, 14th International Workshop, WADT’99, Bonas, France, volume 1827 of Lecture Notes in Computer Science, pages 73–88. Springer-Verlag, 2000.
S. Autexier and T. Mossakowski. Integrating HOL-Casl into the development graph manager Maya. FroCoS 2002, to appear.
H. Baumeister and A. Zamulin. State-based extension of Casl. In Proceedings IFM 2000, volume 1945 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
T. Borzyszkowski. Logical systems for structured specifications. Theoretical Computer Science, to appear.
C. Caleiro, P. Mateus, J. Ramos, and A. Sernadas. Combining logics: Parchments revisited. In M. Cerioli and G. Reggio, editors, Recent Trends in Algebraic Development Techniques, 15th International Workshop, WADT’01, Genova, Italy, Lecture Notes in Computer Science. Springer-Verlag. To appear.
M. Cerioli and J. Meseguer. May I borrow your logic? (transporting logical structures along maps). Theoretical Computer Science, 173:311–347, 1997.
R. Diaconescu. Grothendieck institutions. Applied categorical structures. to appear.
J. A. Goguen and R. M. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39:95–146, 1992. Predecessor in: LNCS 164, 221-256, 1984.
J. Meseguer. General logics. In Logic Colloquium 87, pages 275–329. North Holland, 1989.
T. Mossakowski. Relating Casl with other specification languages: the institution level. Theoretical Computer Science. To appear.
T. Mossakowski, S. Autexier, and D. Hutter. Extending development graphs with hiding. In H. Huβmann, editor, Fundamental Approaches to Software Engineering, volume 2029 of Lecture Notes in Computer Science, pages 269–283. Springer-Verlag, 2001.
T. Mossakowski, A. Haxthausen, and B. Krieg-Brückner. Subsorted partial higherorder logic as an extension of Casl. In C. Choppy, D. Bert, and P. Mosses, editors, Recent Trends in Algebraic Development Techniques, 14th International Workshop, WADT’99, Bonas, France, volume 1827 of Lecture Notes in Computer Science, pages 126–145. Springer-Verlag, 2000.
T. Mossakowski and B. Klin. Institution independent static analysis for Casl. In M. Ceriolo and G. Reggio, editors, Recent Trends in Algebraic Development Techniques, 15th International Workshop, WADT’01, Genova, Italy, Lecture Notes in Computer Science. Springer-Verlag. To appear.
T. Mossakowski, A. Tarlecki, and W. Pawłowski. Combining and representing logical systems using model-theoretic parchments. In F. Parisi Presicce, editor, Recent trends in algebraic development techniques. Proc. 12th International Workshop, volume 1376 of Lecture Notes in Computer Science, pages 349–364. Springer, 1998.
P. D. Mosses. CoFI: The Common Framework Initiative for Algebraic Specification and Development. In TAPSOFT’ 97, Proc. Intl. Symp. on Theory and Practice of Software Development, volume 1214 of LNCS, pages 115–137. Springer-Verlag, 1997.
G. Reggio and L. Repetto. Casl-CHART: a combination of statecharts and of the algebraic specification language Casl. In Proc. AMAST 2000, volume 1816 of Lecture Notes in Computer Science. Springer Verlag, 2000.
L. Schröder and T. Mossakowski. HasCasl: Towards integrated specification and development of Haskell programs. Submitted.
A. Tarlecki. Moving between logical systems. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specifications. 11th Workshop on Specification of Abstract Data Types, volume 1130 of Lecture Notes in Computer Science, pages 478–502. Springer Verlag, 1996.
A. Tarlecki. Towards heterogeneous specifications. In D. Gabbay and M. d. Rijke, editors, Frontiers of Combining Systems 2, 1998, Studies in Logic and Computation, pages 337–360. Research Studies Press, 2000.
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
Mossakowski, T. (2002). Heterogeneous Development Graphs and Heterogeneous Borrowing. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive