{"title":"Taming stateful computations in Rust with typestates","authors":"J. Duarte, A. Ravara","doi":"10.1016/j.cola.2022.101154","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101154","url":null,"abstract":"","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"15 1","pages":"101154"},"PeriodicalIF":2.2,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85118076","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}
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}
{"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}
{"title":"Minimising line segments in linear diagrams is NP-hard","authors":"Peter Chapman, Kevin Sim, 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}
G. D. J. Barbosa, Dalai Dos Santos Ribeiro, Marisa Do Carmo Silva, H. Lopes, Simone Diniz Junqueira Barbosa
{"title":"Investigating the relationships between class probabilities and users' appropriate trust in computer vision classifications of ambiguous images","authors":"G. D. J. Barbosa, Dalai Dos Santos Ribeiro, Marisa Do Carmo Silva, H. Lopes, Simone Diniz Junqueira Barbosa","doi":"10.1016/j.cola.2022.101149","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101149","url":null,"abstract":"","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"1 1","pages":"101149"},"PeriodicalIF":2.2,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81950756","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}
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 , Huitao Wang , Jiacheng Gui , Panfeng Chen , 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}
Mohammadreza Sharbaf , Bahman Zamani , Gerson Sunyé
{"title":"Automatic resolution of model merging conflicts using quality-based reinforcement learning","authors":"Mohammadreza Sharbaf , Bahman Zamani , Gerson Sunyé","doi":"10.1016/j.cola.2022.101123","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101123","url":null,"abstract":"<div><p><span><span>Modeling is an activity in the software development life cycle in which different experts and stakeholders collaborate as a team. In collaborative modeling, adhering to the optimistic versioning paradigm allows users to apply concurrent changes to the same model. In such a situation, conflicts may arise. To have an integrated yet consistent merged model, conflicts have to be resolved. To this end, automation is currently at its limit or is not supported at all, and user interaction is often required. To alleviate this flaw, there is an opportunity to apply </span>Artificial Intelligence techniques in a collaborative modeling environment to empower the provisioning of automated and intelligent decision-making. In this paper, we propose the use of </span>reinforcement learning<span><span> algorithms to achieve merging conflict resolution with a high degree of automation. This enables the personalized and quality-based integration of model versions. To evaluate our idea, we demonstrate the resolution of UML class diagram conflicts using a learning process in an illustrative modeling scenario. We also show the applicability of our approach through a proof of concept implementation and assess its accuracy compared to the greedy and search-based algorithms. Moreover, we conducted an experience with five experts to evaluate the satisfaction of actual users with the selection of resolution actions for different conflicts. The result of the assessment validates our proposal with various </span>syntactic and semantic conflicts.</span></p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"71 ","pages":"Article 101123"},"PeriodicalIF":2.2,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72268942","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}
{"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}
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 , Dac Thanh Chuong Ho , Iman Avazpour , John Grundy , Mohamed Abdelrazek , Tomasz Bednarz , 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}