No Cover Image

Book chapter 827 views

FunKons: Component-Based Semantics in K

Peter Mosses Orcid Logo, Ferdinand Vesely

Rewriting Logic and Its Applications, Volume: 8663, Pages: 213 - 229

Swansea University Authors: Peter Mosses Orcid Logo, Ferdinand Vesely

Full text not available from this repository: check for access using links below.

Abstract

Modularity has been recognised as a problematic issue of programming language semantics, and various semantic frameworks have been designed with it in mind. Reusability is another desirable feature which, although not the same as modularity, can be enabled by it. The K Framework, based on Rewriting...

Full description

Published in: Rewriting Logic and Its Applications
ISBN: 978-3-319-12903-7 978-3-319-12904-4
ISSN: 0302-9743 1611-3349
Published: WRLA 2014: Rewriting Logic and Its Applications 2014
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa48793
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2019-02-11T20:04:25Z
last_indexed 2019-02-21T14:07:28Z
id cronfa48793
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2019-02-21T12:22:42.6353260</datestamp><bib-version>v2</bib-version><id>48793</id><entry>2019-02-11</entry><title>FunKons: Component-Based Semantics in K</title><swanseaauthors><author><sid>3f13b8ec315845c81d371f41e772399c</sid><ORCID>0000-0002-5826-7520</ORCID><firstname>Peter</firstname><surname>Mosses</surname><name>Peter Mosses</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>e54f54330e5abba1afddbfcb78ba54c1</sid><firstname>Ferdinand</firstname><surname>Vesely</surname><name>Ferdinand Vesely</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2019-02-11</date><deptcode>FGSEN</deptcode><abstract>Modularity has been recognised as a problematic issue of programming language semantics, and various semantic frameworks have been designed with it in mind. Reusability is another desirable feature which, although not the same as modularity, can be enabled by it. The K Framework, based on Rewriting Logic, has good modularity support, but reuse of specifications is not as well developed.The PLanCompS project is developing a framework providing an open-ended collection of reusable components for semantic specification. Each component specifies a single fundamental programming construct, or &#x2018;funcon&#x2019;. The semantics of concrete programming language constructs is given by translating them to combinations of funcons. In this paper, we show how this component-based approach can be seamlessly integrated with the K Framework. We give a component-based definition of CinK (a small subset of C++), using K to define its translation to funcons as well as the (dynamic) semantics of the funcons themselves.</abstract><type>Book chapter</type><journal>Rewriting Logic and Its Applications</journal><volume>8663</volume><paginationStart>213</paginationStart><paginationEnd>229</paginationEnd><publisher>WRLA 2014: Rewriting Logic and Its Applications</publisher><isbnPrint>978-3-319-12903-7</isbnPrint><isbnElectronic>978-3-319-12904-4</isbnElectronic><issnPrint>0302-9743</issnPrint><issnElectronic>1611-3349</issnElectronic><keywords/><publishedDay>16</publishedDay><publishedMonth>11</publishedMonth><publishedYear>2014</publishedYear><publishedDate>2014-11-16</publishedDate><doi>10.1007/978-3-319-12904-4_12</doi><url/><notes/><college>COLLEGE NANME</college><department>Science and Engineering - Faculty</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>FGSEN</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2019-02-21T12:22:42.6353260</lastEdited><Created>2019-02-11T15:30:23.0825695</Created><path><level id="1">College of Science</level><level id="2">College of Science</level></path><authors><author><firstname>Peter</firstname><surname>Mosses</surname><orcid>0000-0002-5826-7520</orcid><order>1</order></author><author><firstname>Ferdinand</firstname><surname>Vesely</surname><order>2</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2019-02-21T12:22:42.6353260 v2 48793 2019-02-11 FunKons: Component-Based Semantics in K 3f13b8ec315845c81d371f41e772399c 0000-0002-5826-7520 Peter Mosses Peter Mosses true false e54f54330e5abba1afddbfcb78ba54c1 Ferdinand Vesely Ferdinand Vesely true false 2019-02-11 FGSEN Modularity has been recognised as a problematic issue of programming language semantics, and various semantic frameworks have been designed with it in mind. Reusability is another desirable feature which, although not the same as modularity, can be enabled by it. The K Framework, based on Rewriting Logic, has good modularity support, but reuse of specifications is not as well developed.The PLanCompS project is developing a framework providing an open-ended collection of reusable components for semantic specification. Each component specifies a single fundamental programming construct, or ‘funcon’. The semantics of concrete programming language constructs is given by translating them to combinations of funcons. In this paper, we show how this component-based approach can be seamlessly integrated with the K Framework. We give a component-based definition of CinK (a small subset of C++), using K to define its translation to funcons as well as the (dynamic) semantics of the funcons themselves. Book chapter Rewriting Logic and Its Applications 8663 213 229 WRLA 2014: Rewriting Logic and Its Applications 978-3-319-12903-7 978-3-319-12904-4 0302-9743 1611-3349 16 11 2014 2014-11-16 10.1007/978-3-319-12904-4_12 COLLEGE NANME Science and Engineering - Faculty COLLEGE CODE FGSEN Swansea University 2019-02-21T12:22:42.6353260 2019-02-11T15:30:23.0825695 College of Science College of Science Peter Mosses 0000-0002-5826-7520 1 Ferdinand Vesely 2
title FunKons: Component-Based Semantics in K
spellingShingle FunKons: Component-Based Semantics in K
Peter Mosses
Ferdinand Vesely
title_short FunKons: Component-Based Semantics in K
title_full FunKons: Component-Based Semantics in K
title_fullStr FunKons: Component-Based Semantics in K
title_full_unstemmed FunKons: Component-Based Semantics in K
title_sort FunKons: Component-Based Semantics in K
author_id_str_mv 3f13b8ec315845c81d371f41e772399c
e54f54330e5abba1afddbfcb78ba54c1
author_id_fullname_str_mv 3f13b8ec315845c81d371f41e772399c_***_Peter Mosses
e54f54330e5abba1afddbfcb78ba54c1_***_Ferdinand Vesely
author Peter Mosses
Ferdinand Vesely
author2 Peter Mosses
Ferdinand Vesely
format Book chapter
container_title Rewriting Logic and Its Applications
container_volume 8663
container_start_page 213
publishDate 2014
institution Swansea University
isbn 978-3-319-12903-7
978-3-319-12904-4
issn 0302-9743
1611-3349
doi_str_mv 10.1007/978-3-319-12904-4_12
publisher WRLA 2014: Rewriting Logic and Its Applications
college_str College of Science
hierarchytype
hierarchy_top_id collegeofscience
hierarchy_top_title College of Science
hierarchy_parent_id collegeofscience
hierarchy_parent_title College of Science
department_str College of Science{{{_:::_}}}College of Science{{{_:::_}}}College of Science
document_store_str 0
active_str 0
description Modularity has been recognised as a problematic issue of programming language semantics, and various semantic frameworks have been designed with it in mind. Reusability is another desirable feature which, although not the same as modularity, can be enabled by it. The K Framework, based on Rewriting Logic, has good modularity support, but reuse of specifications is not as well developed.The PLanCompS project is developing a framework providing an open-ended collection of reusable components for semantic specification. Each component specifies a single fundamental programming construct, or ‘funcon’. The semantics of concrete programming language constructs is given by translating them to combinations of funcons. In this paper, we show how this component-based approach can be seamlessly integrated with the K Framework. We give a component-based definition of CinK (a small subset of C++), using K to define its translation to funcons as well as the (dynamic) semantics of the funcons themselves.
published_date 2014-11-16T03:59:27Z
_version_ 1763753032031404032
score 11.035634