Skip to main content
SpringerLink
Log in

A Theoretical Foundation for Programming Languages Aggregation

  • Conference paper
  • First Online:
Recent Trends in Algebraic Development Techniques (WADT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9463))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: Order-sorted generalization. Electr. Notes Theor. Comput. Sci. 246, 27–38 (2009)

    Article  Google Scholar 

  2. Chiriţă, C.E.: An institutional foundation for the k semantic framework. Master’s thesis, University of Bucharest (2014)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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

    Google Scholar 

  5. 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)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. 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)

    MATH  Google Scholar 

  8. Ş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)

    Google Scholar 

  9. Diaconescu, R.: Institution-Independent Model Theory. Birkhauser, Basel (2008)

    MATH  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Roşu, G.: Matching logic: a logic for structural reasoning. Technical report, University of Illinois, January 2014. http://hdl.handle.net/2142/47004

  13. 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)

    Google Scholar 

  14. 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

  15. Roşu, G., Şerbănuţă, T.F.: An overview of the K semantic framework. J. Log. Algebr. Program. 79(6), 397–434 (2010)

    Article  MathSciNet  Google Scholar 

  16. 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

    Book  Google Scholar 

  17. 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

    Article  MathSciNet  Google Scholar 

  18. Şerbănuţă, T.F., Roşu, G., Meseguer, J.: A rewriting logic approach to operational semantics. Inf. Comput. 207(2), 305–340 (2009)

    Article  MathSciNet  Google Scholar 

  19. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. “Alexandru Ioan Cuza” University, Iaşi, Romania

    Ştefan Ciobâcă, Dorel Lucanu & Grigore Roşu

  2. Inria Lille, Villeneuve-d’ascq, France

    Vlad Rusu

  3. University of Illinois at Urbana-Champaign, Champaign, USA

    Grigore Roşu

Authors
  1. Ştefan Ciobâcă
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dorel Lucanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vlad Rusu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Grigore Roşu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ştefan Ciobâcă .

Editor information

Editors and Affiliations

  1. Otto-von-Guericke-Universität Magedeburg , Magdeburg, Germany

    Mihai Codescu

  2. Simion Stoilow Institute of Mathematics of the Romanian Academy, Bucharest, Romania

    Răzvan Diaconescu

  3. Royal Holloway University of London, Egham, UK

    Ionuț Țuțu

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation