发布求助
文献互助 智能选刊 最新文献

Journal of Computer Languages最新文献

筛选
英文 中文
Hapi: A domain-specific language for the declaration of access policies Hapi:用于声明访问策略的特定于领域的语言
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-09-01 DOI: 10.1016/j.cola.2022.101153
Vinícius Julião Ramos, Alexander Holmquist, Fernando Magno Quintão Pereira
{"title":"Hapi: A domain-specific language for the declaration of access policies","authors":"Vinícius Julião Ramos, Alexander Holmquist, Fernando Magno Quintão Pereira","doi":"10.1016/j.cola.2022.101153","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101153","url":null,"abstract":"","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"81 1","pages":"101153"},"PeriodicalIF":2.2,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76139342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Design, implementation and evaluation of the Hedy programming language Hedy编程语言的设计、实现和评估
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-09-01 DOI: 10.1016/j.cola.2022.101158
Marleen Gilsing, Jesús Pelay, F. Hermans
{"title":"Design, implementation and evaluation of the Hedy programming language","authors":"Marleen Gilsing, Jesús Pelay, F. Hermans","doi":"10.1016/j.cola.2022.101158","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101158","url":null,"abstract":"","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"32 1","pages":"101158"},"PeriodicalIF":2.2,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78569509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Minimising line segments in linear diagrams is NP-hard 最小化线性图中的线段是NP困难的
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-08-01 DOI: 10.1016/j.cola.2022.101136
Peter Chapman, Kevin Sim, Huang Hao Chen
{"title":"Minimising line segments in linear diagrams is NP-hard","authors":"Peter Chapman,&nbsp;Kevin Sim,&nbsp;Huang Hao Chen","doi":"10.1016/j.cola.2022.101136","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101136","url":null,"abstract":"<div><p>Linear diagrams have been shown to be an effective method of representing set-based data. Moreover, a number of guidelines have been proven to improve the efficacy of linear diagrams. One of these guidelines is to minimise the number of line segments appearing in a diagram. We show this problem to be NP-hard.</p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"71 ","pages":"Article 101136"},"PeriodicalIF":2.2,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2590118422000351/pdfft?md5=a982e755f1407cdf8298654e8eace4ec&pid=1-s2.0-S2590118422000351-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72268972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A surprisingly simple Lua compiler - Extended version 一个令人惊讶的简单Lua编译器-扩展版本
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-08-01 DOI: 10.1016/j.cola.2022.101151
Hugo Musso Gualandi, R. Ierusalimschy
{"title":"A surprisingly simple Lua compiler - Extended version","authors":"Hugo Musso Gualandi, R. Ierusalimschy","doi":"10.1016/j.cola.2022.101151","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101151","url":null,"abstract":"","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"13 1","pages":"101151"},"PeriodicalIF":2.2,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82065040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel data-driven approach on inferring loop invariants for C programs 推导C程序循环不变量的一种新的数据驱动方法
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-08-01 DOI: 10.1016/j.cola.2022.101135
Hong Lu , Huitao Wang , Jiacheng Gui , Panfeng Chen , Hao Huang
{"title":"A novel data-driven approach on inferring loop invariants for C programs","authors":"Hong Lu ,&nbsp;Huitao Wang ,&nbsp;Jiacheng Gui ,&nbsp;Panfeng Chen ,&nbsp;Hao Huang","doi":"10.1016/j.cola.2022.101135","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101135","url":null,"abstract":"<div><p><span>Inspired by the procedure that experts construct loop invariants, we propose a novel data-driven approach to automatically infer loop invariants. The approach consists of two phases, data-driven inference of candidate invariants and validity check of loop invariants. Inspired by the procedure that experts construct loop invariants, we propose a novel data-driven approach to automatically infer loop invariants for C programs. The approach consists of two phases, data-driven inference of candidate invariants and validity check of loop invariants. The first phase generates candidate invariants by solving </span>polynomial equations and synthesizing the extended loop conditions. The second phase prunes out spurious predicates and redundant predicates in the candidate invariants. The experimental results demonstrate that the proposed approach generates valid invariants for 35 benchmarks out of 38. The proposed approach costs less time to generate more informative and precise invariants than the state-of-the-art methods.</p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"71 ","pages":"Article 101135"},"PeriodicalIF":2.2,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automatic mandala pattern design and generation based on COOM framework 基于COOM框架的曼荼罗图案自动设计与生成
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-08-01 DOI: 10.1016/j.cola.2022.101138
Shuchang Xu, Yu Zhang, Simin Yan
{"title":"Automatic mandala pattern design and generation based on COOM framework","authors":"Shuchang Xu, Yu Zhang, Simin Yan","doi":"10.1016/j.cola.2022.101138","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101138","url":null,"abstract":"","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"1 1","pages":"101138"},"PeriodicalIF":2.2,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73168658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Gravity++: A graph-based framework for constructing interactive visualization narratives Gravity++：一个基于图形的交互式可视化叙事构建框架
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-08-01 DOI: 10.1016/j.cola.2022.101125
Humphrey O. Obie , Dac Thanh Chuong Ho , Iman Avazpour , John Grundy , Mohamed Abdelrazek , Tomasz Bednarz , Caslon Chua
{"title":"Gravity++: A graph-based framework for constructing interactive visualization narratives","authors":"Humphrey O. Obie ,&nbsp;Dac Thanh Chuong Ho ,&nbsp;Iman Avazpour ,&nbsp;John Grundy ,&nbsp;Mohamed Abdelrazek ,&nbsp;Tomasz Bednarz ,&nbsp;Caslon Chua","doi":"10.1016/j.cola.2022.101125","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101125","url":null,"abstract":"<div><p><span>Interactive visualizations play a key part in the exploration and analysis of data, and in the creation of visual data stories. This paper describes a new graph-based framework for developing interactive visualizations for creating coherent visual data stories. We have realized our framework in a prototype tool named Gravity++. Gravity++ uses a novel graph architecture for modeling interaction, data navigation, and changes in visual representation to better communicate findings to an audience. The combination of these graph models provides better support and flexibility for designing interactive visualizations, data navigation, and visual data stories. We demonstrate the applicability of this framework by two example </span>usage scenarios. We also report on an evaluation study conducted with representative participants. All participants successfully created meaningful visual data stories with a high level of complexity. Our results also show that Gravity++ is easy to use and supports the understanding and sense-making of the visual data story creation process.</p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"71 ","pages":"Article 101125"},"PeriodicalIF":2.2,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Minimising line segments in linear diagrams is NP-hard 最小化线性图中的线段是np困难的
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-07-01 DOI: 10.1016/j.cola.2022.101136
P. Chapman, Kevin Sim, Huanghao Chen
{"title":"Minimising line segments in linear diagrams is NP-hard","authors":"P. Chapman, Kevin Sim, Huanghao Chen","doi":"10.1016/j.cola.2022.101136","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101136","url":null,"abstract":"","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"79 1","pages":"101136"},"PeriodicalIF":2.2,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91176328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Generating customized low-code development platforms for digital twins 为数字孪生生成定制的低代码开发平台
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-06-01 DOI: 10.1016/j.cola.2022.101117
Manuela Dalibor , Malte Heithoff , Judith Michael , Lukas Netz , Jérôme Pfeiffer , Bernhard Rumpe , Simon Varga , Andreas Wortmann
{"title":"Generating customized low-code development platforms for digital twins","authors":"Manuela Dalibor ,&nbsp;Malte Heithoff ,&nbsp;Judith Michael ,&nbsp;Lukas Netz ,&nbsp;Jérôme Pfeiffer ,&nbsp;Bernhard Rumpe ,&nbsp;Simon Varga ,&nbsp;Andreas Wortmann","doi":"10.1016/j.cola.2022.101117","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101117","url":null,"abstract":"<div><p>A digital twin<span> improves our use of a cyber–physical system and understanding of its emerging behavior. To this effect, a digital twin is to be developed and configured and potentially also operated by domain experts, who rarely have a professional software engineering<span> background and for whom easy access and support, e.g., in form of low-code platforms are missing. In this paper, we report on an integrated method for the model-driven engineering of low-code development platforms for digital twins that enables domain experts to create and operate digital twins for cyber–physical systems using the most appropriate modeling languages. The foundation of this method is (1) a code generation infrastructure for information systems combined with (2) an extensible base architecture for self-adaptive digital twins and (3) reusable language components for their configuration. Using this method, software engineers first configure the information system with the required modeling languages to generate the low-code development platform for digital twins before domain experts leverage the generated platform to create digital twins. This two-step method facilitates creating tailored low-code development platforms as well as creating and operating customized digital twins for a variety of applications.</span></span></p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"70 ","pages":"Article 101117"},"PeriodicalIF":2.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72239179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Automatic resolution of model merging conflicts using quality-based reinforcement learning 基于质量的强化学习模型合并冲突的自动解决
IF 2.2 3区 计算机科学
Journal of Computer Languages Pub Date : 2022-06-01 DOI: 10.1016/j.cola.2022.101123
Mohammadreza Sharbaf, B. Zamani, G. Sunyé
{"title":"Automatic resolution of model merging conflicts using quality-based reinforcement learning","authors":"Mohammadreza Sharbaf, B. Zamani, G. Sunyé","doi":"10.1016/j.cola.2022.101123","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101123","url":null,"abstract":"","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"65 1","pages":"101123"},"PeriodicalIF":2.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82330729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信