Abstract
Programming languages should be formally specified in order to reason about programs written in them. We show that, given two formally specified programming languages, it is possible to construct the formal semantics of an aggregated language, in which programs consist of pairs of programs from the initial languages. The construction is based on algebraic techniques and it can be used to reduce relational properties (such as equivalence of programs) to reachability properties (in the aggregated language).
This paper is supported by the Sectorial Operational Programme Human Resource Development (SOP HRD), financed from the European Social Fund and by the Romanian Government under the contract number POSDRU/159/1.5/S/137750.
References
Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: Order-sorted generalization. Electr. Notes Theor. Comput. Sci. 246, 27–38 (2009)
Chiriţă, C.E.: An institutional foundation for the k semantic framework. Master’s thesis, University of Bucharest (2014)
Chiriţă, C.E., Şerbănuţă, T.F.: An institutional foundation for the k semantic framework. In: 22nd International Workshop Recent Trends in Algebraic Development Techniques, WADT 2014 (in press)
Ciobâcă, Ş.: Reducing partial equivalence to partial correctness. In: 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 164–171, September 2014
Ciobâcă, Ş., Lucanu, D., Rusu, V., Roşu, G.: A language-independent proof system for mutual program equivalence. Technical report 14–01, Al. I. Cuza University (2014)
Ciobâcă, Ş., Lucanu, D., Rusu, V., Roşu, G.: A language-independent proof system for mutual program equivalence. In: Merz, S., Pang, J. (eds.) ICFEM 2014. LNCS, vol. 8829, pp. 75–90. Springer, Heidelberg (2014)
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.L.: All About Maude, A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)
Ştefănescu, A., Ciobâcă, Ş., Mereuta, R., Moore, B.M., Şerbănută, T.F., Roşu, G.: All-path reachability logic. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol. 8560, pp. 425–440. Springer, Heidelberg (2014)
Diaconescu, R.: Institution-Independent Model Theory. Birkhauser, Basel (2008)
Haxthausen, A.E., Nickl, F.: Pushouts of order-sorted algebraic specifications. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol. 1101, pp. 132–147. Springer, Heidelberg (1996)
Roşu, G., Ellison, C., Schulte, W.: Matching logic: an alternative to Hoare/Floyd logic. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 142–162. Springer, Heidelberg (2011)
Roşu, G.: Matching logic: a logic for structural reasoning. Technical report, University of Illinois, January 2014. http://hdl.handle.net/2142/47004
Roşu, G.: Matching logic (invited talk). In: 26th International Conference on Rewriting Techniques and Applications, RTA 2015, 29 June - 1 July, Warsaw, Poland (2015, to appear)
Roşu, G., Ştefanescu, A., Ştefan Ciobâcă, Moore, B.M.: One-path reachability logic. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, 25–28 June 2013, New Orleans, LA, USA, pp. 358–367 (2013). http://dx.doi.org/10.1109/LICS.2013.42
Roşu, G., Şerbănuţă, T.F.: An overview of the K semantic framework. J. Log. Algebr. Program. 79(6), 397–434 (2010)
Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2012). http://dx.doi.org/10.1007/978-3-642-17336-3
Schröder, L., Mossakowski, T., Tarlecki, A., Hoffman, P., Klin, B.: Amalgamation in the semantics of CASL. Theoret. Comput. Sci. 331(1), 215–247 (2005). http://dx.doi.org/10.1016/j.tcs.2004.09.037
Şerbănuţă, T.F., Roşu, G., Meseguer, J.: A rewriting logic approach to operational semantics. Inf. Comput. 207(2), 305–340 (2009)
Winskel, G., Nielsen, M.: Categories in concurrency. In: Pitts, A.M., Dybjer, P. (eds.) Semantics and Logics of Computation, Publications of the Newton Institute, pp. 299–354. Cambridge University Press, Cambridge (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ciobâcă, Ş., Lucanu, D., Rusu, V., Roşu, G. (2015). A Theoretical Foundation for Programming Languages Aggregation. In: Codescu, M., Diaconescu, R., Țuțu, I. (eds) Recent Trends in Algebraic Development Techniques. WADT 2015. Lecture Notes in Computer Science(), vol 9463. Springer, Cham. https://doi.org/10.1007/978-3-319-28114-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-28114-8_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28113-1
Online ISBN: 978-3-319-28114-8
eBook Packages: Computer ScienceComputer Science (R0)