A theoretical foundation for programming languages aggregation

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

Original languageEnglish (US)
Title of host publicationRecent Trends in Algebraic Development Techniques - 22nd International Workshop, WADT 2014, Revised Selected Papers
EditorsIonuţ Ţuţu, Mihai Codescu, Răzvan Diaconescu
PublisherSpringer
Pages30-47
Number of pages18
ISBN (Print)9783319281131
DOIs
StatePublished - 2015
Event22nd International Workshop on Recent Trends in Algebraic Development Techniques, WADT 2014 - Sinaia, Romania
Duration: Sep 4 2014Sep 7 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9463
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Workshop on Recent Trends in Algebraic Development Techniques, WADT 2014
Country/TerritoryRomania
CitySinaia
Period9/4/149/7/14

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A theoretical foundation for programming languages aggregation'. Together they form a unique fingerprint.

Cite this