Ensuring non-interference of composable language extensions

Ted Kaminski; Eric Van Wyk

doi:10.1145/3136014.3136023

Ensuring non-interference of composable language extensions

Ted Kaminski, Eric Van Wyk

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Scopus citations

Abstract

Extensible language frameworks aim to allow independentlydeveloped language extensions to be easily added to a host programming language. It should not require being a compiler expert, and the resulting compiler should "just work" as expected. Previous work has shown how specifications for parsing (based on context free grammars) and for semantic analysis (based on attribute grammars) can be automatically and reliably composed, ensuring that the resulting compiler does not terminate abnormally. However, thiswork does not ensure that a property proven to hold for a language (or extended language) still holds when another extension is added, a problemwe call interference.We present a solution to this problem using of a logical notion of coherence.We showthat a useful class of language extensions, implemented as attribute grammars, preserve all coherent properties. If we also restrict extensions to only making use of coherent properties in establishing their correctness, then the correctness properties of each extension will hold when composed with other extensions. As a result, there can be no interference: each extension behaves as specified.

Original language	English (US)
Title of host publication	SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017
Editors	Bernhard Rumpe, Marjan Mernik, Benoit Combemale
Publisher	Association for Computing Machinery, Inc
Pages	163-174
Number of pages	12
ISBN (Electronic)	9781450355254
DOIs	https://doi.org/10.1145/3136014.3136023
State	Published - Oct 23 2017
Event	10th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2017 - Vancouver, Canada Duration: Oct 23 2017 → Oct 24 2017

Publication series

Name	SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017

Other

Other	10th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2017
Country/Territory	Canada
City	Vancouver
Period	10/23/17 → 10/24/17

Bibliographical note

Funding Information:
This material is based upon work supported by the National Science Foundation (NSF) under Grant No. 1047961. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the NSF.

Publisher Copyright:
© 2017 Association for Computing Machinery.

Keywords

Attribute grammars
Language extension composition

Access

10.1145/3136014.3136023

OpenUrl availability

Full text

Cite this

Kaminski, T., & Van Wyk, E. (2017). Ensuring non-interference of composable language extensions. In B. Rumpe, M. Mernik, & B. Combemale (Eds.), SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017 (pp. 163-174). (SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017). Association for Computing Machinery, Inc. https://doi.org/10.1145/3136014.3136023

Ensuring non-interference of composable language extensions. / Kaminski, Ted; Van Wyk, Eric.
SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017. ed. / Bernhard Rumpe; Marjan Mernik; Benoit Combemale. Association for Computing Machinery, Inc, 2017. p. 163-174 (SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kaminski, T & Van Wyk, E 2017, Ensuring non-interference of composable language extensions. in B Rumpe, M Mernik & B Combemale (eds), SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017. SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017, Association for Computing Machinery, Inc, pp. 163-174, 10th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2017, Vancouver, Canada, 10/23/17. https://doi.org/10.1145/3136014.3136023

Kaminski T, Van Wyk E. Ensuring non-interference of composable language extensions. In Rumpe B, Mernik M, Combemale B, editors, SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017. Association for Computing Machinery, Inc. 2017. p. 163-174. (SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017). doi: 10.1145/3136014.3136023

Kaminski, Ted ; Van Wyk, Eric. / Ensuring non-interference of composable language extensions. SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017. editor / Bernhard Rumpe ; Marjan Mernik ; Benoit Combemale. Association for Computing Machinery, Inc, 2017. pp. 163-174 (SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017).

@inproceedings{143f982bd6b241af86aee3a84ec3f540,

title = "Ensuring non-interference of composable language extensions",

abstract = "Extensible language frameworks aim to allow independentlydeveloped language extensions to be easily added to a host programming language. It should not require being a compiler expert, and the resulting compiler should {"}just work{"} as expected. Previous work has shown how specifications for parsing (based on context free grammars) and for semantic analysis (based on attribute grammars) can be automatically and reliably composed, ensuring that the resulting compiler does not terminate abnormally. However, thiswork does not ensure that a property proven to hold for a language (or extended language) still holds when another extension is added, a problemwe call interference.We present a solution to this problem using of a logical notion of coherence.We showthat a useful class of language extensions, implemented as attribute grammars, preserve all coherent properties. If we also restrict extensions to only making use of coherent properties in establishing their correctness, then the correctness properties of each extension will hold when composed with other extensions. As a result, there can be no interference: each extension behaves as specified.",

keywords = "Attribute grammars, Language extension composition",

author = "Ted Kaminski and {Van Wyk}, Eric",

note = "Funding Information: This material is based upon work supported by the National Science Foundation (NSF) under Grant No. 1047961. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the NSF. Publisher Copyright: {\textcopyright} 2017 Association for Computing Machinery.; 10th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2017 ; Conference date: 23-10-2017 Through 24-10-2017",

year = "2017",

month = oct,

day = "23",

doi = "10.1145/3136014.3136023",

language = "English (US)",

series = "SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017",

publisher = "Association for Computing Machinery, Inc",

pages = "163--174",

editor = "Bernhard Rumpe and Marjan Mernik and Benoit Combemale",

booktitle = "SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017",

}

TY - GEN

T1 - Ensuring non-interference of composable language extensions

AU - Kaminski, Ted

AU - Van Wyk, Eric

N1 - Funding Information: This material is based upon work supported by the National Science Foundation (NSF) under Grant No. 1047961. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the NSF. Publisher Copyright: © 2017 Association for Computing Machinery.

PY - 2017/10/23

Y1 - 2017/10/23

N2 - Extensible language frameworks aim to allow independentlydeveloped language extensions to be easily added to a host programming language. It should not require being a compiler expert, and the resulting compiler should "just work" as expected. Previous work has shown how specifications for parsing (based on context free grammars) and for semantic analysis (based on attribute grammars) can be automatically and reliably composed, ensuring that the resulting compiler does not terminate abnormally. However, thiswork does not ensure that a property proven to hold for a language (or extended language) still holds when another extension is added, a problemwe call interference.We present a solution to this problem using of a logical notion of coherence.We showthat a useful class of language extensions, implemented as attribute grammars, preserve all coherent properties. If we also restrict extensions to only making use of coherent properties in establishing their correctness, then the correctness properties of each extension will hold when composed with other extensions. As a result, there can be no interference: each extension behaves as specified.

AB - Extensible language frameworks aim to allow independentlydeveloped language extensions to be easily added to a host programming language. It should not require being a compiler expert, and the resulting compiler should "just work" as expected. Previous work has shown how specifications for parsing (based on context free grammars) and for semantic analysis (based on attribute grammars) can be automatically and reliably composed, ensuring that the resulting compiler does not terminate abnormally. However, thiswork does not ensure that a property proven to hold for a language (or extended language) still holds when another extension is added, a problemwe call interference.We present a solution to this problem using of a logical notion of coherence.We showthat a useful class of language extensions, implemented as attribute grammars, preserve all coherent properties. If we also restrict extensions to only making use of coherent properties in establishing their correctness, then the correctness properties of each extension will hold when composed with other extensions. As a result, there can be no interference: each extension behaves as specified.

KW - Attribute grammars

KW - Language extension composition

UR - http://www.scopus.com/inward/record.url?scp=85037142712&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85037142712&partnerID=8YFLogxK

U2 - 10.1145/3136014.3136023

DO - 10.1145/3136014.3136023

M3 - Conference contribution

AN - SCOPUS:85037142712

T3 - SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017

SP - 163

EP - 174

BT - SLE 2017 - Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2017

A2 - Rumpe, Bernhard

A2 - Mernik, Marjan

A2 - Combemale, Benoit

PB - Association for Computing Machinery, Inc

T2 - 10th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2017

Y2 - 23 October 2017 through 24 October 2017

ER -

Ensuring non-interference of composable language extensions

Abstract

Publication series

Other

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this